Local approximation algorithms for scheduling problems in sensor networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4837 LNCS, Issue , 2008, Pages 99-113

  Floréen, Patrik ^a   Kaski, Petteri ^a   Musto, Topi ^a   Suomela, Jukka ^a  

^a UNIVERSITY OF HELSINKI   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY; HYBRID SENSORS; POLYNOMIAL APPROXIMATION; SCHEDULING; SCHEDULING ALGORITHMS; SENSOR NETWORKS; SENSORS; WIRELESS SENSOR NETWORKS;

ACTIVITY SCHEDULING; ALGORITHMIC ASPECTS; AUXILIARY INFORMATION; CONSTANT TIME; DISTRIBUTED APPROXIMATION ALGORITHM; GRAPH COLOURING; LOCAL APPROXIMATION ALGORITHMS; MARKED GRAPHS; NEAR-OPTIMAL SOLUTIONS; NEIGHBOURHOOD; NETWORK DEPLOYMENT; OF GRAPHS; SCHEDULING PROBLEMS; SLEEP SCHEDULING; SPATIAL COORDINATES;

APPROXIMATION ALGORITHMS;

EID: 49949104304     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-77871-4_10     Document Type: Conference Paper

References (19)

1. Naor, M., Stockmeyer, L.: What can be computed locally? SIAM Journal on Computing 24(6), 1259-1277 (1995)
2. Cardei, M., MacCallum, D., Cheng, M.X., Min, M., Jia, X., Li, D., Du, D.Z.: Wireless sensor networks with energy efficient organization. Journal of Interconnection Networks 3(3-4), 213-229 (2002)
3. Floreen, P., Kaski, P., Suomela, J.: A distributed approximation scheme for sleep scheduling in sensor networks. In: SECON 2007. Proc. 4th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, San Diego, CA, June 2007, pp. 152-161. IEEE, Piscataway (2007)
4. Koushanfar, F., Taft, N., Potkonjak, M.: Sleeping coordination for comprehensive sensing using isotonic regression and domatic partitions. In: Proc. 25th Conference on Computer Communications (INFOCOM, Barcelona, April 2006), IEEE, Piscataway, NJ (2006)
5. Moscibroda, T., Wattenhofer, R.: Maximizing the lifetime of dominating sets. In: IPDPS 2005. Proc. 19th IEEE International Parallel and Distributed Processing Symposium, Denver, CO, IEEE Computer Society Press, Los AIamitos (2005)
6. Pemmaraju, S.V., Pirwani, I.A.: Energy conservation via, domatic partitions. In: MobiHoc 2006. Proc. 7th ACM International Symposium on Mobile Ad Hoc Networking and Computing, Florence, pp. 143-154. ACM Press, New York (2006)
7. Jain, K., Padhye, J., Padmanabhan, V.N., Qiu, L.: Impact of interference on multihop wireless network performance. Wireless Networks 11(4), 471-487 (2005)
8. Feige, U., Halldorsson, M.M., Kortsarz, G., Srinivasan, A.: Approximating the domatic number. SIAM Journal on Computing 32(1), 172-195 (2002)
9. Lund, C., Yannakakis, M.: On the hardness of approximating minimization problems. Journal of the ACM 41(5), 960-981 (1994)
10. Suomela, J.: Locality helps sleep scheduling. In: WSW 2006. Working Notes of the Workshop on World-Sensor-Web: Mobile Device-Centric Sensory Networks and Applications, Boulder, CO, October 2006, pp. 41-44 (2006), http://www. sensorplanet.org/wsw2006/
11. Linial, N.: Locality in distributed graph algorithms. SIAM Journal on Computing 21(1), 193-201 (1992)
12. Kuhn, F., Moscibroda, T., Wattenhofer, R.: The price of being near-sighted. In: SODA 2006. Proc. 17th Annual ACM-SIAM Symposium on Discrete Algorithm, Miami, FL, January 2006, pp. 980-989. ACM Press, New York (2006)
13. Hochbaum, D.S., Maass, W.: Approximation schemes for covering and packing problems in image processing and VLSI. Journal of the ACM 32(1), 130-136 (1985)
14. Erlebach, T., Jansen, K., Seidel, E.: Polynomial-time approximation schemes for geometric intersection graphs. SIAM Journal on Computing 34(6), 1302-1323 (2005)
15. Hunt III, H.B., Marathe, M.V., Radhakrishnan, V., Ravi, S.S., Rosenkrantz, D.J., Stearns, R.E.: NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs. Journal of Algorithms 26(2), 238-274 (1998)
16. Jiang, T., Wang, L.: An approximation scheme for some Steiner tree problems in the plane. In: Du, D.-Z., Zhang, X.-S. (eds.) ISAAC 1994. LNCS, vol. 834, pp. 414-422. Springer, Heidelberg (1994)
17. Suomela, J.: Approximability of identifying codes and locating-dominating codes. Information Processing Letters 103(1), 28-33 (2007)
18. Kuhn, F., Nieberg, T., Moscibroda, T., Wattenhofer, R.: Local approximation schemes for ad hoc and sensor networks. In: DIALM-POMC 2005. Proc. Joint Workshop on Foundations of Mobile Computing, Cologne, September 2005, pp. 97-103. ACM Press, New York (2005)
19. Ghys, É.: Les groupes hyperboliques. Astérisque 189-190, 203-238 (1990), [Séminaire Bourbaki, vol. 1989/90, Exp. No. 722]