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

DOI10.1016/J.JPDC.2008.01.005zbMath1243.68053OpenAlexW2047700398MaRDI QIDQ436785

Abdelouahid Derhab, Nadjib Badache

Publication date: 26 July 2012

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2008.01.005

zbMATH Keywords

Markov chainad hoc networkself-stabilizationpartition prediction algorithmtime interval-based computation

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (1)

Impact of knowledge on election time in anonymous networks

Uses Software

• GloMoSim

Cites Work

• Unnamed Item
• Maintaining knowledge about temporal intervals
• Self-stabilizing multicast protocols for ad hoc networks.
• A self-stabilizing distributed algorithm for spanning tree construction in wireless ad hoc networks.
• A distributed mutual exclusion algorithm over multi-routing protocol for mobilead hocnetworks
• Self-stabilization in Spite of Frequent Changes of Networks: Case Study of Mutual Exclusion on Dynamic Rings
• Depth-First Search and Linear Graph Algorithms
• Principles of Distributed Systems

This page was built for publication: Self-stabilizing algorithm for high service availability in spite of concurrent topology changes in ad hoc mobile networks