By Topic

Localized probabilistic and dominating set based algorithm for efficient information dissemination in 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)
Hauspie, M. ; IRCICA/LIFL, Lille I Univ., Villeneuve d'Ascq, France ; Panier, A.

Ad hoc networks are autonomous dynamic networks composed of mobile devices like personal digital assistants (PDA) for instance. In such mobile networks, lack of infrastructure leads to non trivial information discovery and dissemination. A scheme in which a unique object centralizes information is not efficient for many reasons. We propose a probabilistic algorithm to distribute an information token satisfactorily among nodes forming the network by using localized data. Then, in order to limit the number of memorizing nodes, we propose to make memorizing nodes belong to a dominating set.

Published in:

Mobile Ad-hoc and Sensor Systems, 2004 IEEE International Conference on

Date of Conference:

25-27 Oct. 2004