skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Algorithmic aspects of topology control problems for ad hoc networks

Abstract

Topology control problems are concerned with the assignment of power values to nodes of an ad hoc network so that the power assignment leads to a graph topology satisfying some specified properties. This paper considers such problems under several optimization objectives, including minimizing the maximum power and minimizing the total power. A general approach leading to a polynomial algorithm is presented for minimizing maximum power for a class of graph properties, called monotone properties. The difficulty of generalizing the approach to properties that are not monoione is pointed out. Problems involving the minimization of total power are known to be NP-complete even for simple graph properties. A general approach that leads to an approximation algorithm for minimizing the total power for some monotone properties is presented. Using this approach, a new approximation algorithm for the problem of minimizing the total power for obtaining a 2-node-connected graph is obtained. It is shown that this algorithm provides a constant performance guarantee. Experimental results from an implementation of the approximation algorithm are also presented.

Authors:
 [1];  [2];  [3];  [4];
  1. Rui
  2. Errol L.
  3. Madhav V.
  4. Ram
Publication Date:
Research Org.:
Los Alamos National Laboratory
Sponsoring Org.:
USDOE
OSTI Identifier:
975949
Report Number(s):
LA-UR-02-0256; LA-UR-02-256
TRN: US1006834
Resource Type:
Conference
Resource Relation:
Conference: "Submitted to: The Third ACM International Symposium on Mobile Ad Hoc Networking&Computing, Lausanne, Switerland, June 9-11, 2002"
Country of Publication:
United States
Language:
English
Subject:
12 MANAGEMENT OF RADIOACTIVE WASTES, AND NON-RADIOACTIVE WASTES FROM NUCLEAR FACILITIES; ALGORITHMS; APPROXIMATIONS; IMPLEMENTATION; MINIMIZATION; OPTIMIZATION; PERFORMANCE; POLYNOMIALS; TOPOLOGY; COMPUTERS; NETWORK ANALYSIS

Citation Formats

Liu, R, Lloyd, E L, Marathe, M V, Ramanathan, R, and Ravi, S S. Algorithmic aspects of topology control problems for ad hoc networks. United States: N. p., 2002. Web.
Liu, R, Lloyd, E L, Marathe, M V, Ramanathan, R, & Ravi, S S. Algorithmic aspects of topology control problems for ad hoc networks. United States.
Liu, R, Lloyd, E L, Marathe, M V, Ramanathan, R, and Ravi, S S. Tue . "Algorithmic aspects of topology control problems for ad hoc networks". United States. https://www.osti.gov/servlets/purl/975949.
@article{osti_975949,
title = {Algorithmic aspects of topology control problems for ad hoc networks},
author = {Liu, R and Lloyd, E L and Marathe, M V and Ramanathan, R and Ravi, S S},
abstractNote = {Topology control problems are concerned with the assignment of power values to nodes of an ad hoc network so that the power assignment leads to a graph topology satisfying some specified properties. This paper considers such problems under several optimization objectives, including minimizing the maximum power and minimizing the total power. A general approach leading to a polynomial algorithm is presented for minimizing maximum power for a class of graph properties, called monotone properties. The difficulty of generalizing the approach to properties that are not monoione is pointed out. Problems involving the minimization of total power are known to be NP-complete even for simple graph properties. A general approach that leads to an approximation algorithm for minimizing the total power for some monotone properties is presented. Using this approach, a new approximation algorithm for the problem of minimizing the total power for obtaining a 2-node-connected graph is obtained. It is shown that this algorithm provides a constant performance guarantee. Experimental results from an implementation of the approximation algorithm are also presented.},
doi = {},
url = {https://www.osti.gov/biblio/975949}, journal = {},
number = ,
volume = ,
place = {United States},
year = {2002},
month = {1}
}

Conference:
Other availability
Please see Document Availability for additional information on obtaining the full-text document. Library patrons may search WorldCat to identify libraries that hold this conference proceeding.

Save / Share: