Research Article
A Low-Complexity Scheduling Algorithm for Proportional Fairness in Body Area Networks
@INPROCEEDINGS{10.4108/ICST.BODYNETS2009.6051, author={Roberto Pagliari and Yao-Win Peter Hong and Anna Scaglione}, title={A Low-Complexity Scheduling Algorithm for Proportional Fairness in Body Area Networks}, proceedings={4th International ICST Conference on Body Area Networks}, publisher={ICST}, proceedings_a={BODYNETS}, year={2010}, month={5}, keywords={pulse-coupled oscillators TDMA scheduling}, doi={10.4108/ICST.BODYNETS2009.6051} }- Roberto Pagliari
Yao-Win Peter Hong
Anna Scaglione
Year: 2010
A Low-Complexity Scheduling Algorithm for Proportional Fairness in Body Area Networks
BODYNETS
ICST
DOI: 10.4108/ICST.BODYNETS2009.6051
Abstract
Pulse-coupled oscillator networks are a system of pulsing devices that alter their pulsing patterns in response to the pulsing events at other nodes. It is well known that these networks can produce a number of different pulsing patterns, among which the synchrony of pulsing. The primitive we study in this paper belongs to the class of desynchronization algorithms whose objective is collision resolution in networks with extremely low power devices, which also are bound to have very low complexity. In this paper, we introduce a new decentralized scheduling algorithm based on the coupled oscillator model to achieve a schedule that allows to multiplex in time a small network of very simple transmission devices, based on the requests negotiated by the nodes.