Sciweavers

Share
ICDCS
2002
IEEE
9 years 5 months ago
Geometric Spanners for Wireless Ad Hoc Networks
Abstract—We propose a new geometric spanner for wireless ad hoc networks, which can be constructed efficiently in a distributed manner. It integrates the connected dominating se...
Yu Wang 0003, Xiang-Yang Li
IWCMC
2006
ACM
9 years 6 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
COCOON
2007
Springer
9 years 6 months ago
Distributed Approximation Algorithms for Weighted Problems in Minor-Closed Families
We give efficient distributed approximation algorithms for weighted versions of the maximum matching problem and the minimum dominating set problem for graphs from minor-closed fam...
Andrzej Czygrinow, Michal Hanckowiak
ICDCS
2008
IEEE
9 years 6 months ago
Distributed Connected Dominating Set Construction in Geometric k-Disk Graphs
In this paper, we study the problem of minimum connected dominating set in geometric k-disk graphs. This research is motivated by the problem of virtual backbone construction in w...
Kai Xing, Wei Cheng, E. K. Park, Shmuel Rotenstrei...
ICC
2008
IEEE
166views Communications» more  ICC 2008»
9 years 6 months ago
Multi-Initiator Connected Dominating Set Construction for Mobile Ad Hoc Networks
— The connected dominating set (CDS) has been extensively used for routing and broadcast in mobile ad hoc networks. While existing CDS protocols are successful in constructing CD...
Kazuya Sakai, Fangyang Shen, Kyoung Min Kim, Min-T...
AINA
2008
IEEE
9 years 6 months ago
Parameterless Broadcasting in Static to Highly Mobile Wireless Ad Hoc, Sensor and Actuator Networks
—In a broadcasting task, source node wants to send the same message to all the other nodes in the network. Existing solutions range from connected dominating set (CDS) based for ...
Adnan Afsar Khan, Ivan Stojmenovic, Nejib Zaguia
TAMC
2009
Springer
9 years 6 months ago
Linear Kernel for Planar Connected Dominating Set
We provide polynomial time data reduction rules for Connected Dominating Set in planar graphs and analyze these to obtain a linear kernel for the planar Connected Dominating Set pr...
Daniel Lokshtanov, Matthias Mnich, Saket Saurabh
ISAAC
2009
Springer
140views Algorithms» more  ISAAC 2009»
9 years 6 months ago
Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks
Abstract. Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of approximation algorithms for constructing a small CDS in wireless...
Minming Li, Peng-Jun Wan, F. Frances Yao
books