SHORT: Shortest hop routing tree for wireless sensor networks

Yang Yang, Hui Hai Wu, Hsiao Hwa Chen

研究成果: Conference contribution

32 引文 斯高帕斯(Scopus)

摘要

For time-sensitive applications requiring frequent data collections from a remote wireless sensor network, it is a challenging task to design an efficient routing scheme that can minimize delay and also offer good performance in energy efficiency, network lifetime and throughput. In this paper, we propose a new routing scheme, called Shortest Hop Routing Tree (SHORT), to achieve those design objectives through effectively generating simultaneous communication pairs and identifying the shortest hop (closest neighbor) for packet relay. Compared with the existing popular schemes such as PEGASIS, BINARY and PEDAP-PA, SHORT offers the best "energy × delay" performance and has the capability to achieve a very good balance among different performance metrics.

原文English
主出版物標題2006 IEEE International Conference on Communications, ICC 2006
頁面3450-3454
頁數5
DOIs
出版狀態Published - 2006
事件2006 IEEE International Conference on Communications, ICC 2006 - Istanbul, Turkey
持續時間: 2006 七月 112006 七月 15

出版系列

名字IEEE International Conference on Communications
8
ISSN(列印)0536-1486

Other

Other2006 IEEE International Conference on Communications, ICC 2006
國家Turkey
城市Istanbul
期間06-07-1106-07-15

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

指紋 深入研究「SHORT: Shortest hop routing tree for wireless sensor networks」主題。共同形成了獨特的指紋。

  • 引用此

    Yang, Y., Wu, H. H., & Chen, H. H. (2006). SHORT: Shortest hop routing tree for wireless sensor networks. 於 2006 IEEE International Conference on Communications, ICC 2006 (頁 3450-3454). [4025007] (IEEE International Conference on Communications; 卷 8). https://doi.org/10.1109/ICC.2006.255606