A learning approach to decentralised beacon scheduling

详细信息    查看全文

• 作者：C. Cano ; ^a ; ^{cristina.cano@inria.fr" class="auth_mail" title="E-mail the corresponding author}Author Vitae ; D. Malone^b ; ^{david.malone@nuim.ie" class="auth_mail" title="E-mail the corresponding author}Author Vitae
• 关键词：Beacon scheduling ; Decentralised constraint satisfaction ; Collision-free operation
• 刊名：Ad Hoc Networks
• 出版年：2016
• 出版时间：October 2016
• 年：2016
• 卷：49
• 期：Complete
• 页码：58-69
• 全文大小：923 K

文摘

Beaconing is usually employed to allow network discovery and to maintain synchronisation in mesh networking protocols, such as those defined in the IEEE 802.15.4e and IEEE 802.11s standards. Thus, avoiding persistent or consecutive collisions of beacons is crucial in order to ensure correct network operation. Beacons are also used in receiver-initiated medium access protocols to advertise that nodes are awake. Consequently, effective beacon scheduling can enable duty-cycle operation and reduce energy consumption. In this work, we propose a completely decentralised and low-complexity solution based on learning techniques to schedule beacon transmissions in mesh networks. We show the algorithm converges to beacon collision-free operation almost surely in finite time and evaluate converge times in different mesh network scenarios.