Short: Shortest hop routing tree for wireless sensor networks

Yang Yang, Hui Hai Wu, Hsiao Hwa Chen

研究成果: Article同行評審

22 引文 斯高帕斯(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 minimise 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 neighbour) 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
頁(從 - 到)368-374
頁數7
期刊International Journal of Sensor Networks
2
發行號5-6
DOIs
出版狀態Published - 2007

All Science Journal Classification (ASJC) codes

  • 控制與系統工程
  • 電腦科學應用
  • 電腦網路與通信
  • 電氣與電子工程

指紋

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

引用此