Homeotaxis: Coordination with Persistent Time-Loops
SAB '08 Proceedings of the 10th international conference on Simulation of Adaptive Behavior: From Animals to Animats
Phase Patterns of Coupled Oscillators with Application to Wireless Communication
Bio-Inspired Computing and Communication
A low-complexity scheduling algorithm for proportional fairness in body area networks
BodyNets '09 Proceedings of the Fourth International Conference on Body Area Networks
A Survey of Models and Design Methods for Self-organizing Networked Systems
IWSOS '09 Proceedings of the 4th IFIP TC 6 International Workshop on Self-Organizing Systems
Bio-inspired algorithms for decentralized round-robin and proportional fair scheduling
IEEE Journal on Selected Areas in Communications
Chameleon-MAC: adaptive and self-algorithms for media access control in mobile ad hoc networks
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Desynchronization with an artificial force field for wireless networks
ACM SIGCOMM Computer Communication Review
| Hi-index | 0.00 |
The study of synchronization has received much attention in a variety of applications, ranging from coordinating sensors in wireless networks to models of firefies flashing in unison in biology. The inverse problem of desynchronization, however, has received little notice. Desynchronization is a powerful primitive: given a set of identical oscillators, applying a desynchronization primitive spreads them throughout the period, resulting in a round-robin schedule. This can be useful in several applications: medium access control in wireless sensor networks, designing fast analogto- digital converters, and achieving high-throughput traf- fic intersections. Here we present two biologically-inspired algorithms for achieving desynchronization: DESYNC and INVERSE-MS. Both algorithms are simple and decentralized and are able to self-adjust to the addition and removal of agents. Furthermore, neither requires a global clock or explicit fault detection. We prove convergence, compute bounds for the running time, and assess the various tradeoffs. To our knowledge, the theory of self-organizing desynchronization algorithms is presented here for the first time.