Dynamic Analysis for the Average Shortest Path Length of Mobile Ad Hoc Networks Under Random Failure Scenarios

In general, the mobile ad hoc networks (MANETs) are built on the basis of the random distribution of the nodes, while the nodes of real networks usually have the characteristics of location preference choice. The evolving network model based on local-area choice is proposed for MANET based on the complex network theory. The proposed model of the topology not only considers the scale-free nature of the network and the actual mobility of MANET but also considers the consumption of the node energy. Random failures often occur in MANET. Most of the existing research focuses on the changes in network topology caused by random node failures. In order to describe the impact of random edge failures on the topology of MANET, we focus on the average shortest path length (ASPL) which is an important feature of the network topology and propose the formula for calculating the ASPL of the MANET after the random edge failure. The experimental simulation analyzes the change of the ASPL of MANET in the random failure scenario (after random edge deletion). By comparing with the actual scene results, the proposed estimation formula which describes this change more accurately is proved. The formula proposed in this paper provides a general framework for studying the shortest path of MANET.

Abstract licence: CC BY-NC-ND

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.