By Topic

An Iterative Multi-path Routing Protocol in Wireless Ad Hoc Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Zhongke Zhang ; Sch. of Comput. Sci. & Eng., Southeast Univ., Nanjing, China ; Yun Wang

In Wireless ad hoc networks, multi-path routing cannot only improve the reliability of route, but also enhance the throughput and load-balancing of networks. However, due to the existence of unavoidable connectivity holes in randomly deployed networks, the number of found node-disjoint paths k of existing multi-path routing protocols still remains to be improved. In this paper, we propose an iterative multi-path routing protocol(IMPR). We first categorize nodes into three types by analyzing node local topology features and give formal definitions of node type and network connectivity hole. Then, we present an algorithm to recognize network connectivity holes by local flooding. Finally, we design an iterative multiple paths discovery algorithm, which with the help of recognized connectivity holes, iteratively builds alternate paths based on a path found by any known single-path routing protocol between a node pair. Simulation results show that in comparison with existing multi-path routing protocols, IMPR can find more node-disjoint paths between source-destination pairs.

Published in:

Trust, Security and Privacy in Computing and Communications (TrustCom), 2011 IEEE 10th International Conference on

Date of Conference:

16-18 Nov. 2011