A Structured Minimum-Process Reliable Recovery Line Assortment Protocol for Mobile Ad-hoc Networks

Authors

  • SK Wasim Haidar, Mohammad Meraj, Syed Ahad Murtaza Alvi

DOI:

https://doi.org/10.17762/msea.v71i4.1606

Abstract

In ad-hoc interconnection every nodule is self-organized and can converse directly with all other nodules. An Ad-hoc mobile interconnection is composed of mobile nodules that converse with each other through broadcast radio transmissions within the transmissions power range. Paralleled to the wired distributed computing framework, ad-hoc wireless interconnections have certain new features. The transient letdown probability of the framework increases greatly with the enlarging of framework scale. If a letdown comes into play in a proceeding and there is not an applicable method to protect it, more cost will be wasted for restarting the program. Coordinated RRL-assortment (Reliable Recovery Line assortment) can be employed to introduce fault tolerance in mobile ad-hoc wireless interconnections environment .In this paper we propose a new minimum proceeding RRL-assortment scheme for ad-hoc interconnections. We assume that Cluster Based Routing Protocol (CBRP) is employed which have its place to the class of Hierarchical Reactive Routing Protocols. The number of synchronized reckoning communications between a cluster head and its ordinary associates is small. The reclamation scheme has no domino effect and the letdown proceeding can roll back from its latest local dependable Restoration-point.

Downloads

Published

2023-01-13

How to Cite

SK Wasim Haidar, Mohammad Meraj, Syed Ahad Murtaza Alvi. (2023). A Structured Minimum-Process Reliable Recovery Line Assortment Protocol for Mobile Ad-hoc Networks. Mathematical Statistician and Engineering Applications, 71(4), 8905–8917. https://doi.org/10.17762/msea.v71i4.1606

Issue

Section

Articles