### Abstract

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.

Original language | English |
---|---|

Title of host publication | Proceedings - IEEE INFOCOM 2005. The Conference on Computer Communications - 24th Annual Joint Conference of the IEEE Computer and Communications Societies |

Editors | K. Makki, E. Knightly |

Pages | 2206-2211 |

Number of pages | 6 |

DOIs | |

State | Published - 10 Oct 2005 |

Event | IEEE INFOCOM 2005 - Miami, FL, United States Duration: 13 Mar 2005 → 17 Mar 2005 |

### Publication series

Name | Proceedings - IEEE INFOCOM |
---|---|

Volume | 3 |

ISSN (Print) | 0743-166X |

### Conference

Conference | IEEE INFOCOM 2005 |
---|---|

Country | United States |

City | Miami, FL |

Period | 13/03/05 → 17/03/05 |

### Keywords

- K-connectivity
- Power assignment
- Wireless ad hoc sensor networks

## Fingerprint Dive into the research topics of 'Power assignment for k-connectivity in wireless ad hoc networks'. Together they form a unique fingerprint.

## Cite this

Jia, X., Kim, D., Makki, S., Wan, P. J., & İk, T-U. (2005). Power assignment for k-connectivity in wireless ad hoc networks. In K. Makki, & E. Knightly (Eds.),

*Proceedings - IEEE INFOCOM 2005. The Conference on Computer Communications - 24th Annual Joint Conference of the IEEE Computer and Communications Societies*(pp. 2206-2211). (Proceedings - IEEE INFOCOM; Vol. 3). https://doi.org/10.1109/INFCOM.2005.1498495