Design of Wireless Ad Hoc System using Adaptive Multi Hop Link State Optimal Routing Protocol
Nayan S. Jambhulkar1, Shailesh Kumar2, Krushnadeo T. Belerao3
1Nayan S. Jambhulkar*, PhD Research Scholer, Department of Computer Engineering, Shri Jagdishprasad Jhabarmal Tibrewala University, Churela (Rajasthan), India.
2Dr. Shailesh Kumar, Asso. Professor, Department of Computer Engineering, Shri Jagdishprasad Jhabarmal Tibrewala University, Churela (Rajasthan), India.
3Dr. Krushnadeo T. Belerao, Co. Supervisor, Department of Computer Engineering, Shri Jagdishprasad Jhabarmal Tibrewala University, Churela (Rajasthan), India.
Manuscript received on December 09, 2021. | Revised Manuscript received on December 12, 2021. | Manuscript published on December 30, 2021. | PP: 17-22 | Volume-11, Issue-2, December 2021 | Retrieval Number: 100.1/ijitee.B96531211221 | DOI: 10.35940/ijitee.A9653.1211221
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Now a days for the radio network communication multi-hop routing is used. This multi-hop routing technique covers larger coverage area. Therefore to reach at specific location data is transferred in form of packets from one node to other node. But for the transmission of radio signals over the large distance, large number of transreceivers are required and these transreceivers requires large power to operate. As a result, multi-hop routing can saves energy over separate routing. Therefore it is necessity to design a cost effective multi-hop routing technique for successful transmission of ratio packet data. In this paper a hop by hop adaptive link state optional routing (HALO) is explained. It is the first packet transmitting solution with hop by hop and link state routing, which reduces the cost of transporting data across a packet switch network. The triple model is designed for multi hop packet routing. In this work each node of network iteratively and separately improves the small part of traffic bound. This algorithm finds the shortest path of specific location for every iteration and it is calculated by the marginal cost of the various links of network. The marginal link cost is used to calculate the shortest path between the node and the destination location. This marginal link cost is gathered from link state updates. The various networks changes are automatically identified by the adaptive method which is used in this paper. Due to this the exchange between the packets on wrong node is reduced over the overhead traffic. To validate these theoretical results the experimental evaluations and mathematical calculations are also reported in this work. Net beans java is the programmed use in this proposed project.
Keywords: Link State Advertisement Packets (Lsap), Dijkstra’s Shortest Path Algorithm, Link-State Routing, 2 Ack Scheme.
Scope of the Article: Routing Protocols.