A N algorithm for mutual exclusion in decentralized systems
ACM Transactions on Computer Systems (TOCS)
Chinese remainder theorem: applications in computing, coding, cryptography
Chinese remainder theorem: applications in computing, coding, cryptography
Solution of a problem in concurrent programming control
Communications of the ACM
Asynchronous wakeup for ad hoc networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Quorum-based asynchronous power-saving protocols for IEEE 802.11 ad hoc networks
Mobile Networks and Applications
Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)
Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)
Practical asynchronous neighbor discovery and rendezvous for mobile sensing applications
Proceedings of the 6th ACM conference on Embedded network sensor systems
Energy conservation in wireless sensor networks: A survey
Ad Hoc Networks
MAC Essentials for Wireless Sensor Networks
IEEE Communications Surveys & Tutorials
Perfect difference sets for neighbor discovery: energy efficient and fair
Proceedings of the 3rd Extreme Conference on Communication: The Amazon Expedition
| Hi-index | 0.00 |
In schedule-based asynchronous duty cycling, nodes activate and deactivate their radio interfaces according to a specially designed wakeup schedule, which guarantees overlapping active time between nodes, irrespective of their synchronization offsets. When compared to synchronous duty cycling, such an approach has the advantage of being simple to implement, eliminating the need for synchronization protocols, complex computations or extra hardware. However, among published proposals, there is no single schedule-based mechanism that provides the lowest latency in all scenarios, when considering duty cycling symmetry, frame delivery probability and duty cycling rate. This paper introduces nested block designs, a new schedule that extends the use of block designs to application scenarios for which they were previously not possible or not as efficient as other schedules. Nested block designs provide the lowest latency among known schedule-based asynchronous duty cycling mechanisms for a wide range of applications, as confirmed by analytical models and real implementations on WSN motes.