GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Understanding packet delivery performance in dense wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Taming the underlying challenges of reliable multihop routing in sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
The number of neighbors needed for connectivity of wireless networks
Wireless Networks
Latency of wireless sensor networks with uncoordinated power saving mechanisms
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
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
Energy-efficient forwarding strategies for geographic routing in lossy 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
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
A survey of energy-efficient scheduling mechanisms in sensor networks
Mobile Networks and Applications
Scheduling sleeping nodes in high density cluster-based sensor networks
Mobile Networks and Applications
X-MAC: a short preamble MAC protocol for duty-cycled wireless sensor networks
Proceedings of the 4th international conference on Embedded networked sensor systems
Communicating via fireflies: geographic routing on duty-cycled sensors
Proceedings of the 6th international conference on Information processing in 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
Transmitting streaming data in wireless multimedia sensor networks with holes
Proceedings of the 6th international conference on Mobile and ubiquitous multimedia
A geographic routing protocol utilizing link lifetime and power control for mobile ad hoc networks
Proceedings of the 1st ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing
Mobile Networks and Applications
Proceedings of the 6th ACM conference on Embedded network sensor 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
Proceedings of the 7th ACM Conference on Embedded Networked Sensor Systems
Spatiotemporal Delay Control for Low-Duty-Cycle Sensor Networks
RTSS '09 Proceedings of the 2009 30th IEEE Real-Time Systems Symposium
Bounding Communication Delay in Energy Harvesting Sensor Networks
ICDCS '10 Proceedings of the 2010 IEEE 30th International Conference on Distributed Computing Systems
Randomly Duty-cycled Wireless Sensor Networks: Dynamics of Coverage
IEEE Transactions on Wireless Communications
BLR: beacon-less routing algorithm for mobile ad hoc networks
Computer Communications
Hi-index | 0.00 |
In asynchronous duty-cycled wireless sensor networks, it is desirable that the data forwarding scheme is adaptive to the dynamics caused by the uncertainty of sensor nodes’ working schedules. Contention-based forwarding is designed to adapt to the dynamic environments. In this work, we are interested in the contention-based geographic forwarding (CGF) for two asynchronous duty-cycling (ADC) models, which we refer to as uninterruptible ADC (U-ADC) and interruptible ADC (I-ADC). We propose a new residual time-aware routing metric for CGF in the I-ADC model and present a residual time-aware forwarding scheme using this metric. We evaluate the performance of CGF in both asynchronous duty-cycling models. Simulation results show that CGF in the U-ADC model provides a shorter delivery delay while suffering from a high sender effective duty cycle problem. CGF in the I-ADC model incurs a very long data delivery delay, but it can achieve a good load balancing among nodes. It is also demonstrated that the proposed residual time-aware forwarding scheme lowers the effects of the performance degradation caused by the pure asynchronous duty-cycling operation. Copyright © 2011 John Wiley & Sons, Ltd.