Synchronization of pulse-coupled biological oscillators
SIAM Journal on Applied Mathematics
Energy-conserving access protocols for identification networks
IEEE/ACM Transactions on Networking (TON)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Energy-conserving protocols for wireless data networks
Energy-conserving protocols for wireless data networks
The flooding time synchronization protocol
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Decentralized synchronization protocols with nearest neighbor communication
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Firefly-inspired sensor network synchronicity with realistic radio effects
Proceedings of the 3rd international conference on Embedded networked sensor systems
IEEE Transactions on Neural Networks
Opportunistic forwarding in wireless networks with duty cycling
Proceedings of the third ACM workshop on Challenged networks
Proceedings of the 5th International Conference on Communication System Software and Middleware
| Hi-index | 0.00 |
The weakly pulse-coupled oscillator framework has proven to be a valuable resource for the development of peer-to-peer synchronization algorithms [9]. But leveraging it in a practical implementation (e.g. in wireless ad hoc/sensor networks) is problematic due to the difficulty in achieving precise coordination of broadcast messages. We found that a pseudo-random medium access control (MAC) protocol produces a super-linear increase in the number of messages required per node with increasing network size, which would normally discourage its use. However, introducing a "refractory period" reduces this growth to linear with a small constant (verified by numerical simulations). Furthermore, the refractory period allows for an increase in the coupling constant, effectively making the network "strongly" pulse-coupled. We show that the combination of the refractory period, strong coupling, and probabilistic medium access results in a significant decrease in the average number of messages required per node in several practical network topologies (and as much as ~ 90% over the original idealistic mechanism in line topologies).