Partition Participant Detector with Dynamic Paths in Mobile Networks

Mobile ad-hoc networks, MANETs, are self-organized and very dynamic systems where processes have no global knowledge of the system. In this paper, we propose a model that characterizes the dynamics of MANETs in the sense that it considers that paths between nodes are dynamically built and the system can have infinitely many processes but the network may present finite stable partitions. We also propose an algorithm that implements an eventually perfect partition participant detector PD which eventually detects the participant nodes of stable partitions.

[1]  Jörg Hähner,et al.  A quantitative analysis of partitioning in mobile ad hoc networks , 2004, SIGMETRICS '04/Performance '04.

[2]  Afonso Ferreira,et al.  Computing Shortest, Fastest, and Foremost Journeys in Dynamic Networks , 2003, Int. J. Found. Comput. Sci..

[3]  Pierre Sens,et al.  Failure, Disconnection and Partition Detection in Mobile Environment , 2008, 2008 Seventh IEEE International Symposium on Network Computing and Applications.

[4]  Ellen W. Zegura,et al.  Multicasting in sparse MANETs using message ferrying , 2006, IEEE Wireless Communications and Networking Conference, 2006. WCNC 2006..

[5]  Marcos K. Aguilera,et al.  Using the Heartbeat Failure Detector for Quiescent Reliable Communication and Consensus in Partitionable Networks , 1999, Theor. Comput. Sci..

[6]  N. Bayley,et al.  Failure , 1890, The Hospital.

[7]  Paul Murray,et al.  A distributed state monitoring service for adaptive application management , 2005, 2005 International Conference on Dependable Systems and Networks (DSN'05).

[8]  Achour Mostéfaoui,et al.  From static distributed systems to dynamic systems , 2005, 24th IEEE Symposium on Reliable Distributed Systems (SRDS'05).

[9]  Leslie Lamport,et al.  Time, clocks, and the ordering of events in a distributed system , 1978, CACM.

[10]  Roy Friedman,et al.  Middleware support for distributed multimedia and collaborative computing , 1997, Electronic Imaging.

[11]  LamportLeslie.  Time, clocks, and the ordering of events in a distributed system , 1978 .

[12]  Idit Keidar,et al.  Fault tolerant video on demand services , 1999, Proceedings. 19th IEEE International Conference on Distributed Computing Systems (Cat. No.99CB37003).

[13]  Michel Raynal,et al.  Looking for a Definition of Dynamic Distributed Systems , 2007, PaCT.

[14]  Sam Toueg,et al.  Unreliable failure detectors for reliable distributed systems , 1996, JACM.

[15]  Michel Raynal,et al.  Regular Register: An Implementation in a Churn Prone Environment , 2009, SIROCCO.

[16]  Roberto Baldoni,et al.  Connectivity in Eventually Quiescent Dynamic Distributed Systems , 2007, LADC.