Self-stabilizing algorithm of two-hop conflict resolution - CentraleSupélec Access content directly
Conference Papers Year : 2010

Self-stabilizing algorithm of two-hop conflict resolution


Ad hoc networks are increasingly used by the civil protection forces to coordinate their actions in emergency situations. To enable them to work properly, the satisfaction of the demanded quality of service (QoS) is crucial. One of the most effective methods of assuring the QoS is to use multiplexing modes based on a resource reservation like TDMA or FDMA. The principal demands in terms of QoS concern a guarantee of connectivity and resource availability. Our idea consists in the separation of the interference detection mechanism in order to make it independent of the “pure” resource allocation algorithm. We present an algorithm which detects and corrects conflicts of assignment. Our algorithm is proved to be self-stabilizing and reaches a stable state in up to five rounds.
No file

Dates and versions

hal-00522727 , version 1 (01-10-2010)


  • HAL Id : hal-00522727 , version 1


Stéphane Pomportes, Joanna Tomasik, Anthony Buisson, Véronique Vèque. Self-stabilizing algorithm of two-hop conflict resolution. The 12th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2010), Sep 2010, New York, United States. pp.288-302. ⟨hal-00522727⟩
96 View
0 Download


Gmail Mastodon Facebook X LinkedIn More