Journal of Combinatorial Theory Series A
On the cover time and mixing time of random geometric graphs
Theoretical Computer Science
JAVeLEN - An ultra-low energy ad hoc wireless network
Ad Hoc Networks
Proceedings of the 2008 ACM symposium on Applied computing
IEEE Transactions on Information Theory
Battery recovery aware sensor networks
WiOPT'09 Proceedings of the 7th international conference on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Green wave: latency and capacity-efficient sleep scheduling for wireless networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Harnessing battery recovery effect in wireless sensor networks: experiments and analysis
IEEE Journal on Selected Areas in Communications - Special issue on simple wireless sensor networking solutions
Analysis of latency of stateless opportunistic forwarding in intermittently connected networks
IEEE/ACM Transactions on Networking (TON)
Low power, low delay: opportunistic routing meets duty cycling
Proceedings of the 11th international conference on Information Processing in Sensor Networks
Let the tree Bloom: scalable opportunistic routing with ORPL
Proceedings of the 11th ACM Conference on Embedded Networked Sensor Systems
| Hi-index | 0.00 |
Opportunistic forwarding, by which data is randomly relayed to a neighbor based on local network information, is a fault-tolerant distributed algorithm particularly useful for challenged ad hoc and sensor networks where it is difficult to obtain global topology information because of frequent disruptions. Also, duty cycling is a common technique that constrains the RF operations of wireless devices for saving the battery energy and thus extending the longevity of the network. The combination of opportunistic forwarding and duty cycling is a useful approach for wireless ad hoc and sensor networks that are plagued with energy constraints and poor connectivity. However, such a design is hampered by the difficulty of analyzing and controlling its performance, particularly, the end-to-end latency. This paper presents analytical results that shed light on the latency of opportunistic forwarding in wireless networks with duty cycling. In particular, we give approximation formulas and bounds for the expected latency of opportunistic forwarding in presence of duty cycling for general finite network topologies, and an exact formula for a specific regular network topology that captures some common sensor network deployment scenarios. Moreover, our results concern finite-sized networks, and hence, are practically more useful than other asymptotic analyses in the literature.