SHORT: Shortest hop routing tree for wireless sensor networks

Yang Yang, Hui Hai Wu, Hsiao-Hwa Chen

Research output: Chapter in Book/Report/Conference proceedingConference contribution

32 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publication2006 IEEE International Conference on Communications, ICC 2006
Pages3450-3454
Number of pages5
DOIs
Publication statusPublished - 2006 Dec 1
Event2006 IEEE International Conference on Communications, ICC 2006 - Istanbul, Turkey
Duration: 2006 Jul 112006 Jul 15

Publication series

NameIEEE International Conference on Communications
Volume8
ISSN (Print)0536-1486

Other

Other2006 IEEE International Conference on Communications, ICC 2006
CountryTurkey
CityIstanbul
Period06-07-1106-07-15

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'SHORT: Shortest hop routing tree for wireless sensor networks'. Together they form a unique fingerprint.

  • Cite this

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