Elsevier

Ad Hoc Networks

Volume 87, 1 May 2019, Pages 76-99
Ad Hoc Networks

Novel strategies for path stability estimation under topology change using Hello messaging in MANETs

https://doi.org/10.1016/j.adhoc.2018.12.005Get rights and content

Abstract

Path stability estimation due to connectivity failures is one of the key challenges for effective communication under random mobility of network nodes in mobile ad hoc networks (MANETs). Under random movement of network nodes and topology triggered reactive path distribution statistics among the neighboring nodes, there must be a unified model to determine an adequate path stability estimation strategy in MANETs. We present novel link connectivity metrics (LCM) and path distribution analysis (PDA) strategies for path stability estimation under uniform speed and random trajectory of mobile nodes. We also design an adaptive routing model that guarantees effective communication among neighboring nodes inside a cluster. We find that LCM strategy among neighboring nodes is affected by the link expiration time, relative velocity, link connectivity, and link stability metrics in terms of remaining probability for a connected link, link recovery probability, and stability of a path at different time steps of a Markov process. We also find that PDA strategy among neighboring nodes is affected by the link excess life, distribution of path durations, cluster stability, and path duration statistics in terms of throughput and overhead during Hello message(s) communication at different time steps of a Markov process. Analytical and simulation results indicate efficacy of the proposed LCM and PDA strategies by efficiently estimating path stability under topology change, thereby, increasing the global network connectivity.

Introduction

A mobile ad hoc network (MANET) is a collection of wireless mobile nodes that do not rely on centralized administration or established infrastructure and, thus, form a temporary network [1]. Link stability estimation is an important metric in MANETs for efficient link connectivity and stable route selection process [2], [3], [4]. Several factors can influence the link stability in MANETs such as communication overhead, residual energy of neighboring nodes constituting the path, network throughput and latency, and channel utilization [2].

A volume of literature is available, which addresses path stability estimation among the randomly deployed network nodes for effective communication in MANETs [3], [4], [5], [6], [7], [8], [9], [10], [11], [12], [13], [14], [15]. However, there are a number of shortcomings in the existing literature, in terms of link stability as a function of path stability estimation, distribution of path durations as function of throughput, communication overhead, and cluster stability. In addition, the existing literature do not provide a solution for link stability metrics as function of remaining probability for a connected link, link recovery probability, and stability of a link constituting a path. Therefore, to address these shortcomings, there is an eminent need for an adaptive routing strategy that estimates path stability for effective communication among the neighboring nodes as a continuous function of time.

In this paper, we present two novel strategies for tackling the issue of path stability estimation in the case of proposed adaptive routing model for MANETs. First, we model link connectivity metrics (LCM) for estimating link stability among pairs of neighboring node inside clusters. The proposed LCM is helpful in estimating link connectivity as a function of random movement of network nodes. Secondly, we present path distribution analysis (PDA) for tackling the issue of path distribution under random deployment of nodes inside clusters. The proposed PDA is helpful in achieving path distribution as a function of topology triggered reactive path distribution statistics among neighboring nodes. For designing an adaptive routing model to estimate link stability among neighboring nodes, a movement pattern of nodes, due to a node’s spatial distribution, has a tremendous impact on many network aspects, such as link expiration time, link excess life, relative velocity, link connectivity, and distribution of path durations. In addition, topology triggered reactive path duration statistics has a great impact on the Hello messages throughput, overhead involved in transmitting Hello messages, and cluster stability in terms of transmission rate of Hello messages, capacity of a link, and inter-arrival time between transmission of the consecutive Hello messages, thereby affecting the estimation process for path stability among the neighboring nodes.

The main contributions of this paper are summarized as follows.

  • We present a novel LCM strategy under random movement of network nodes and a novel PDA strategy under topology triggered path duration statistics using Hello messaging for link stability estimation in MANETs.

  • We propose an adaptive routing model, under random movement of nodes and topology triggered path duration statistics that guarantees effective communication among the neighboring nodes inside a cluster. For this model, we derive expressions for probability of a connected link, average minimum power (AMP), and probability of successful reception of Hello messages, as presented in Section 4 of the paper.

  • We also derive expression for the link expiration time between neighboring nodes inside a cluster, as presented in Section 5.1. Through link expiration time, we obtain link longevity, better link connectivity, and high Hello message(s) delivery ratio, as presented in Section 7.1.

  • Additionally, we derive expression for optimum relative velocity between CH and its neighbor inside a cluster, as presented in Section 5.2. Through optimum relative velocity, we obtain better network lifetime, as presented in Section 7.2.

  • Moreover, we derive expression for optimal link connectivity among the neighboring nodes inside the cluster, as presented in Section 5.3. Through optimal link connectivity, we obtain higher network connectivity, higher throughput, and higher energy efficiency of the network in terms of AMP, as presented in Section 7.3.

  • We also evaluate expressions for link stability metrics in the proposed LCM strategy, as presented in Section 5.4. By analyzing link stability metrics, we obtain higher link stability in terms of remaining probability for a connected link and faster re-connectivity in terms of probability of link recovery, as presented in Sections 8.8 and 8.9. In addition, we obtain better network stability and higher Hello message(s) delivery rate in terms of normalized stability of a path, as presented in Section 8.10.

  • We analyze the normalized cluster stability in terms of dynamic link connectivity among neighboring nodes in terms of link capacity, transmission rate of Hello messages, and expected Hello messages transmission rate, as presented in Section 8.1.

  • We also analyze normalized overhead of cluster, in terms of Hello messages transmission to a neighboring node, based on maximum cardinality between CH and its neighbor node, and transmission retries of Hello message(s) for link re-connectivity, as presented in Section 8.2.

  • Furthermore, we analyze the link excess life between CH and its neighbor node based on probabilities of link connectivity between them, as presented in Section 6.1.

  • Finally, we obtain normalized routing load (NRL), better network efficiency in terms of lower Hello message(s) drop rate, higher channel utilization, controlled network congestion, and lower network latency for the proposed PDA strategy, as presented in 8.3 Normalized throughput, 8.4 Frequency of path breaks, 8.5 Throughput in terms of transmitted Hello messages, 8.6 Total time spent in repairing broken paths, and 8.7, respectivley.

We achieve path stability among the neighboring nodes by presenting multiple parameters of interest for the adaptive routing model and various performance metrics for the proposed LCM and PDA strategies. We determine an adaptive routing model, as presented in Section 4, in terms of position of a cluster head (CH) at different time steps of a Markov process, probability of a connected link, average minimum power, and CH selection criteria for determining various network aspects that can affect path stability under topology change in MANETs. In addition, we determine LCM, as presented in Section 5, in terms of link expiration time, relative velocity, link connectivity between neighboring nodes and link stability metrics for determining link connectivity under random movement of network nodes. Furthermore, we determine PDA, as presented in Section 6, in terms of link excess life, uniform distribution of path durations, path duration statistics, and cluster stability for analyzing random deployment of network nodes under topology triggered reactive path duration statistics. Simulation and analytical results indicate that LCM inside a cluster obtains higher link longevity, better network lifetime, higher Hello message(s) delivery rate, better link connectivity, and higher energy efficiency of the network in terms of average minimum power, thus, providing effective measures for estimating path stability among neighboring nodes under random trajectory of network nodes. For PDA, we also achieve normalized routing load, lower Hello message(s) drop rate, higher channel utilization, lower network latency, and controlled network congestion, thus, providing effective tools for estimating path stability among neighboring nodes after initial deployment of the network nodes. Finally, by analyzing the obtained results, it can be suggested that the proposed strategies significantly enable us to obtain global network connectivity by succssfully achieving effective path stability estimation and optimum path distributions inside cluster, under topology change in MANETs Section 1.1.

The rest of the paper is organized as follows. In Section 2, we present the related work. In Section 3, we present the network scenarios and basic assumptions for the proposed strategies. In Section 4, we design an adaptive routing model by formulating it as a Markov process. We model and analyze the proposed LCM and PDA strategies in Sections 5 and 6, respectivley. In Sections 7 and 8, we present performance evaluation of the proposed LCM and PDA strategies, respectivley. The paper is concluded in Section 9.

Section snippets

Related work

This section reviews eminent routing strategies, which address the problem of link stability estimation among the randomly deployed network nodes for effective communication in MANETs. In [3], the authors propose a method for estimating link stability based on the link connectivity changes in MANETs. This method estimates link stability by adjusting the operating mode of network topologies. The drawback of this work is the deployment of variable sized sampling window for estimation process, due

Network scenario and assumptions

Before presenting the network scenario and assumptions for the proposed LCM and PDA strategies, we shall present definitions to some of the basic terms used in this paper.

Definition 1

Link Stability: in the paper is defined as the robustness and longevity of a link between the neighboring node pairs inside a cluster [2].

Definition 2

Path Duration: is the time taken for a packet to be transmitted from source to destination at connectivity graph level [8].

Definition 3

Distribution of Path Durations: represents the dispersion of link

Analysis of adaptive routing model

First, we determine the initial position of a CH and the neighboring nodes within a cluster at time step (n) of the Markov process in order to calculate the logical distances between each pair of the neighboring nodes [19]. Next, the position of the CH at time step (n+1), with reference to an ordinary node, is determined. The CH position with reference to an ordinary node allows us to calculate the probability of a connected link, which consequently provides transmission rate λ of the Hello

Modelling and analysis of LCM strategy

In this section, we perform modelling of the link connectivity metrics (LCM) strategy by analyzing various performance metrics that can influence the stability of a dynamic link connectivity among neighboring nodes and can, thus, affect the network performance under random movement of nodes. First, we analyze the link expiration time among each pair of neighboring node inside a cluster. Next, we derive an expression for the link connectivity between the neighboring node pairs in case of uniform

Modelling and analysis of PDA strategy

In this section, we perform modelling of the path distribution analysis (PDA) strategy by analyzing its various performance metrics that can influence the stability of a dynamic link connectivity among the neighboring nodes and can, thus, effect the network performance under topology triggered path duration statistics at next time step of the CTMC process. First, we analyze link excess life between the neighboring node pairs inside cluster for the selected network scenario, as depicted in Fig. 1

Performance evaluation of LCM strategy

This section presents performance analysis of our proposed LCM strategy in comparison with the Ad Hoc On-Demand Distance Vector (AODV) routing protocol, using the Iuriivoitenko-simplemanet simulator3. The simulations are carried out for the network scenario depicted in Fig. 1 and for the simulation parameters presented in Table 3. Total number of nodes inside the network are 160. The number of nodes assumed inside each

Performance evaluation of PDA strategy

In this section, performance evaluation of the proposed PDA strategy is performed in terms of normalized cluster stability, normalized overhead of cluster, normalized throughput, frequency of path breaks, throughput in terms of transmitted Hello messages, total time spent in repairing broken paths, correlation coefficient for link excess life, remaining probability for a connected link, probability of link recovery, and normalized stability of a path.

Conclusion

We have presented novel LCM and PDA strategies using Hello messaging in MANETs for path stability estimation among neighboring nodes inside a cluster. We have also designed an adaptive routing model that guarantees effective communication among neighboring nodes inside the cluster. Analytical and simulation results have enabled us to make a number of significant findings. We find that path stability among neighboring nodes inside cluster is affected by the link expiration time, relative

Alamgir Naushad received the B.S. degree in computer systems engineering from University of Engineering and Technology, Peshawar, Pakistan, in 2011, and the M.S. degree in computer system engineering from the GIK Institute of Engineering Sciences and Technology, Pakistan, in 2014. He is currently a PhD candidate at the Faculty of Computer Sciences and Engineering, and a member of the Telecommunications and Networking (TeleCoN) Research Lab at GIK Institute. His research interests include mobile

References (42)

  • Z. Li et al.

    Smooth mobility and link reliability-based optimized link state routing scheme for MANETs

    IEEE Commun. Lett.

    (2017)
  • C. Lal et al.

    Enhancing qoe for video streaming in MANETs via multi-constraint routing

    Wireless Netw.

    (2018)
  • F. Bai et al.

    Modeling path duration distributions in MANETs and their impact on reactive routing protocols

    IEEE J. Sel. Areas Commun.

    (2004)
  • V. Brindha et al.

    Fuzzy enhanced secure multicast routing for improving authentication in MANET

    Cluster Comput.

    (2018)
  • G. Singal et al.

    Moralism: mobility prediction with link stability based multicast routing protocol in MANETs

    Wireless Netw.

    (2016)
  • A.K. Yadav et al.

    QMPRNS: Design of qos multicast routing protocol using reliable node selection scheme for MANETs

    Peer-to-Peer Netw. Appl.

    (2017)
  • V. Kulathumani et al.

    On the repair time scaling wall for MANETs

    IEEE Commun. Lett.

    (2016)
  • K. Ozera et al.

    A fuzzy approach for secure clustering in MANETs: effects of distance parameter on system performance

    Proc. 31st International Conference on Advanced Information Networking and Applications Workshops (WAINA)

    (2017)
  • D. Gavalas et al.

    Clustering of mobile ad hoc networks: an adaptive broadcast period approach

    IEEE International Conference on Communications

    (2006)
  • T. Ohta et al.

    An adaptive multihop clustering scheme for highly mobile ad hoc networks

    The Sixth International Symposium on in Autonomous Decentralized Systems, ISADS

    (2003)
  • F. Gebali

    Analysis of computer networks, 1st ed.

    (2015)
  • Cited by (18)

    View all citing articles on Scopus

    Alamgir Naushad received the B.S. degree in computer systems engineering from University of Engineering and Technology, Peshawar, Pakistan, in 2011, and the M.S. degree in computer system engineering from the GIK Institute of Engineering Sciences and Technology, Pakistan, in 2014. He is currently a PhD candidate at the Faculty of Computer Sciences and Engineering, and a member of the Telecommunications and Networking (TeleCoN) Research Lab at GIK Institute. His research interests include mobile ad hoc and cellular networks.

    Ghulam Abbas received the B.S. degree in computer science from University of Peshawar, Pakistan, in 2003, and the M.S. degree in distributed systems and the Ph.D. degree in computer networks from the University of Liverpool, U.K., in 2005 and 2010, respectively. From 2006 to 2010, he was Research Associate with Liverpool Hope University, U.K., where he was associated with the Intelligent and Distributed Systems Laboratory. Since 2011, he has been with the Faculty of Computer Sciences and Engineering, GIK Institute of Engineering Sciences and Technology, Pakistan. He is currently working as Associate Professor and Director Huawei Authorized Information and Network Academy. Dr. Abbas is a co-founding member of the Telecommunications and Networking (TeleCoN) Research Lab at GIK Institute. He is a Fellow of the Institute of Science and Technology, U.K., a Fellow of the British Computer Society, and a Senior Member of the IEEE. His research interests include computer networks, and wireless and mobile communications.

    Ziaul Haq Abbas received the M.Phil. degree in electronics from Quaid-e-Azam University, Pakistan, in 2001, and the Ph.D. degree from the Agder Mobility Laboratory, Department of Information and Communication Technology, University of Agder, Norway, in 2012. He joined the GIK Institute of Engineering Sciences and Technology, Pakistan, as Assistant Professor in 2012. In 2012, he was a Visiting Researcher with the Department of Electrical and Computer Engineering, University of Minnesota, USA. He is currently an Associate Professor with the Faculty of Electrical Engineering and a co-founding member of Telecommunications and Networking (TeleCoN) Research Lab at GIK Institute. His research interests include energy efficiency in hybrid mobile and wireless communication networks, 4G and beyond mobile systems, mesh and ad hoc networks, traffic engineering in wireless networks, performance evaluation of communication protocols and networks by analysis and simulation, quality-of-service in wireless networks, green wireless communication, and cognitive radio.

    Aris Pagourtzis received diploma in electrical and computer engineering from National Technical University of Athens, Greece, in 1989, and Ph.D. degree in electrical and computer engineering from the same alma mater. He is currently an Associate Professor with the Division of Computer Science, National Technical University of Athens. His diverse research interests include analysis of algorithms and problem complexity, graph algorithms, network problems, complexity measures and classes, approximation algorithms, combinatorial algorithms, complexity in computing, parallel processing, and computer networks.

    View full text