Self-stabilizing algorithm of two-hop conflict resolution

3Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Pomportes, S., Tomasik, J., Busson, A., & Vèque, V. (2010). Self-stabilizing algorithm of two-hop conflict resolution. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6366 LNCS, pp. 288–302). Springer Verlag. https://doi.org/10.1007/978-3-642-16023-3_25

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free