By Topic

Dominating set based position routing in mobile 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

3 Author(s)
Ruhil, A.P. ; Sch. of Comput. & Syst. Sci., Jawaharlal Nehru Univ., New Delhi, India ; Lobiyal, D.K. ; Stojmenovic, I.

A variety of position based routing algorithms have been proposed to reduce communication overheads. Communication overheads can be further reduced by introducing the concept of dominating set to position based routing algorithms. A set is a dominating set if all the nodes in the network are either in the set or neighbors of the nodes in the set. We apply a dominant pruning dominating set in VD-GEDIR, CH-MFR, R-DIR, LAR, and DREAM algorithms in the mobile ad hoc environment. The results show that the flooding ratio has been significantly reduced without influencing the success rate and hop counts after applying the dominating set. A random walk mobility model has been chosen to implement the movement of nodes in a proactive environment.

Published in:

Personal Wireless Communications, 2005. ICPWC 2005. 2005 IEEE International Conference on

Date of Conference:

23-25 Jan. 2005