Wireless communication graphs

Proceedings of the 2004 Intelligent Sensors, Sensor Networks and Information Processing Conference, ISSNIP '04

Volumn , Issue , 2004, Pages 367-372

  Nieberg, Tim ^a   Hurink, Johann ^a  

^a UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

AD-HOC NETWORKS; DISK GRAPHS; GRAPH MODELS; LOCALIZATION;

ALGORITHMS; APPROXIMATION THEORY; GRAPH THEORY; MATHEMATICAL MODELS; PROBLEM SOLVING; SET THEORY;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 28844447438     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (24)

1. A.D. Amis, R. Prakash, "Load-balancing clusters in wireless ad hoc networks", In: Proc. 3rd IEEE Symp. on Application-Specific Systems and Software Engineering Technologies, 2000, pp. 25-32.
2. S. Basagni, "Finding a maximal weighted independent set in wireless networks", Telecommunication Systems, Vol. 18, 2001, pp. 155-168.
3. R. Boppana, M.M. Halldorsson, "Approximating maximum independent sets by excluding subgraphs", Bit, Vol. 32, 1992, pp. 180-196.
4. H. Breu, D. Kirkpatrick, "Unit disk graph recognition is NP-hard", Computational Geometry: Theory and Applications, Vol. 9, No. 1-2, 1998, pp. 3-24.
5. C.C. Chang, M. Gerla, "Routing and multicasting in multihop, mobile wireless networks", In: IEEE Int. Conf., on Universal Personal Communication, 1997, pp. 546-551.
6. B.N. Clark, C.J. Colbourn, D.D. Johnson, "Unit disk graphs", Discrete Math., Vol. 86, No. 1-3, 1990, pp. 499-514.
7. B. Das, V. Bharghavan, "Routing in ad hoc networks using minimum connected dominating sets". In: ICC '97, Montreal, Canada, 1997, pp. 376-380.
8. Energy-Efficient Sensor Networks (EYES), website: http://eyes.eu.org.
9. M. Gerla, J. Tsai, "Multicluster, mobile, multimedia radio networks", ACM/Baltzer Journal of Wireless Networks, Vol. 1, 1995, pp. 255-265.
10. 1-ε", Acta Mathematica, Vol. 182, 1999, pp. 105-142.
11. D.S. Hochbaum, "Efficient bounds for the stable set, vertex cover, and set packing problems", Discrete Applied Mathematics, No. 6, 1983, pp. 243-254.
12. L. van Hoesel, T. Nieberg, H.J. Kip, P. Havinga, "Advantages of a TDMA based, energy-efficient, self-organizing MAC protocol for WSNs", In: IEEE Semiannual Vehicular Technology Conference (VTC2004-Spring), Milan, Italy, 2004.
13. D.S. Johnson, "Approximation algorithms for combinatorial problems", J. Comput. System Sci., Vol. 9, 1974, pp. 256-278.
14. D.B. Johnson, D.A. Maltz, "Dynamic source routing in ad hoc wireless networks", Mobile Computing, Vol. 353, 1996.
15. F. Kuhn, T. Moscibroda, R. Wattenhofer, "Unit Disk Graph Approximation", In: Proc. ACM DIALM-POMC Joint Workshop on Foundations of Distributed Computing, Philadelphia, USA, 2004.
16. F. Kuhn, R. Wattenhofer, A. Zollinger, "Ad-Hoc networks beyond unit disk graphs", In: Proc. Ist ACM DIALM-POMC Joint Workshop on Foundations of Distributed Computing, San Diego, USA, 2003.
17. M.V. Marathe, H. Breu, H.B. Hunt III, S.S. Ravi, D.J. Rosenkrantz, "Simple heuristics for unit disk graphs", Networks, Vol. 25, 1995, pp. 59-68.
18. S.Y. Ni, Y.C. Tseng, Y.S. Chen, J.P. Sheu, "The broadcast storm problem in a mobile, ad hoc network", In: Proc. MOBICOM, Seattle, USA, 1999, pp. 151-162.
19. T. Nieberg, J.L. Hurink, "A PTAS for the minimum dominating set problem in unit disk graphs", Memorandum, Universiteit Twente, 2004.
20. T. Nieberg, J.L. Hurink, W. Kern, "A robust PTAS for maximum independent sets in unit disk graphs". In: Proc. 30th International Workshop on Graph-Theoretic Concepts in Computer Science, Bad Honnef, Germany, 2004.
21. C.E. Perkins, E.M. Royer, "Ad hoc on-demand distance vector routing", In: Proc. 2nd IEEE Workshop on Mobile Computing Systems and Applications, New Orleans, USA, 1990, pp. 90-100.
22. R. Raz, S. Safra, "A sub-constant error-probability low-degree test, and sub-constant error-probability PCP characterization of NP", In: Proc. 29th Ann. ACM Symp. on Theory of Comp., ACM. 1997, pp. 475-484.
23. R. Sivakumar, P. Sinha, V. Bharghavan, "CEDAR: A core-extraction distributed ad hoc routing algorithm", IEEE Journal on Selected Areas in Communication, Vol. 17, 1999, pp. 1454-1465.
24. P. Su, R.L. Drysdale III, "A comparison of sequential delaunay triangulation algorithms", In: Proc. Symp. on Computational Geometry, 1995, pp. 61-70.