Skip to main navigation Skip to search Skip to main content

Power Assignment for k-Connectivity in Wireless Ad Hoc Networks

Xiaohua Jia, Dongsoo Kim, Sam Makki, Peng-Jun Wan, Chih-Wei Yi

Research output: Chapters, Conference Papers, Creative and Literary WorksRGC 32 - Refereed conference paper (with host publication)peer-review

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 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
DOIs
Publication statusPublished - Mar 2005
EventIEEE INFOCOM 2005 - Hyatt Regency Miami, Miami, United States
Duration: 13 Mar 200517 Mar 2005

Publication series

Name
ISSN (Print)0743-166X

Conference

ConferenceIEEE INFOCOM 2005
PlaceUnited States
CityMiami
Period13/03/0517/03/05

Research 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