Short: Shortest hop routing tree for wireless sensor networks

Yang Yang, Hui Hai Wu, Hsiao Hwa Chen

Research output: Contribution to journalArticlepeer-review

19 Citations (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.

Original languageEnglish
Pages (from-to)368-374
Number of pages7
JournalInternational Journal of Sensor Networks
Issue number5-6
Publication statusPublished - 2007

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Computer Science Applications
  • Control and Systems Engineering
  • 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