Reliability analysis of cluster-based ad-hoc networks

The mobile ad-hoc wireless network (MAWN) is a new and emerging network scheme that is being employed in a variety of applications. The MAWN varies from traditional networks because it is a self-forming and dynamic network. The MAWN is free of infrastructure and, as such, only the mobile nodes comprise the network. Pairs of nodes communicate either directly or through other nodes. To do so, each node acts, in turn, as a source, destination, and relay of messages. The virtue of a MAWN is the flexibility this provides; however, the challenge for reliability analyses is also brought about by this unique feature. The variability and volatility of the MAWN configuration makes typical reliability methods (e.g. reliability block diagram) inappropriate because no single structure or configuration represents all manifestations of a MAWN. For this reason, new methods are being developed to analyze the reliability of this new networking technology. New published methods adapt to this feature by treating the configuration probabilistically or by inclusion of embedded mobility models. This paper joins both methods together and expands upon these works by modifying the problem formulation to address the reliability analysis of a cluster-based MAWN. The cluster-based MAWN is deployed in applications with constraints on networking resources such as bandwidth and energy. This paper presents the problem's formulation, a discussion of applicable reliability metrics for the MAWN, and illustration of a Monte Carlo simulation method through the analysis of several example networks.

[1]  Patrick Th. Eugster,et al.  Probabilistic reliable multicast in ad hoc networks , 2004, Ad Hoc Networks.

[2]  George S. Fishman,et al.  A Monte Carlo Sampling Plan for Estimating Network Reliability , 1984, Oper. Res..

[3]  Abdullah Konak,et al.  New event-driven sampling techniques for network reliability estimation , 2004, Proceedings of the 2004 Winter Simulation Conference, 2004..

[4]  J. Scott Provan,et al.  Calculating bounds on reachability and connectedness in stochastic networks , 1983, Networks.

[5]  José Alí Moreno,et al.  Network reliability assessment using a cellular automata approach , 2002, Reliab. Eng. Syst. Saf..

[6]  T. Feo,et al.  Partial factoring: an efficient algorithm for approximating two-terminal reliability on complete graphs , 1990 .

[7]  Jose Emmanuel Ramirez-Marquez,et al.  Recent Research on the Reliability Analysis Methods for Mobile Ad-hoc Networks , 2007 .

[8]  Satish K. Tripathi,et al.  A routing framework for providing robustness to node failures in mobile ad hoc networks , 2004, Ad Hoc Networks.

[9]  S. Kuo,et al.  Determining terminal-pair reliability based on edge expansion diagrams using OBDD , 1999 .

[10]  Tov Elperin,et al.  Estimation of network reliability using graph evolution models , 1991 .

[11]  Enrico Zio,et al.  Solving advanced network reliability problems by means of cellular automata and Monte Carlo sampling , 2005, Reliab. Eng. Syst. Saf..

[12]  Jose Emmanuel Ramirez-Marquez,et al.  Mobility and reliability modeling for a mobile ad hoc network , 2008 .

[13]  Kaveh Pahlavan Principles Of Wireless Networks , 2001 .

[14]  Rajesh Krishnan,et al.  Efficient clustering algorithms for self-organizing wireless sensor networks , 2006, Ad Hoc Networks.

[15]  J. E. Ramirez-Marquez,et al.  Reliability of capacitated mobile ad hoc networks , 2007 .

[16]  Vijay K. Garg,et al.  Dense cluster gateway based routing protocol for multi-hop mobile ad hoc networks , 2006, Ad Hoc Networks.

[17]  Eryk Dutkiewicz,et al.  A review of routing protocols for mobile ad hoc networks , 2004, Ad Hoc Networks.

[18]  Jose Emmanuel Ramirez-Marquez,et al.  Two-terminal reliability analyses for a mobile ad hoc wireless network , 2007, Reliab. Eng. Syst. Saf..

[19]  Marco Muselli,et al.  Empirical models based on machine learning techniques for determining approximate reliability expressions , 2004, Reliab. Eng. Syst. Saf..

[20]  Jing Li,et al.  A cluster-based power-efficient MAC scheme for event-driven sensing applications , 2007, Ad Hoc Networks.

[21]  David R. Karger A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem , 1999, SIAM J. Comput..

[22]  Michael R. Lyu,et al.  Reliability analysis for various communication schemes in wireless CORBA , 2005, IEEE Transactions on Reliability.