An Efficient Distance Model for the Estimation of the Mobile Ad Hoc Network Reliability

Estimation of infrastructureless arbitrary networks (mobile ad hoc network) reliability has its existence for more than a decade. Moreover, the existing literature show the substantiation use of Euclidean distance approach to measure the performance metrics like routing, node distribution, success probability of the mobile ad hoc network. But the aforementioned approach requires more computational time for estimation of the arbitrary network performance. Hence, in this work, an efficient method using Manhattan distance calculations has been proposed to estimate the reliability of mobile ad hoc networks. Two distance approaches (Euclidean and Manhattan) are employed and the comparative results of network reliability through Monte Carlo Simulation has been addressed in this paper. The simulated result makes the method applicable as the proposed approach takes lesser time when compared to Euclidean distance approach.

[1]  Matthias Wählisch Modeling the Network Topology , 2010, Modeling and Tools for Network Simulation.

[2]  Sanjay Chaturvedi,et al.  Network Reliability: Measures and Evaluation , 2016 .

[3]  N. Padmavathy,et al.  Performance evaluation of mobile ad hoc network using Monte Carlo simulation with failed nodes , 2017, 2017 Second International Conference on Electrical, Computer and Communication Technologies (ICECCT).

[4]  N. Padmavathy,et al.  Reliability Evaluation of Mobile Ad Hoc Networks: With and without Interference , 2017, 2017 IEEE 7th International Advance Computing Conference (IACC).

[5]  R. Hekmat Study of Connectivity in Wireless Ad-hoc Networks with an Improved Radio Model , 2004 .

[6]  Sanjay Chaturvedi,et al.  Mobile Ad Hoc Network Reliability: An Imperative Research Challenge , 2017 .

[7]  Wenye Wang,et al.  Computing Two-Terminal Reliability in Mobile Ad Hoc Networks , 2007, 2007 IEEE Wireless Communications and Networking Conference.

[8]  N. Padmavathy,et al.  A systematic approach for analyzing hop count and path reliability of mobile Ad Hoc networks , 2017, 2017 International Conference on Advances in Computing, Communications and Informatics (ICACCI).

[9]  B. Bollobás The evolution of random graphs , 1984 .

[10]  Sanjay Chaturvedi,et al.  Reliability Evaluation of Mobile Ad Hoc Network: With and without Mobility Considerations☆ , 2015 .

[11]  Sanjay K. Chaturvedi and N. Padmavathy,et al.  The Influence of Scenario Metrics on Network Reliability of Mobile Ad Hoc Network , 2013 .

[12]  Rajesh Mishra,et al.  Enumeration of Minimal Cutsets for Directed Networks with Comparative Reliability Study for Paths or Cuts , 2016, Qual. Reliab. Eng. Int..

[13]  Madhav V. Marathe,et al.  Approximate connectivity graph generation in mobile ad hoc radio networks , 2003, 36th Annual Simulation Symposium, 2003..

[14]  Tracy Camp,et al.  A survey of mobility models for ad hoc network research , 2002, Wirel. Commun. Mob. Comput..

[15]  T. G. Basavaraju,et al.  GCCT: A Graph-Based Coverage and Connectivity Technique for Enhanced Quality of Service in WSN , 2015, Wirel. Pers. Commun..

[16]  Xiaoyu Song,et al.  Reliability Analysis for a Data Flow in Event-Driven Wireless Sensor Networks , 2014, Wirel. Pers. Commun..

[17]  W. W. Lu,et al.  Challenges in mobile ad hoc networking , 2001, IEEE Commun. Mag..

[18]  S. Rajkumar,et al.  Reliability Analysis of Multistage Interconnection Networks , 2016, Qual. Reliab. Eng. Int..