Sciweavers

256 search results - page 1 / 52
» Power assignment for k-connectivity in wireless ad hoc netwo...
Sort
View
INFOCOM
2005
IEEE
13 years 10 months ago
Power assignment for k-connectivity in wireless ad hoc networks
— 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...
Xiaohua Jia, Dongsoo Kim, Sam Makki, Peng-Jun Wan,...
IPPS
2005
IEEE
13 years 10 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
ADHOCNOW
2008
Springer
13 years 11 months ago
Approximating Minimum-Power k-Connectivity
Abstract. The Minimum-Power k-Connected Subgraph (MPkCS) problem seeks a power (range) assignment to the nodes of a given wireless network such that the resulting communication (su...
Zeev Nutov
ESA
2003
Springer
98views Algorithms» more  ESA 2003»
13 years 9 months ago
Network Lifetime and Power Assignment in ad hoc Wireless Networks
In ad-hoc wireless networks, certain network connectivity constraints are of interest because of their practical importance. An example of such a constraint would be strong connec...
Gruia Calinescu, Sanjiv Kapoor, Alexander Olshevsk...
JCO
2006
126views more  JCO 2006»
13 years 4 months ago
Minimum power assignment in wireless ad hoc networks with spanner property
Power assignment for wireless ad hoc networks is to assign a power for each wireless node such that the induced communication graph has some required properties. Recently research ...
Yu Wang 0003, Xiang-Yang Li