Synchronization of pulse-coupled biological oscillators
SIAM Journal on Applied Mathematics
Timing-sync protocol for sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
ALOHA packet system with and without slots and capture
ACM SIGCOMM Computer Communication Review
Decentralized synchronization protocols with nearest neighbor communication
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Proceedings of the 11th annual international conference on Mobile computing and networking
DRAND: distributed randomized TDMA scheduling for wireless ad-hoc networks
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Proceedings of the 12th annual international conference on Mobile computing and networking
Z-MAC: a hybrid MAC for wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
IEEE Communications Magazine
Hi-index | 0.00 |
We show that CSMA is able to spontaneously synchronize transmissions in a wireless network with constant-size packets, and that this property can be used to devise efficient synchronized CSMA scheduling mechanisms without message passing. Using tools from queuing theory, we prove that for any connected wireless networks with arbitrary interference constraints, it is possible to implement self-synchronizing TDMA schedules without any explicit message passing or clock synchronization besides transmitting the original data packets, and the interaction can be fully local in that each node decides when to transmit next only by overhearing its neighbors' transmissions. We also provide a necessary and sufficient condition on the emergence of self-synchronization for a given TDMA schedule, and prove that such conditions for self-synchronization can be checked in a finite number of steps for a finite network topology.