Sciweavers

228 search results - page 4 / 46
» New Distributed Algorithm for Connected Dominating Set in Wi...
Sort
View
SODA
2003
ACM
122views Algorithms» more  SODA 2003»
13 years 6 months ago
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
Motivated by routing issues in ad hoc networks, we present polylogarithmic-time distributed algorithms for two problems. Given a network, we first show how to compute connected a...
Devdatt P. Dubhashi, Alessandro Mei, Alessandro Pa...
IPPS
2005
IEEE
13 years 11 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
MASCOTS
2007
13 years 6 months ago
A Hierarchical Connected Dominating Set Based Clustering Algorithm for Mobile Ad Hoc Networks
— We propose a hierarchical Connected Dominating Set (CDS) based algorithm for clustering in Mobile Ad hoc Networks (MANETs). Our algorithm is an extension of our previous Connec...
Deniz Cokuslu, Kayhan Erciyes
LCN
2003
IEEE
13 years 10 months ago
New Metrics for Dominating Set Based Energy Efficient Activity Scheduling in Ad Hoc Networks
In a multi-hop wireless network, each node is able to send a message to all of its neighbors that are located within its transmission radius. In a flooding task, a source sends th...
Jamil A. Shaikh, Julio Solano-González, Iva...
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...