Open Science Research Excellence

Open Science Index

Commenced in January 2007 Frequency: Monthly Edition: International Publications Count: 29414


Select areas to restrict search in scientific publication database:
10001667
Trustworthy Link Failure Recovery Algorithm for Highly Dynamic Mobile Adhoc Networks
Abstract:
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.
Digital Object Identifier (DOI):

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.
Vol:13 No:03 2019Vol:13 No:02 2019Vol:13 No:01 2019
Vol:12 No:12 2018Vol:12 No:11 2018Vol:12 No:10 2018Vol:12 No:09 2018Vol:12 No:08 2018Vol:12 No:07 2018Vol:12 No:06 2018Vol:12 No:05 2018Vol:12 No:04 2018Vol:12 No:03 2018Vol:12 No:02 2018Vol:12 No:01 2018
Vol:11 No:12 2017Vol:11 No:11 2017Vol:11 No:10 2017Vol:11 No:09 2017Vol:11 No:08 2017Vol:11 No:07 2017Vol:11 No:06 2017Vol:11 No:05 2017Vol:11 No:04 2017Vol:11 No:03 2017Vol:11 No:02 2017Vol:11 No:01 2017
Vol:10 No:12 2016Vol:10 No:11 2016Vol:10 No:10 2016Vol:10 No:09 2016Vol:10 No:08 2016Vol:10 No:07 2016Vol:10 No:06 2016Vol:10 No:05 2016Vol:10 No:04 2016Vol:10 No:03 2016Vol:10 No:02 2016Vol:10 No:01 2016
Vol:9 No:12 2015Vol:9 No:11 2015Vol:9 No:10 2015Vol:9 No:09 2015Vol:9 No:08 2015Vol:9 No:07 2015Vol:9 No:06 2015Vol:9 No:05 2015Vol:9 No:04 2015Vol:9 No:03 2015Vol:9 No:02 2015Vol:9 No:01 2015
Vol:8 No:12 2014Vol:8 No:11 2014Vol:8 No:10 2014Vol:8 No:09 2014Vol:8 No:08 2014Vol:8 No:07 2014Vol:8 No:06 2014Vol:8 No:05 2014Vol:8 No:04 2014Vol:8 No:03 2014Vol:8 No:02 2014Vol:8 No:01 2014
Vol:7 No:12 2013Vol:7 No:11 2013Vol:7 No:10 2013Vol:7 No:09 2013Vol:7 No:08 2013Vol:7 No:07 2013Vol:7 No:06 2013Vol:7 No:05 2013Vol:7 No:04 2013Vol:7 No:03 2013Vol:7 No:02 2013Vol:7 No:01 2013
Vol:6 No:12 2012Vol:6 No:11 2012Vol:6 No:10 2012Vol:6 No:09 2012Vol:6 No:08 2012Vol:6 No:07 2012Vol:6 No:06 2012Vol:6 No:05 2012Vol:6 No:04 2012Vol:6 No:03 2012Vol:6 No:02 2012Vol:6 No:01 2012
Vol:5 No:12 2011Vol:5 No:11 2011Vol:5 No:10 2011Vol:5 No:09 2011Vol:5 No:08 2011Vol:5 No:07 2011Vol:5 No:06 2011Vol:5 No:05 2011Vol:5 No:04 2011Vol:5 No:03 2011Vol:5 No:02 2011Vol:5 No:01 2011
Vol:4 No:12 2010Vol:4 No:11 2010Vol:4 No:10 2010Vol:4 No:09 2010Vol:4 No:08 2010Vol:4 No:07 2010Vol:4 No:06 2010Vol:4 No:05 2010Vol:4 No:04 2010Vol:4 No:03 2010Vol:4 No:02 2010Vol:4 No:01 2010
Vol:3 No:12 2009Vol:3 No:11 2009Vol:3 No:10 2009Vol:3 No:09 2009Vol:3 No:08 2009Vol:3 No:07 2009Vol:3 No:06 2009Vol:3 No:05 2009Vol:3 No:04 2009Vol:3 No:03 2009Vol:3 No:02 2009Vol:3 No:01 2009
Vol:2 No:12 2008Vol:2 No:11 2008Vol:2 No:10 2008Vol:2 No:09 2008Vol:2 No:08 2008Vol:2 No:07 2008Vol:2 No:06 2008Vol:2 No:05 2008Vol:2 No:04 2008Vol:2 No:03 2008Vol:2 No:02 2008Vol:2 No:01 2008
Vol:1 No:12 2007Vol:1 No:11 2007Vol:1 No:10 2007Vol:1 No:09 2007Vol:1 No:08 2007Vol:1 No:07 2007Vol:1 No:06 2007Vol:1 No:05 2007Vol:1 No:04 2007Vol:1 No:03 2007Vol:1 No:02 2007Vol:1 No:01 2007