AODV-F: A New on Demand Enhanced Distance Vector Routing in Wireless Network
Pushpender Sarao
1Pushpender Sarao, CSE, Hyderabad Institute of Technology and Management, Hyderabad, India.
Manuscript received on 12 August 2019. | Revised Manuscript received on 19 August 2019. | Manuscript published on 30 September 2019. | PP: 5183-5191 | Volume-8 Issue-3 September 2019 | Retrieval Number: C5806098319/2019©BEIESP | DOI: 10.35940/ijrte.C5806.098319
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© 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: TRouting process is the main role in wireless ad-hoc networks. It is a very tedious task to complete successfully in mobile ad-hoc networks. Nodes are frequently changing their positions in mobile ad-hoc networks. In such a challenging environment, there are more chances of packet loss. So many routing protocols have been proposed to recover this loss. In this work, we have proposed a new distance vector routing algorithm that is an enhancement of existing routing protocol in mobile ad-hoc networks. We consider node power, hop count, and maximum speed to decide the next hop during the routing process. Trust values have been calculated by applying the rule based system. This trust value will decide the next hop in the network. To evaluate our proposed algorithm, we have simulated this in a network simulator-2 environment. Normalized routing load, throughput, packet delivery fraction, and delay are considered as the performance metrics to evaluate the proposed work.
Keywords- Pause Time, Trust Route, Triangular Membership Function, NRL, Overall Delay, Fuzzy Rules;
Scope of the Article: Fuzzy Logics