An average velocity-based routing protocol with low end-to-end delay for wireless sensor networks

Authors:
Sung-Chan Choi;Seong-Lyong Gong;Jang-Won Lee
Affiliations:
Communication Lab., Samsung Advanced Institute of Technology, Yongin, Korea;Dept. of Electrical and Electronic Engineering, Yonsei University, Seoul, Korea;Dept. of Electrical and Electronic Engineering, Yonsei University, Seoul, Korea
Venue:
IEEE Communications Letters
Year:
2009

Citing 4
Cited 1

GPSR: greedy perimeter stateless routing for wireless networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Medium access control with coordinated adaptive sleeping for wireless sensor networks

IEEE/ACM Transactions on Networking (TON)
Versatile low power media access for wireless sensor networks

SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Efficient geographic routing in multihop wireless networks

Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing

Delay-SRLG constrained, backup-shared path protection in WDM networks with sleep scheduling

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

To reduce energy consumption, in most MAC protocols for wireless sensor networks, listen-sleep cycles are adopted. However, even though it is a good solution for energy efficiency, it may introduce a large end-to-end delay due to sleep delay, since a node with a packet to transmit should wait until the next-hop node of the packet awakes. To resolve this issue, in this paper, we propose the Average Velocity-Based Routing (AVR) protocol for wireless sensor networks that aims at reducing the end-to-end delay. The AVR protocol is a kind of a geographic routing protocol that considers both location of a node and waiting time of a packet at the MAC layer. When a node can use information of n-hop away neighbor nodes, it calculates the n-hop average velocity for each of its one-hop neighbor nodes and forwards a packet to the neighbor node that has the highest n-hop average velocity. Simulation results show that as the knowledge range, n, increases, the average end-to-end delay decreases.