English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 52513/87668 (60%)
造訪人次 : 9356683      線上人數 : 264
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/97774

    題名: A Path Recovery Routing Protocol Based on Clustering Coefficient in Ad Hoc Networks
    作者: YAO, Chenhan;TSAI, Yihjia;HUANG, Wenfa
    貢獻者: 淡江大學資訊工程學系
    關鍵詞: Ad Hoc Networks;Routing Protocol;Local Recovery;Clustering Coefficient;Complex Network
    日期: 2012-01
    上傳時間: 2014-04-21 14:42:56 (UTC+8)
    出版者: Bethel: Binary Information Press
    摘要: In ad hoc network, nodes communicate with each other through wireless multi-hop links. When a node wants to send data to another node, it uses some routing algorithm to find the path before data delivery. In on-demand routing protocol, the source asks its neighbors to find the route leading to the destination. Route discovery is typically performed via flooding, which consumes a lot of control packets. Due to node mobility, the network topology change frequently and cause the route broken. In this paper, we propose a local path recovery routing protocol based on clustering coefficient (LPRCC) which can reduce the route discovery times when route failure occur. The clustering coefficient is one of properties in complex network. Simulation results show our protocol can decrease the number of control packets and increase route delivery ratio.
    關聯: Journal of Computational Information Systems 8(2), pp.469-476
    顯示於類別:[資訊工程學系暨研究所] 期刊論文


    檔案 描述 大小格式瀏覽次數



    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回饋