Local approximation algorithms for scheduling problems in sensor networks

Authors:
Patrik Floréen;Petteri Kaski;Topi Musto;Jukka Suomela
Affiliations:
Helsinki Institute for Information Technology, Department of Computer Science, University of Helsinki, Finland;Helsinki Institute for Information Technology, Department of Computer Science, University of Helsinki, Finland;Helsinki Institute for Information Technology, Department of Computer Science, University of Helsinki, Finland;Helsinki Institute for Information Technology, Department of Computer Science, University of Helsinki, Finland
Venue:
ALGOSENSORS'07 Proceedings of the 3rd international conference on Algorithmic aspects of wireless sensor networks
Year:
2007

Citing 14
Cited 3

Locality in distributed graph algorithms

SIAM Journal on Computing
Approximation schemes for covering and packing problems in image processing and VLSI

Journal of the ACM (JACM)
What Can Be Computed Locally?

SIAM Journal on Computing
NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs

Journal of Algorithms
On the hardness of approximating minimization problems

Journal of the ACM (JACM)
Approximating the Domatic Number

SIAM Journal on Computing
An Approximation Scheme for Some Steiner Tree Problems in the Plane

ISAAC '94 Proceedings of the 5th International Symposium on Algorithms and Computation
Maximizing the Lifetime of Dominating Sets

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
Polynomial-Time Approximation Schemes for Geometric Intersection Graphs

SIAM Journal on Computing
Local approximation schemes for ad hoc and sensor networks

DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
The price of being near-sighted

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Energy conservation via domatic partitions

Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Impact of interference on multi-hop wireless network performance

Wireless Networks - Special issue: Selected papers from ACM MobiCom 2003
Approximability of identifying codes and locating--dominating codes

Information Processing Letters

Distributed Sleep Scheduling in Wireless Sensor Networks via Fractional Domatic Partitioning

SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Analysing local algorithms in location-aware quasi-unit-disk graphs

Discrete Applied Mathematics
Survey of local algorithms

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study fractional scheduling problems in sensor networks, in particular, sleep scheduling (generalisation of fractional domatic partition) and activity scheduling (generalisation of fractional graph colouring). The problems are hard to solve in general even in a centralised setting; however, we show that there are practically relevant families of graphs where these problems admit a local distributed approximation algorithm; in a local algorithm each node utilises information from its constant-size neighbourhood only. Our algorithm does not need the spatial coordinates of the nodes; it suffices that a subset of nodes is designated as markers during network deployment. Our algorithm can be applied in any marked graph satisfying certain bounds on the marker density; if the bounds are met, guaranteed near-optimal solutions can be found in constant time, space and communication per node.We also show that auxiliary information is necessary--no local algorithm can achieve a satisfactory approximation guarantee on unmarked graphs.