Trustworthy Link Failure Recovery Algorithm for Highly Dynamic Mobile Adhoc Networks

The Trustworthy link failure recovery algorithm is introduced in this paper, to provide the forwarding continuity even with compound link failures. The ephemeral failures are common in IP networks and it also has some proposals based on local rerouting. To ensure forwarding continuity, we are introducing the compound link failure recovery algorithm, even with compound link failures. For forwarding the information, each packet carries a blacklist, which is a min set of failed links encountered along its path, and the next hop is chosen by excluding the blacklisted links. Our proposed method describes how it can be applied to ensure forwarding to all reachable destinations in case of any two or more link or node failures in the network. After simulating with NS2 contains lot of samples proved that the proposed protocol achieves exceptional concert even under elevated node mobility using Trustworthy link Failure Recovery Algorithm.

Authors:

• Y. Harold Robinson
• M. Rajaram

Keywords:

• Wireless Sensor Networks
• Predistribution Scheme
• Cryptographic Techniques.

References:

[1] Shengbo Yang, Chai Kiat Yeo, and Bu Sung Lee, “Toward Reliable
Data Delivery for Highly Dynamic Mobile Ad Hoc Networks”, IEEE
Transactions on Mobile Computing, Vol. 11, No. 1, Jan 2012
[2] Rozner, E., Seshadri, J., Mehta, Y. Lili Qiu, “SOAR: Simple
Opportunistic Adaptive Routing Protocol for Wireless Mesh Networks”,
IEEE Transactions on Mobile Computing, Volume: 8, Issue: 12,
Page(s): 1622 - 1635 , Dec. 2009
[3] Kai Zeng, Wenjing Lou, Jie Yang, Donald R. Brown III, “On
Throughput Efficiency of Geographic Opportunistic Routing in
Multihop Wireless Networks”, Springer, Mobile Networks Application
(2007) 12:347–357, 2007
[4] Luiz Carlos P. Albini, Antonio Caruso, Stefano Chessa and Piero
Maestrini, “Reliable Routing in Wireless Ad Hoc Networks: The Virtual
Routing Protocol”, Journal of Network and Systems Management, Vol
14, No. 3, 2006
[5] Brad Karp, H. T. Kung,” GPSR: Greedy Perimeter Stateless Routing for
Wireless Networks”, Proceedings of the 6th Annual ACM/IEEE
International Conference on Mobile Computing and Networking
(MobiCom 2000), 2000.
[6] Sanjit Biswas, Robert Morris, “ExOR: opportunistic multi-hop routing
for wireless networks”, Proceedings of conference on Applications,
technologies, architectures, and protocols for computer
communications, Pages 133-144 , 2005
[7] A. Trivino-Cabrera, S. Canadas-Hurtado, “Survey on Opportunistic
Routing in Multihop Wireless Networks”, International Journal of
Communication Networks and Information Security (IJCNIS), Vol. 3,
No. 2, August 2011
[8] Dazhi Chen, Pramod K. Varshney, “A Survey of void handling
techniques for geographic routing in wireless networks”, IEEE
communications survey, 1st Quarter, Vol.9, No. 1,2009
[9] Jochen Schiller, Mobile Communications - Second edition, Pearson
Education, 2009
[10] Stepanov, D. Herrscher, K. Rothermel, “On the impact of radio
propagation models on MANET simulation results”, Proceedings of 7th
International Conference on Mobile and Wireless Communications
Networks (MWCN 2005), Marrakech, Morocco, September 2005.