By Topic

Optimal distributed algorithm for minimum connected dominating sets in Wireless Sensor 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)
Raei, H. ; Comput. Eng. Dept., Univ. of Yazd, Yazd ; Sarram, M. ; Adibniya, F. ; Tashtarian, F.

Since there is no fixed infrastructure or centralized management in wireless sensor network (WSN), a connected dominating set (CDS) has been proposed as a virtual backbone. The CDS plays a major role in routing, broadcasting, coverage and activity scheduling. To reduce the traffic during communication and prolong network lifetime, it is desirable to construct a minimum CDS (MCDS). For the MCDS problem, this kind of the networks usually has been modeled in unit disk graph (UDG), in which each node has the same transmission range. In this paper, a new distributed algorithm for MCDS problem in UDG with constant approximation ratio is introduced which has outstanding time complexity of O(1) and message complexity of O(n) . Theoretical analysis and simulation results are also presented to verify efficiencypsilas our approach.

Published in:

Mobile Ad Hoc and Sensor Systems, 2008. MASS 2008. 5th IEEE International Conference on

Date of Conference:

Sept. 29 2008-Oct. 2 2008