SIAM Review
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Asynchronous wakeup for ad hoc networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
A high-throughput path metric for multi-hop wireless routing
Proceedings of the 9th annual international conference on Mobile computing and networking
Timing-sync protocol for sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
TSync: a lightweight bidirectional time synchronization service for wireless sensor networks
ACM SIGMOBILE Mobile Computing and Communications Review - Special issue on wireless pan & sensor networks
The flooding time synchronization protocol
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Energy Scavenging for Mobile and Wireless Electronics
IEEE Pervasive Computing
Proceedings of the 3rd international conference on Embedded networked sensor systems
Wakeup scheduling in wireless sensor networks
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Perpetual environmentally powered sensor networks
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Adaptive duty cycling for energy harvesting systems
Proceedings of the 2006 international symposium on Low power electronics and design
Introduction to Probability Models, Ninth Edition
Introduction to Probability Models, Ninth Edition
Power management in energy harvesting sensor networks
ACM Transactions on Embedded Computing Systems (TECS) - Special Section LCTES'05
Data forwarding in extremely low duty-cycle sensor networks with unreliable communication links
Proceedings of the 5th international conference on Embedded networked sensor systems
Enabling Accurate Node Control in Randomized Duty Cycling Networks
ICDCS '08 Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems
Energy conservation in wireless sensor networks: A survey
Ad Hoc Networks
Leakage-aware energy synchronization for wireless sensor networks
Proceedings of the 7th international conference on Mobile systems, applications, and services
Green wave: latency and capacity-efficient sleep scheduling for wireless networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Proceedings of the 16th ACM/IEEE international symposium on Low power electronics and design
An Energy-Efficient Markov Chain-Based Randomized Duty Cycling Scheme for Wireless Sensor Networks
ICDCS '11 Proceedings of the 2011 31st International Conference on Distributed Computing Systems
Randomly Duty-cycled Wireless Sensor Networks: Dynamics of Coverage
IEEE Transactions on Wireless Communications
| Hi-index | 0.00 |
In environmentally-powered wireless sensor networks (EPWSNs), low latency wakeup scheduling and packet forwarding is challenging due to dynamic duty cycling, posing time-varying sleep latencies and necessitating the use of dynamic wakeup schedules. We show that the variance of the intervals between receiving wakeup slots affects the expected sleep latency: when the variance of the intervals is low (high), the expected latency is low (high). We therefore propose a novel scheduling scheme that uses the bit-reversal permutation sequence (BRPS) - a finite integer sequence that positions receiving wakeup slots as evenly as possible to reduce the expected sleep latency. At the same time, the sequence serves as a compact representation of wakeup schedules thereby reducing storage and communication overhead. But while low latency wakeup schedule can reduce per-hop delay in ideal conditions, it does not necessarily lead to low latency end-to-end paths because wireless link quality also plays a significant role in the performance of packet forwarding. We therefore formulate expected transmission delay (ETD), a metric that simultaneously considers sleep latency and wireless link quality. We show that the metric is left-monotonic and left-isotonic, proving that its use in distributed algorithms such as the distributed Bellman-Ford yields consistent, loop-free and optimal paths. We perform extensive simulations using real-world energy harvesting traces to evaluate the performance of the scheduling and forwarding scheme.