Impact of Locality on Location Aware Unit Disk Graphs

Due to their importance for studies oi wireless networks, recent years have seen a surge of activity on the design of local algorithms for the solution of a variety of network tasks. We study the behaviour of algorithms with very low localities. Despite of this restriction we propose local constant...

Full description

Saved in:
Bibliographic Details
Published inAlgorithms Vol. 1; no. 1; pp. 2 - 29
Main Authors Wiese, Andreas, Kranakis, Evangelos
Format Journal Article
LanguageEnglish
Published Basel MDPI AG 01.09.2008
Subjects
Approximation Algorithms
Local Algorithms
Location Awareness
Lower Bounds
Unit Disk Graphs
Online AccessGet full text

Cover

More Information
Summary:Due to their importance for studies oi wireless networks, recent years have seen a surge of activity on the design of local algorithms for the solution of a variety of network tasks. We study the behaviour of algorithms with very low localities. Despite of this restriction we propose local constant ratio approximation algorithms for solving minimum dominating and connected dominating set, maximum independent set and minimum vertex cover in location aware Unit Disk Graphs. We also prove the first ever lower bounds for local algorithms for these problems with a given locality in the location aware setting.
ISSN:1999-4893
1999-4893
DOI:10.3390/a1010002