Power Assignment for k-Connectivity in Wireless Ad Hoc Networks

Research output: Chapters, Conference Papers, Creative and Literary Works (RGC: 12, 32, 41, 45)32_Refereed conference paper (with ISBN/ISSN)peer-review

40 Scopus Citations
View graph of relations

Author(s)

Related Research Unit(s)

Detail(s)

Original languageEnglish
Title of host publicationProceedings - IEEE Infocom 2005: The Conference on Computer Communications
Subtitle of host publication24th Annual Joint Conference of the IEEE Computer and Communications Societies
EditorsKia Makki, Edward Knightly
Pages2206-2211
Volume3
Publication statusPublished - Mar 2005

Publication series

Name
ISSN (Print)0743-166X

Conference

TitleIEEE INFOCOM 2005
LocationHyatt Regency Miami
PlaceUnited States
CityMiami
Period13 - 17 March 2005

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.

Research Area(s)

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

Citation Format(s)

Power Assignment for k-Connectivity in Wireless Ad Hoc Networks. / Jia, Xiaohua; Kim, Dongsoo; Makki, Sam et al.

Proceedings - IEEE Infocom 2005: The Conference on Computer Communications: 24th Annual Joint Conference of the IEEE Computer and Communications Societies. ed. / Kia Makki; Edward Knightly. Vol. 3 2005. p. 2206-2211.

Research output: Chapters, Conference Papers, Creative and Literary Works (RGC: 12, 32, 41, 45)32_Refereed conference paper (with ISBN/ISSN)peer-review