By Topic

Distributed algorithm for connected Dominating Sets in Wireless Sensor Networks with different transmission ranges

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)
Raei, H. ; Comput. Eng. Dept., Yazd Univ., Yazd ; Sarram, M. ; Adibniya, F.

Since there is no fixed infrastructure or centralized management in wireless sensor networks (WSNs), 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. The CDS problem has been studied intensively in unit disk graph (UDG), in which each node has the same transmission range. In real world this kind of networks are not necessarily contain nodes with equal transmission range. Recently one research has investigated the CDS problem in disk graph with bidirectional links (DGB), in which nodes have different transmission ranges. This approach has constant Approximation ratio with time and message complexity of O(n2). In this paper, a new distributed algorithm for CDS problem in DGB with constant approximation ratio is introduced which has outstanding time complexity of O(n) and message complexity of O(nlog n).

Published in:

Telecommunications, 2008. IST 2008. International Symposium on

Date of Conference:

27-28 Aug. 2008