Synchronization of pulse-coupled biological oscillators
SIAM Journal on Applied Mathematics
Weakly connected neural networks
Weakly connected neural networks
Research challenges in wireless networks of biomedical sensors
Proceedings of the 7th annual international conference on Mobile computing and networking
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
DESYNC: self-organizing desynchronization and TDMA on wireless sensor networks
Proceedings of the 6th international conference on Information processing in sensor networks
Desynchronization: The Theory of Self-Organizing Algorithms for Round-Robin Scheduling
SASO '07 Proceedings of the First International Conference on Self-Adaptive and Self-Organizing Systems
Pulse coupled oscillators' primitive for low complexity scheduling
ICASSP '09 Proceedings of the 2009 IEEE International Conference on Acoustics, Speech and Signal Processing
A low-complexity scheduling algorithm for proportional fairness in body area networks
BodyNets '09 Proceedings of the Fourth International Conference on Body Area Networks
IEEE Transactions on Signal Processing - Part I
MAC protocols for wireless sensor networks: a survey
IEEE Communications Magazine
A scalable synchronization protocol for large scale sensor networks and its applications
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.07 |
In recent years, several models introduced in mathematical biology and natural science have been used as the foundation of networking algorithms. These bio-inspired algorithms often solve complex problems by means of simple and local interactions of individuals. In this work, we consider the development of decentralized scheduling in a small network of self-organizing devices that are modeled as pulse-coupled oscillators (PCOs). By appropriately designing the dynamics of the PCO, the network of devices can converge to a desynchronous state where the nodes naturally separate their transmissions in time. Specifically, by following Peskin's PCO model with inhibitory coupling, we first show that round-robin scheduling can be achieved with weak convergence, where the nodes' transmissions are separated by a constant duration, but the differences of their local clocks continue to shift over time. Then, by having each node accept coupling only from the pulses emitted by a subset of neighboring nodes, we show that it is possible to achieve strict desynchronization, where the difference between local clocks remain fixed over time. More interestingly, by having each node maintain two local clocks, we show that it is possible to further achieve proportional fair scheduling, where the time alloted to each node is proportional to their demands. The convergence of these algorithms is studied both analytically and numerically.