Algorithmic Problems in Power-Controlled Ad Hoc Networks

András Faragó, Violet R. Syrotiuk

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Scopus citations

Abstract

We analyze some interesting algorithmic problems in power-controlled ad hoc networks that are related to spanning trees with different objectives. The main result is that the minimum energy broadcast tree problem can be approximately solved with a guaranteed bound on the error in polynomial time, while finding the exact optimum is infeasible.

Original languageEnglish (US)
Title of host publication14th International Conference on Parallel and Distributed Computing Systems 2001, PDCS 2001
EditorsEdwin Sha
PublisherInternational Society for Computers and Their Applications (ISCA)
Pages177-182
Number of pages6
ISBN (Electronic)9781618395740
StatePublished - 2001
Event14th International Conference on Parallel and Distributed Computing Systems, PDCS 2001 - Richardson, United States
Duration: Aug 8 2001Aug 10 2001

Publication series

Name14th International Conference on Parallel and Distributed Computing Systems 2001, PDCS 2001

Conference

Conference14th International Conference on Parallel and Distributed Computing Systems, PDCS 2001
Country/TerritoryUnited States
CityRichardson
Period8/8/018/10/01

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture
  • Software

Fingerprint

Dive into the research topics of 'Algorithmic Problems in Power-Controlled Ad Hoc Networks'. Together they form a unique fingerprint.

Cite this