Statistical Evaluation of Power-Aware Routing Protocols for Wireless Networks: An Empirical Study

Statistical Evaluation of Power-Aware Routing Protocols for Wireless Networks: An Empirical Study

Bhupesh Lonkar, Swapnili Karmore
Copyright: © 2022 |Pages: 14
DOI: 10.4018/IJIIT.309589
Article PDF Download
Open access articles are freely available for download

Abstract

Distributed wireless networks use low-power nodes, battery-powered routers, and base-station nodes. Routing strategies lose energy due to distance-dependent transmission and reception. Researchers design low-power routing solutions for wireless networks. Each technique has unique advantages, restrictions, and research options. Protocols vary in energy consumption, throughput, latency, packet delivery ratio (PDR), scalability, and computational complexity. Researchers can't choose ideal context-aware network models due to diverse performance measurements. This article addresses application-specific deployment strengths to reduce uncertainty. This discussion may help researchers choose context-specific routing models. This article compares power-aware routing model performance measures. This comparison may be used to construct routing models for low-delay, high-throughput, high PDR installations, etc. This paper proposes an algorithm rank score (ARS) with performance metrics. Network designers may employ high-ARS routing models to achieve performance balance over numerous assessments.
Article Preview
Top

Introduction

Routing in wireless networks requires consideration of a wide variety of inter-domain models that include, clustering, geographical node placements, distance evaluation strategies, traffic management, energy considerations, etc. A typical wireless routing model is depicted in Malisetti and Pamula (2020), wherein entire flow of invitation-based routing is visualized. Here, cluster heads (CH) broadcast invitation requests, that contain CH location, energy levels, and other cluster-specific parameters. Nodes respond to these requests with Yes or No acknowledgements, which assist CHs to either accept the nodes or discard them from their cluster lists.

In order to facilitate the transmission of data from one node to another, CHs provide Time Division Multiple Access (TDMA) slots to approved nodes. To complete the node-to-node communication loops, the CHs transmit this information to other nodes or other CHs. In order to execute application-specific routing and communication, models substitute context-specific characteristics like as throughput, PDR, routing overheads, etc. for distance and energy level measurements. In the next part, we'll take a look at some of these models, their intricacies, benefits, and drawbacks, as well as potential directions for future study. To better match current routing models to their deployment requirements, researchers may use this topic to suggest the best models for future deployments. To wrap things off, this article makes some intriguing insights about the analyzed models and proposes a variety of ways to enhance their real-time performance.

Researchers have suggested a broad range of low-power routing protocols, each with its own unique benefits, drawbacks, and study areas. Low-energy adaptive clustering hierarchy (LEACH), Hybrid Energy Efficient Distributed Clustering (HEED), Dynamic Clustering and Distance-Aware Routing (DDAR), etc., are only few of the protocols included in this category. In addition, these protocols use numerous machine learning models, such as swarm intelligence, bioinspired computing, neural networks, etc. Other statistical factors, such as energy consumption, communication delays and throughput as well as packet delivery ratio (PDR) and scalability are also different amongst these protocols. It is difficult for researchers and network designers to choose the best models for their context-aware network deployments because of the large range of performance measures. Thus, the motivation & contributions of this text are,

  • An in-depth description of these models, together with the application-specific deployment strengths, is provided in this article in an effort to remove this uncertainty. Researchers will be able to narrow down a list of context-specific routing models based on this debate. Besides that, it compares the examined models with other power-aware routing models and assesses their performance on a variety of performance criteria.

  • Researchers and network designers will be able to find routing models that are most suited for installations requiring features such as low latency, high throughput, high PDR, etc., after consulting this comparison.

  • This paper also proposes a new algorithm rank score (ARS), which incorporates a variety of assessment indicators to provide a more complete picture of performance. Selecting routing models with high ARS performance allows network designers to implement routing models that maintain performance equilibrium throughout a variety of simulations and tests.

Based on these contributions, readers will be able to identify optimal models for their application-specific & performance-specific deployments.

Complete Article List

Search this Journal:
Reset
Volume 20: 1 Issue (2024)
Volume 19: 1 Issue (2023)
Volume 18: 4 Issues (2022): 3 Released, 1 Forthcoming
Volume 17: 4 Issues (2021)
Volume 16: 4 Issues (2020)
Volume 15: 4 Issues (2019)
Volume 14: 4 Issues (2018)
Volume 13: 4 Issues (2017)
Volume 12: 4 Issues (2016)
Volume 11: 4 Issues (2015)
Volume 10: 4 Issues (2014)
Volume 9: 4 Issues (2013)
Volume 8: 4 Issues (2012)
Volume 7: 4 Issues (2011)
Volume 6: 4 Issues (2010)
Volume 5: 4 Issues (2009)
Volume 4: 4 Issues (2008)
Volume 3: 4 Issues (2007)
Volume 2: 4 Issues (2006)
Volume 1: 4 Issues (2005)
View Complete Journal Contents Listing