2149 search results - page 67 / 430 » Distributed Algorithms for Approximating Wireless Network Ca... |
104
click to vote
LCN
2005
IEEE
15 years 7 months ago
2005
IEEE
— Recent advances in microelectronic technology have made it possible to construct compact and inexpensive wireless sensors. Sensor networks have received significant attention ...
135
click to vote
ICASSP
2009
IEEE
14 years 11 months ago
2009
IEEE
In this paper, the issue of network topology control in wireless networks using a fully distributed algorithm is considered. Whereas the proposed distributed algorithm is designed...
112
click to vote
INFOCOM
2005
IEEE
15 years 7 months ago
2005
IEEE
— The problem Min-Power k-Connectivity seeks a power assignment to the nodes in a given wireless ad hoc network such that the produced network topology is k-connected and the tot...
117
click to vote
CORR
2006
Springer
15 years 1 months ago
2006
Springer
Fischer proposes in [4] a sequential algorithm to compute a minimum weight spanning tree of maximum degree at most b + logb n in time O n4+1/ln b for any constant b > 1, where ...
125
click to vote
COLOGNETWENTE
2007
15 years 2 months ago
2007
We present the first polynomial-time approximation scheme (PTAS) for the Minimum Independent Dominating Set problem in graphs of polynomially bounded growth. Graphs of bounded gr...