SHORT: shortest hop routing tree for wireless sensor networks

Authors:
Yang Yang;Hui-Hai Wu;Hsiao-Hwa Chen
Affiliations:
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
Venue:
International Journal of Sensor Networks
Year:
2007

Citing 9
Cited 4

Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
A channel access scheme for large dense packet radio networks

Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Wireless sensor networks: a survey

Computer Networks: The International Journal of Computer and Telecommunications Networking
Dynamic Power Management in Wireless Sensor Networks

IEEE Design & Test
Data Gathering Algorithms in Sensor Networks Using Energy Metrics

IEEE Transactions on Parallel and Distributed Systems
Power efficient data gathering and aggregation in wireless sensor networks

ACM SIGMOD Record
Design and analysis of Hybrid Indirect Transmissions (HIT) for data gathering in wireless micro sensor networks

ACM SIGMOBILE Mobile Computing and Communications Review - Special issue on wireless pan & sensor networks
MESTER: minimum energy spanning tree for efficient routing in wireless sensor networks

QShine '06 Proceedings of the 3rd international conference on Quality of service in heterogeneous wired/wireless networks
An application-specific protocol architecture for wireless microsensor networks

IEEE Transactions on Wireless Communications

Alternating multiple tributaries + deltas

Proceedings of the 5th workshop on Data management for sensor networks
Performance analysis of ALOHA and p-persistent ALOHA for multi-hop underwater acoustic sensor networks

Cluster Computing
A survey of communication/networking in Smart Grids

Future Generation Computer Systems
Utilizing Neighbours-Table to Improve Tree Routing Protocol in ZigBee Network

Wireless Personal Communications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

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.