Sciweavers

56 search results - page 2 / 12
» Distributed Construction of Connected Dominating Sets with M...
Sort
View
JCIT
2008
138views more  JCIT 2008»
13 years 4 months ago
Enhancing the Routing Performance of Wireless Sensor Networks using Connected Dominating Sets
Many prominent applications in wireless sensor networks require collected information has to be routed to end nodes in an efficient manner. In general, Connected Dominating Set (C...
B. Paramasivan, Mohaideen Pitchai, Radha Krishnan
IPPS
2005
IEEE
13 years 10 months ago
On Constructing k-Connected k-Dominating Set in Wireless Networks
An important problem in wireless networks, such as wireless ad hoc and sensor networks, is to select a few nodes to form a virtual backbone that supports routing and other tasks s...
Fei Dai, Jie Wu
JPDC
2007
191views more  JPDC 2007»
13 years 4 months ago
Clustering wireless ad hoc networks with weakly connected dominating set
The increasing popular personal communications and mobile computing require a wireless network infrastructure that supports selfconfiguration and self-management. Efficient clus...
Bo Han, Weijia Jia
MOBIHOC
2002
ACM
14 years 4 months ago
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
Yuanzhu Peter Chen, Arthur L. Liestman
IWCMC
2006
ACM
13 years 10 months ago
Energy efficient distributed connected dominating sets construction in wireless sensor networks
One important characteristic of wireless sensor networks is energy stringency. Constructing a connected dominating set (CDS) has been widely used as a topology control strategy to...
Yuanyuan Zeng, Xiaohua Jia, Yanxiang He