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 using the model of pulse-coupled oscillators (PCO). Firstly, by following Peskin’s PCO model with inhibitory coupling, we show that round-robin scheduling can be achieved with weak convergence, i.e., the nodes transmission times remain separated by a constant of equal amount, but their clocks continue to drift at unison. Then, we introduce two ways to achieve strict desynchronization: one by restricting the pulse coupling to only a subset of neighboring nodes and the other by imposing a more deliberate coupling rule where a node’s pulsing time is only affected by its immediate neighbors. More interestingly, by having each node maintaining two local clocks, we show that it is possible to achieve a proportional fair schedule in a decentralized way. The convergence of these algorithms is studied both analytically and numerically.