TY - GEN
T1 - Power Assignment for k-Connectivity in Wireless Ad Hoc Networks
AU - Jia, Xiaohua
AU - Kim, Dongsoo
AU - Makki, Sam
AU - Wan, Peng-Jun
AU - Yi, Chih-Wei
PY - 2005/3
Y1 - 2005/3
N2 - 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 total power is the lowest In this paper, we present several approximation algorithms for this problem. Specifically, we propose a 3k-approximation algorithm for any k ≥ 3, a (k + 12H (k))-approximation algorithm for k (2k - 1) ≤ n where n is the network size, a (k + 2 [(k + 1) /2])-approximation algorithm for 2 ≤ k ≤ 7, a 6-approximation algorithm for k = 3, and a 9-approximation algorithm for k = 4.
AB - 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 total power is the lowest In this paper, we present several approximation algorithms for this problem. Specifically, we propose a 3k-approximation algorithm for any k ≥ 3, a (k + 12H (k))-approximation algorithm for k (2k - 1) ≤ n where n is the network size, a (k + 2 [(k + 1) /2])-approximation algorithm for 2 ≤ k ≤ 7, a 6-approximation algorithm for k = 3, and a 9-approximation algorithm for k = 4.
KW - K-connectivity
KW - Power assignment
KW - Wireless ad hoc sensor networks
UR - http://www.scopus.com/inward/record.url?scp=25844456012&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-25844456012&origin=recordpage
U2 - 10.1109/INFCOM.2005.1498495
DO - 10.1109/INFCOM.2005.1498495
M3 - RGC 32 - Refereed conference paper (with host publication)
SN - 0780389689
VL - 3
SP - 2206
EP - 2211
BT - Proceedings - IEEE Infocom 2005: The Conference on Computer Communications
A2 - Makki, Kia
A2 - Knightly, Edward
T2 - IEEE INFOCOM 2005
Y2 - 13 March 2005 through 17 March 2005
ER -