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

Efficient route discovery using stable connected Dominating Set for 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

2 Author(s)
Revathi, S. ; CSE Dept., B.S.A. Crescent Eng. Coll., Vandalur, India ; Rangaswamy, T.R.

Ad hoc Networks are wireless networks without any fixed infrastructure. The conventional on demand route discovery employ simple flooding method. To send a datagram, a source host broadcasts a route request (RREQ) packet to the network. All neighboring nodes receiving this packet rebroadcast it, until it reaches the destination. It has a large flooding overhead, poor network performance and undesirable battery power consumption. The connecting Dominating Set (CDS) is a promising approach to the broadcasting storm problem. The proposed algorithm selects a node with the highest weight value to be a dominator node that is stronger and more stable. The weight value is to be calculated based on the rate of change of displacement and signal strength. The dominator nodes are connected using the Steiner tree. The CDS is constructed after connecting the dominators and pruning. To improve the network performance, we have designed an algorithm for finding the Minimum Connected Dominating Set (MCDS), using the Dominating Set for mobile ad hoc networks, based on weight values. The simulation results show that our algorithm has better performance, especially in the packet delivery rate and flooding overhead, when compared to other similar algorithms.

Published in:

Information and Communication Technologies (WICT), 2012 World Congress on

Date of Conference:

Oct. 30 2012-Nov. 2 2012

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.