Controlling route discovery for efficient routing in resource-constrained sensor networks

Authors:
Abhik Banerjee;Juki Wirawan Tantra;Chuan Heng Foh;Chai Kiat Yeo;Bu Sung Lee
Affiliations:
Centre for Multimedia and Network Technology, School of Computer Engineering, Nanyang Technological University, Singapore;Centre for Multimedia and Network Technology, School of Computer Engineering, Nanyang Technological University, Singapore;Centre for Multimedia and Network Technology, School of Computer Engineering, Nanyang Technological University, Singapore;Centre for Multimedia and Network Technology, School of Computer Engineering, Nanyang Technological University, Singapore;Centre for Multimedia and Network Technology, School of Computer Engineering, Nanyang Technological University, Singapore
Venue:
CCNC'10 Proceedings of the 7th IEEE conference on Consumer communications and networking conference
Year:
2010

Citing 3
Cited 1

The broadcast storm problem in a mobile ad hoc network

MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Comparison of broadcasting techniques for mobile ad hoc networks

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Gossip-based ad hoc routing

IEEE/ACM Transactions on Networking (TON)

Performance improvements for network-wide broadcast with instantaneous network information

Journal of Network and Computer Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Existing ad-hoc network routing strategies base their operations on flooding route requests throughout the network and choosing the shortest path thereafter. However, this typically results in a large number of unnecessary transmissions, which could be expensive for resource-constrained nodes such as those in a sensor network. In this paper, we propose a new mechanism HopAlert which optimizes route establishment and packet routing by limiting the number of nodes taking part in the route discovery process while achieving a low number of hops establishment. Using analysis and simulations, we show that this results in more routes with shorter hop counts than a reactive flooding protocol such as AODV while achieving higher savings.