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.
| Original language | English |
|---|---|
| Pages (from-to) | 368-374 |
| Number of pages | 7 |
| Journal | International Journal of Sensor Networks |
| Volume | 2 |
| Issue number | 5-6 |
| DOIs | |
| Publication status | Published - 2007 |
All Science Journal Classification (ASJC) codes
- Control and Systems Engineering
- Computer Science Applications
- Computer Networks and Communications
- Electrical and Electronic Engineering