Sciweavers

21 search results - page 1 / 5
» Smaller Connected Dominating Sets in Ad Hoc and Sensor Netwo...
Sort
View
COMSWARE
2007
IEEE
13 years 11 months ago
Smaller Connected Dominating Sets in Ad Hoc and Sensor Networks based on Coverage by Two-Hop Neighbors
— In this paper, we focus on the construction of an efficient dominating set in ad hoc and sensor networks. A set of nodes is said to be dominating if each node is either itself...
François Ingelrest, David Simplot-Ryl, Ivan...
ISCC
2005
IEEE
146views Communications» more  ISCC 2005»
13 years 10 months ago
Preserving Area Coverage in Wireless Sensor Networks by Using Surface Coverage Relay Dominating Sets
— Sensor networks consist of autonomous nodes with limited battery and of base stations with theoritical infinite energy. Nodes can be sleep to extend the lifespan of the networ...
Jean Carle, Antoine Gallais, David Simplot-Ryl
AINA
2008
IEEE
13 years 11 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
ISPAN
2002
IEEE
13 years 10 months ago
On Locality of Dominating Set in Ad Hoc Networks with Switch-On/Off Operations
Routing based on a connected dominating set is a promising approach, where the search space for a route is reduced to the hosts in the set. A set is dominating if all the hosts in...
Jie Wu, Fei Dai
ICDCS
2008
IEEE
13 years 11 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...