Commenced in January 2007
Paper Count: 32578
Improving Survivability in Wireless Ad Hoc Network
Abstract:Topological changes in mobile ad hoc networks frequently render routing paths unusable. Such recurrent path failures have detrimental effects on quality of service. A suitable technique for eliminating this problem is to use multiple backup paths between the source and the destination in the network. This paper proposes an effective and efficient protocol for backup and disjoint path set in ad hoc wireless network. This protocol converges to a highly reliable path set very fast with no message exchange overhead. The paths selection according to this algorithm is beneficial for mobile ad hoc networks, since it produce a set of backup paths with more high reliability. Simulation experiments are conducted to evaluate the performance of our algorithm in terms of route numbers in the path set and its reliability. In order to acquire link reliability estimates, we use link expiration time (LET) between two nodes.
Digital Object Identifier (DOI): doi.org/10.5281/zenodo.1080338Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1565
 T. Camp, J. Boleng, and V. Davies, "A survey of mobility models for adhoc network research," Wireless Comm. & Mobile Comp. (WCMC), vol. 2, no. 5, pp. 483-502, 2002.
 S.K. Das, A. Mukherjee, S. Bandyopadhyay, D. Saha, and K. Paul , "An adaptive framework for QoS routing through multiple paths in ad-hoc wireless networks," Journal of Parallel and Distributed Computing, 63:141-153, 2003.
 S. De, C. Qiao, and H. Wu, "Meshed multipath routing: An efficient strategy in sensor networks,"in Proceedings of Wireless Communications and Networking (WCNC), vol. 3, March 2003, pp. 1912-1917.
 Frederick Ducatelle, Gianni Di Caro and Luca Maria Gambardella, "Ant Agents for Hybrid Multipath Routing in Mobile Ad-Hoc Networks,"in the Proceedings of the Second Annual Conference on Wireless On demand Network Systems and Services (WONS), St. Moritz, Switzerland, January 19-21, 2005.
 M. Hauspie, D. Simplot, and J. Carle," Partition detection in mobile adhoc networks using multiple disjoint paths set, " In Proceedings of the 2nd Mediterranean Workshop on Ad-Hoc Networks, Mahdia, Tunisia, June 2003.
 S. Kim, W. Noh, and S. An, "Multi-path ad-hoc routing considering path redundancy," in Proceedings of Eighth IEEE International Symposium on Computers and Communication (ISCC), March 2003, pp. 45-50.
 S. Lee and M. Gerla, "Split multipath routing with maximally disjoint paths in ad-hoc networks," in Proceedings of IEEE International Conference on Communications (ICC), vol. 10, June 2001, pp. 3201- 3205.
 M. K. Marina and S. R. Das., "On-demand multipath distance vector routing in ad-hoc networks," in Proceedings of IEEE International Conference on Network Protocols (ICNP), March 2001, pp. 14-23.
 M. K. Marina and S. R. Das, "Ad-hoc on-demand multipath distance vector routing," ACM SIGMOBILE Mobile Computing and Communications Review, vol. 6, no. 3, pp. 92-93, July 2002.
 A. Nasipuri, R. Casta├▒eda, and S. R. Das, "Performance of multipath routing for on-demand protocols in mobile ad-hoc networks," Mobile Networks and Applications, vol. 6, no. 4, pp. 339-349, August 2001.
 D. Subhadrabandhu, S. Saker, F. Anjum, "A framework for misuse detection in Ad-hoc networks- part 1," IEEE, Sel. Areas Commun. (Special issue on security in wireless Ad-hoc networks), vol. 24, no. 2, pp. 274-289, Feb 2006.
 L. Wang, L. Zhang, Y. Shu, and M. Dong, "Multipath source routing in wireless ad-hoc networks," in Proceedings of Canadian Conference on Electrical and Computer Engineering, vol. 1, March 2000, pp. 479-483.
 L.Wang, Y. Shu, M. Dong, L. Zhang, and O.W.W. Yang, "Adaptive multipath source routing in ad hoc networks," in Proceedings of IEEE International Conference on Communications(ICC), vol. 3, 2001, pp. 867-871.
 J. Wu, "An extended dynamic source routing scheme in ad-hoc wireless networks," in Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS), January 2002, pp. 3832- 3838.