Open AccessRouting Algorithm To Eliminate Stale Routes (RAESR) In Mobile Ad Hoc Networks
Author(s) -
P. Tamilselvi*,
Dr.T.N. Ravi
Publication year - 2019
Publication title -
international journal of innovative technology and exploring engineering
Language(s) - English
Resource type - Journals
ISSN - 2278-3075
DOI - 10.35940/ijitee.l3534.1081219
Subject(s) - computer network , computer science , destination sequenced distance vector routing , mobile ad hoc network , routing table , dynamic source routing , static routing , optimized link state routing protocol , distributed computing , link state routing protocol , overhead (engineering) , router , wireless routing protocol , routing (electronic design automation) , routing protocol , network packet , operating system
Mobile Ad-hoc Network (MANET) is a collection of self sustaining mobile nodes which are connected through many wi-fi links to form a temporary communication for sharing information between the users. Mobile nodes behave as a host as well as router. As nodes in MANET posse’s mobility in traits frequently leads to irregular link between the nodes. Link failure directs a significant routing overhead during high mobility and also maintaining all the information associated with nodes and routing paths are considered as an extra overhead on the table. In order to overcome these issues, the routing algorithm to eliminate stare routed in routing cache. The neighbor degree centrality table is introduced to recognize the valuable nodes, using the valuable nodes the routes are discovered and link failure information are disseminated across the network wide. The results and findings show that the elimination of stale routes leads to significant reduction in routing overhead which in turn reduces the route error propagation delay