GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Location-aided routing (LAR) in mobile ad hoc networks
Wireless Networks
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
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
Power conservation and quality of surveillance in target tracking sensor networks
Proceedings of the 10th annual international conference on Mobile computing and networking
The flooding time synchronization protocol
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
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
Qos issues and qos constrained design of wireless sensor networks
Qos issues and qos constrained design of wireless sensor networks
Data forwarding in extremely low duty-cycle sensor networks with unreliable communication links
Proceedings of the 5th international conference on Embedded networked sensor systems
Efficient geographic routing over lossy links in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
A unified model for joint throughput-overhead analysis of mobile ad hoc networks
Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems
Opportunistic flooding in low-duty-cycle wireless sensor networks with unreliable links
Proceedings of the 15th annual international conference on Mobile computing and networking
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
MGR: a multicandidate greedy routing scheme in wireless sensor networks
Proceedings of the 4th International Conference on Uniquitous Information Management and Communication
IEEE Communications Magazine
Editorial: Control and optimization over wireless networks
Journal of Network and Computer Applications
Energy consumption bounds analysis and its applications for grid based wireless sensor networks
Journal of Network and Computer Applications
Hi-index | 0.00 |
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 such networks, traditional geographic routing protocols are inappropriate to obtain low latency routes due to route discovery and data forwarding latency. In this paper, we propose a novel multi-candidate selection (MCS) scheme for greedy routing that makes the best effort to find minimum latency routes in the sensor networks. In MCS, each source node sends an RREQ to a list of first wake-up forwarder candidates and selects a route with minimum estimated delivery latency based on their replies. The route found by MCS may be longer than that of distance-based greedy forwarding (DGF) (Finn, 1987). Hence, we introduce a latency-adaptive distance-based multi-candidate selection scheme for greedy forwarding to find routes with a small number of hops and acceptable delivery latency. Probabilistic analysis and simulation results demonstrate that MCS increases the routing performance significantly compared with DGF and ODML (Su et al., 2008) in terms of delivery latency.