Sciweavers

2136 search results - page 7 / 428
» Distributed algorithms for connected domination in wireless ...
Sort
View
IPPS
2005
IEEE
14 years 2 months ago
Partial Clustering: Maintaining Connectivity in a Low Duty-Cycled Dense Wireless Sensor Network
— We consider a dense wireless sensor network where the radio transceivers of the sensor nodes are heavily duty-cycled in order to conserve energy. The chief purpose of the senso...
Chih-fan Hsin, Mingyan Liu
PDPTA
2004
13 years 10 months ago
A New Adaptive Distributed Routing Protocol Using d-hop Dominating Sets for Mobile Ad Hoc Networks
In this paper, we propose an adaptive self- stabilizing algorithm for producing a d-hop connected d-hop dominating set. In the algorithm, the set is cumulatively built with commun...
Zhengnan Shi, Pradip K. Srimani
CLUSTER
2002
IEEE
13 years 8 months ago
Internal Node and Shortcut Based Routing with Guaranteed Delivery in Wireless Networks
Several distributed routing algorithms for wireless networks were described recently, based on location information of nodes available via Global Positioning System (GPS). In gree...
Susanta Datta, Ivan Stojmenovic, Jie Wu
APPROX
2006
Springer
234views Algorithms» more  APPROX 2006»
14 years 21 days ago
Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...
Christoph Ambühl, Thomas Erlebach, Matú...
MOBIHOC
2003
ACM
14 years 8 months ago
Topology management in ad hoc networks
The efficiency of a communication network depends not only on its control protocols, but also on its topology. We propose a distributed topology management algorithm that construc...
Lichun Bao, J. J. Garcia-Luna-Aceves