By Topic

Self-Organized Routing ID Tree-Based Multipath Construction for 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

4 Author(s)
Okazaki, T. ; Grad. Sch. of Inf. Sci., Hiroshima City Univ., Hiroshima, Japan ; Takeuchi, M. ; Kohno, E. ; Kakuda, Y.

In ad hoc networks, the network topology changes because of the node mobility. Routing protocols should keep their data delivery performance by dynamical reconstruction of the routes. In this paper, we propose a routing method using a self-organized routing ID tree. Our proposed method keeps the data delivery performance by decreasing the frequency of link cuts between two nodes in parent-child relationships. In addition our proposed method makes it possible to self-restore the broken routes in a real-time way only to exchange the link update information between groups on both sides of the broken link. We have implemented our method on the network simulator, Qualnet and evaluated our proposed method in comparison with OLSRv2 and our previously proposed method, namely SRIDR. We measured data delivery ratio and the amount of control packets on each method. Our proposed method shows higher data delivery ratio than OLSRv2 in the network in which nodes move at relatively low speeds.

Published in:

Object/Component/Service-Oriented Real-Time Distributed Computing Workshops (ISORCW), 2012 15th IEEE International Symposium on

Date of Conference:

11-11 April 2012