Self-stabilizing systems in spite of distributed control
Communications of the ACM
Assignment methods for spatial reuse TDMA
MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
Uniform Dynamic Self-Stabilizing Leader Election (Extended Absrtact)
WDAG '91 Proceedings of the 5th International Workshop on Distributed Algorithms
Dynamic TDMA Slot Assignment in Ad Hoc Networks
AINA '03 Proceedings of the 17th International Conference on Advanced Information Networking and Applications
Algorithmic aspects of capacity in wireless networks
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Characterizing the capacity region in multi-radio multi-channel wireless mesh networks
Proceedings of the 11th annual international conference on Mobile computing and networking
DRAND: distributed randomized TDMA scheduling for wireless ad-hoc networks
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Efficient interference-aware TDMA link scheduling for static wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking
A parallel distance-2 graph coloring algorithm for distributed memory computers
HPCC'05 Proceedings of the First international conference on High Performance Computing and Communications
A scalable parallel graph coloring algorithm for distributed memory computers
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
| Hi-index | 0.00 |
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.