Cart (Loading....) | Create Account
Close category search window
 

Optimized path selection process in OLSR based on weighted Connectivity Index and delay

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)
Kunavut, K. ; Dept. of Telecommun. Sci., Assumption Univ., Bangkok, Thailand ; Sanguankotchakorn, T.

OLSR which is one of proactive ad hoc routing protocols seems to be appropriate to support various applications especially multimedia applications since there is no delay occurred during route discovery phase. Many algorithms have been proposed to offer QoS routings to OLSR since it has no capability to support QoS. By using the native Multipoint Relays (MPRs) algorithm to select the MPR nodes in OLSR, the optimal path may be hidden since it aims at minimizing the control overhead flooded by MPR nodes. Thus, it limits number of possible paths known to each node and there is no guarantee that the selected paths by routing algorithm are the best feasible path. Hence, we propose the heuristic to find the optimized paths in terms of highest weighted Connectivity Index (CI) and shortest delay in order to improve performances of QoS routing algorithm to select the feasible paths to any reachable nodes in the network. Weighted CI is the combined QoS metric of link capacity and connectivity. Thus, these optimized paths refer to the paths which have enough link capacity and are robust to link failures. We construct the simulation to demonstrate that the proposed algorithm can improve performances over OLSR and Shortest-Highest Path algorithm with native MPR, and is also flexible enough to deliver services in highly mobility networks.

Published in:

Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology (ECTI-CON), 2011 8th International Conference on

Date of Conference:

17-19 May 2011

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.