Self-stabilizing algorithm for high service availability in spite of concurrent topology changes in ad hoc mobile networks

Authors:
Abdelouahid Derhab;Nadjib Badache
Affiliations:
Department of Computer Engineering, CERIST, 3 Rue des frères Aissou, Ben-Aknoun, Algiers, Algeria;Computer Science Department, USTHB, BP 32 El-Alia, Bab-Ezzouar, 16111, Algiers, Algeria
Venue:
Journal of Parallel and Distributed Computing
Year:
2008

Citing 13
Cited 0

GloMoSim: a library for parallel simulation of large-scale wireless networks

PADS '98 Proceedings of the twelfth workshop on Parallel and distributed simulation
Leader election algorithms for mobile ad hoc networks

DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
Maintaining knowledge about temporal intervals

Communications of the ACM
Self-stabilizing mutual exclusion using tokens in mobile ad hoc networks

DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
Random walk for self-stabilizing group communication in ad hoc networks

Proceedings of the twenty-first annual symposium on Principles of distributed computing
Self-stabilizing multicast protocols for ad hoc networks

Journal of Parallel and Distributed Computing - Special issue on wireless and mobile ad hoc networking and computing
A self-stabilizing distributed algorithm for spanning tree construction in wireless ad hoc networks

Journal of Parallel and Distributed Computing - Special issue on wireless and mobile ad hoc networking and computing
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks

INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Partitioning Avoidance in Mobile Ad Hoc Networks Using Network Survivability Concepts

ISCC '02 Proceedings of the Seventh International Symposium on Computers and Communications (ISCC'02)
Design and Analysis of a Leader Election Algorithm for Mobile Ad Hoc Networks

ICNP '04 Proceedings of the 12th IEEE International Conference on Network Protocols
Theory, Volume 1, Queueing Systems

Theory, Volume 1, Queueing Systems
Self-stabilization in spite of frequent changes of networks: case study of mutual exclusion on dynamic rings

SSS'05 Proceedings of the 7th international conference on Self-Stabilizing Systems
A dynamic reconfiguration tolerant self-stabilizing token circulation algorithm in ad-hoc networks

OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Mobile nodes in ad hoc networks move freely and run out of battery power so quickly, which leads to frequent network partitioning. Network partitioning considerably reduces service availability when the server node is not in the same partition as the client nodes. In order to provide a continuous service availability for all mobile nodes, we propose a self-stabilizing algorithm that can tolerate multiple concurrent topological changes and can incur a cost of one server per long-lived connected component. By using (1) the time interval-based computations concept that distinguishes between disjoint and concurrent computations, and (2) Markov chain model, the proposed algorithm can within a finite time converge to a legitimate state even if topological changes occur during the convergence time. Our simulation results show that the algorithm can ensure very high service availability, and each node has a strong path to the server of its network component over 98% of the time.