| A Path Recovery Routing Protocol Based on Clustering Coefficient in Ad Hoc Networks | |
|---|---|
| 學年 | 100 |
| 學期 | 1 |
| 出版（發表）日期 | 2012-01-01 |
| 作品名稱 | A Path Recovery Routing Protocol Based on Clustering Coefficient in Ad Hoc Networks |
| 作品名稱（其他語言） | |
| 著者 | YAO, Chenhan; TSAI, Yihjia; HUANG, Wenfa |
| 單位 | 淡江大學資訊工程學系暨研究所 |
| 出版者 | Bethel: Binary Information Press |
| 著錄名稱、卷期、頁數 | Journal of Computational Information Systems 8(2), pp.469-476 |
| 摘要 | 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. |
| 關鍵字 | |
| 語言 | en_US |
| ISSN | 1553-9105 |
| 期刊性質 | 國外 |
| 收錄於 | EI |
| 產學合作 | |
| 通訊作者 | |
| 審稿制度 | 否 |
| 國別 | USA |
| 公開徵稿 | |
| 出版型式 | ,紙本 |
| 相關連結 |
機構典藏連結 ( http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/97774 ) |
| SDGS | 產業創新與基礎設施 |
GoogleAnalytics