Complexity of network synchronization
Journal of the ACM (JACM)
Deterministic coin tossing with applications to optimal parallel list ranking
Information and Control
Discrete Mathematics - Topics on domination
Scheduling algorithms for multi-hop radio networks
SIGCOMM '92 Conference proceedings on Communications architectures & protocols
Approximation algorithms for NP-complete problems on planar graphs
Journal of the ACM (JACM)
Approximation schemes for covering and packing problems in image processing and VLSI
Journal of the ACM (JACM)
NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs
Journal of Algorithms
Unit disk graph recognition is NP-hard
Computational Geometry: Theory and Applications - Special issue on geometric representations of graphs
On calculating connected dominating set for efficient routing in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Polynomial-time approximation schemes for geometric graphs
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Finding nearest neighbors in growth-restricted metrics
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Message-optimal connected dominating sets in mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Global Optimization Using Local Information with Applications to Flow Control
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
New Distributed Algorithm for Connected Dominating Set in Wireless Ad Hoc Networks
HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 9 - Volume 9
Constant-time distributed dominating set approximation
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Ad-hoc networks beyond unit disk graphs
DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
Energy-efficient collision-free medium access control for wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
What cannot be computed locally!
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Proceedings of the 2004 joint workshop on Foundations of mobile computing
Initializing newly deployed ad hoc and sensor networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Distributed low-cost backbone formation for wireless ad hoc networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
On the node-scheduling approach to topology control in ad hoc networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
On the locality of bounded growth
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Maximal independent sets in radio networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Name independent routing for growth bounded networks
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
A PTAS for the minimum dominating set problem in unit disk graphs
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Distributed algorithms for coloring and domination in wireless ad hoc networks
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
A robust PTAS for maximum weight independent sets in unit disk graphs
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Fast deterministic distributed maximal independent set computation on growth-bounded graphs
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Distributed almost exact approximations for minor-closed families
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphs
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Distributed packing in planar graphs
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Ad hoc networks beyond unit disk graphs
Wireless Networks
A log-star distributed maximal independent set algorithm for growth-bounded graphs
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Local PTAS for Independent Set and Vertex Cover in Location Aware Unit Disk Graphs
DCOSS '08 Proceedings of the 4th IEEE international conference on Distributed Computing in Sensor Systems
Local Maximal Matching and Local 2-Approximation for Vertex Cover in UDGs
ADHOC-NOW '08 Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks
Closing the Complexity Gap between FCFS Mutual Exclusion and Mutual Exclusion
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Construction of virtual backbone on growth-bounded graph with variable transmission range
WSEAS Transactions on Computers
Local PTAS for Dominating and Connected Dominating Set in Location Aware Unit Disk Graphs
Approximation and Online Algorithms
Algorithmic models of interference in wireless ad hoc and sensor networks
IEEE/ACM Transactions on Networking (TON)
Coloring unstructured wireless multi-hop networks
Proceedings of the 28th ACM symposium on Principles of distributed computing
Low complexity stable link scheduling for maximizing throughput in wireless networks
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
ADHOC-NOW'07 Proceedings of the 6th international conference on Ad-hoc, mobile and wireless networks
Sensor networks continue to puzzle: selected open problems
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Local approximation algorithms for scheduling problems in sensor networks
ALGOSENSORS'07 Proceedings of the 3rd international conference on Algorithmic aspects of wireless sensor networks
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Algorithms for sensor and ad hoc networks: advanced lectures
Algorithms for sensor and ad hoc networks: advanced lectures
A new technique for distributed symmetry breaking
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Algorithmic models for sensor networks
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Distributed approximation algorithms in unit-disk graphs
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Exact algorithms for finding the minimum independent dominating set in graphs
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Shifting strategy for geometric graphs without geometry
Journal of Combinatorial Optimization
Scalable load-distance balancing
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Distributed approximations for packing in unit-disk graphs
DISC'07 Proceedings of the 21st international conference on Distributed Computing
| Hi-index | 0.00 |
We present two local approaches that yield polynomial-time approximation schemes (PTAS) for the Maximum Independent Set and Minimum Dominating Set problem in unit disk graphs. The algorithms run locally in each node and compute a (1+ε)-approximation to the problems at hand for any given ε 0. The time complexity of both algorithms is O(TMIS + log*! n/εO(1)), where TMIS is the time required to compute a maximal independent set in the graph, and n denotes the number of nodes. We then extend these results to a more general class of graphs in which the maximum number of pair-wise independent nodes in every r-neighborhood is at most polynomial in r. Such graphs of polynomially bounded growth are introduced as a more realistic model for wireless networks and they generalize existing models, such as unit disk graphs or coverage area graphs.