MGR: a multicandidate greedy routing scheme in wireless sensor networks

Authors:
Dang Tu Nguyen;Wook Choi;Minh Thiep Ha;Hyunseung Choo
Affiliations:
Sungkyunkwan University, S. Korea;Hankuk University of Foreign Studies, S. Korea;Sungkyunkwan University, S. Korea;Sungkyunkwan University, S. Korea
Venue:
Proceedings of the 4th International Conference on Uniquitous Information Management and Communication
Year:
2010

Citing 7
Cited 1

Integrated coverage and connectivity configuration in wireless sensor networks

Proceedings of the 1st international conference on Embedded networked sensor systems
Differentiated surveillance for sensor networks

Proceedings of the 1st international conference on Embedded networked sensor systems
Routing in a delay tolerant network

Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Power conservation and quality of surveillance in target tracking sensor networks

Proceedings of the 10th annual international conference on Mobile computing and networking
Towards optimal sleep scheduling in sensor networks for rare-event detection

IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Employing a novel two tiered network structure to extend the lifetime of WSNs

WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
A survey on sensor networks

IEEE Communications Magazine

Design and analysis of a multi-candidate selection scheme for greedy routing in wireless sensor networks

Journal of Network and Computer Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Sleep and wake-up scheduling of sensor nodes is an efficient solution to prolong the network lifetime. However, existing scheduling algorithms may significantly decrease the number of active nodes so that the network may be intermittently connected. In light of this, traditional geographic routing protocols are inappropriate to obtain low latency routes due to route discovery and data forwarding latency. Recently, Lu Su et al. have proposed an ODML routing scheme that finds low latency routes in intermittently-connected sensor networks by using RREQ and RREP messages [9]. Nevertheless, ODML does not consider the latency of RREP and has a high routing overhead. This paper proposes a novel Multicandidate Greedy Routing (MGR) scheme that makes the best effort to find minimum latency routes in wireless sensor networks. In MGR, each source node sends an RREQ to a set of first wake-up forwarder candidates and selects a route with minimum estimated delivery latency based on their replies. Simulation results demonstrate that our proposed scheme performs better than the distance-based greedy forwarding and ODML in terms of delivery latency and routing overhead.