會議論文
| 學年 | 99 |
|---|---|
| 學期 | 1 |
| 發表日期 | 2010-09-06 |
| 作品名稱 | A New and Efficient Hierarchy-Based Anycast Routing Protocol for Wireless Sensor Networks |
| 作品名稱（其他語言） | |
| 著者 | Chuang, Po-Jen; Hu, Teng-Tai |
| 作品所屬單位 | 淡江大學電機工程學系 |
| 出版者 | New York: Institute of Electrical and Electronics Engineers (IEEE) |
| 會議名稱 | Parallel and Distributed Processing with Applications (ISPA), 2010 International Symposium on |
| 會議地點 | Taipei, Taiwan |
| 摘要 | This paper presents a Bidirectional Hierarchy-based Any cast Routing (BHAR) protocol for collecting data over multi-hop wireless sensor networks (WSNs). The BHAR protocol improves on existing HAR mechanisms to speed up the process of constructing hierarchical trees and repairing routes, and as a result to prolong network lifetime. Different from HAR, BHAR allows sinks and sources to initialize the construction of a hierarchical tree. By knowing only its own parent and neighbor nodes, each node can join a tree, exchange/refresh its routing table, and perform route repair without geographical information or being controlled remotely. Simulation results show that our BHAR performs apparently better than traditional HAR on network construction and route repair. |
| 關鍵字 | Bidirectional;First Declaration Wins;Hierarchy;Location-less;Routing Protocols;Wireless sensor networks |
| 語言 | en |
| 收錄於 | |
| 會議性質 | 國際 |
| 校內研討會地點 | |
| 研討會時間 | 20100906~20100909 |
| 通訊作者 | |
| 國別 | TWN |
| 公開徵稿 | Y |
| 出版型式 | |
| 出處 | Parallel and Distributed Processing with Applications (ISPA), 2010 International Symposium on, pp.334-341 |
| 相關連結 |
機構典藏連結 ( http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/70256 ) |