Title: SHORT: shortest hop routing tree for wireless sensor networks

Authors: Yang Yang, Hui-Hai Wu, Hsiao-Hwa Chen

Addresses: Department of Electronic and Electrical Engineering, University College London, UK. ' School of Information Systems, Computing and Mathematics, Brunel University, UK. ' Institute of Communications Engineering, National SunYat-Sen University, Taiwan

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 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.

Keywords: wireless sensor networks; WSNs; routing protocols; delay; throughput; energy efficiency; network lifetime; wireless networks; shortest hop; closest neighbour; packet relay.

DOI: 10.1504/IJSNET.2007.014360

International Journal of Sensor Networks, 2007 Vol.2 No.5/6, pp.368 - 374

Published online: 03 Jul 2007 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article