Pulse Coupled Discrete Oscillators Dynamics for Network Scheduling
The dynamics of coupled oscillators, first introduced in mathematical biology, have increasingly become the inspiration for solving wireless scheduling problems. The appeal lies in the fact that coupled oscillators models suggest remarkably simple and scalable policies to enforce temporal events patterns in the absence of central control. Most authors have studied the emergent network behavior of “desynchronization”, i.e. the state in which nodes equally partition a time frame into individual slots. However, less has been said about using these dynamics for the assignment of discrete resources, and the outcome of discrete oscillators dynamics. This problem is important because transmission events in general cannot have arbitrary duration, due to modulation constraints. Our problem has many features in common with “quantized consensus” problems which will be highlighted in this paper. In particular, in this paper we provide a model for analyzing Pulse Coupled Discrete Oscillators (PCDO) dynamics. As we will describe, the PCDO can naturally nest beneath the Pulse Coupled Oscillators (PCO) synchronization protocol, to attain a common shared slotted time. The PCDO dynamics assign a set of consecutive PCO slots, in an arbitrarily long frame of PCO slots. Our analysis shows that the algorithm converges almost surely and provides a bound on the convergence time of the PCDO dynamics.
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
- The following copyright notice applies to all of the above items that appear in IEEE publications: "Personal use of this material is permitted. However, permission to reprint/publish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from IEEE."
- The following copyright notice applies to all of the above items that appear in ACM publications: "© ACM, effective the year of publication shown in the bibliographic information. This file is the author’s version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in the journal or proceedings indicated in the bibliographic data for each item."
- The following copyright notice applies to all of the above items that appear in IFAC publications: "Document is being reproduced under permission of the Copyright Holder. Use or reproduction of the Document is for informational or personal use only."