Simple approximation algorithms and PTASs for various problems in wireless ad hoc networks

Journal of Parallel and Distributed Computing

Volumn 66, Issue 4, 2006, Pages 515-530

  Li, Xiang Yang ^a,c,d   Wang, Yu ^b,c,d,e  

^a Illinois Institute of Technology   (United States)

^b University of North Carolina at Charlotte   (United States)

^c ACM   (United States)

^d IEEE   (United States)

^e University of North Carolina ^*  (United States)

Author keywords

Disk graphs; Independent set; PTAS; Vertex coloring; Vertex cover; Wireless ad hoc networks

Indexed keywords

INDEPENDENT SET; PTAS; VERTEX COLORING; VERTEX COVER;

GRAPH THEORY; MATHEMATICAL MODELS; PROBABILITY; SIGNAL TO NOISE RATIO; TELECOMMUNICATION NETWORKS;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 33644880828     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jpdc.2005.10.007     Document Type: Article

References (53)

1. K. Alzoubi, X.-Y. Li, Y. Wang, P.-J. Wan, and O. Frieder Geometric spanners for wireless ad hoc networks IEEE Trans. on Parallel Distrib. Process. 14 4 2003 408 421 (short version in IEEE ICDCS 2002)
2. K.M. Alzoubi, P.-J. Wan, and O. Frieder New distributed algorithm for connected dominating set in wireless ad hoc networks Proceedings of IEEE HICSS 2002
3. A.D. Amis, and R. Prakash Load-balancing clusters in wireless ad hoc networks Proceedings of the Third IEEE Symposium on Application-Specific Systems and Software Engineering Technology (ASSET'00) 2000 25
4. S. Basagni Distributed clustering for ad hoc networks Proceedings of the IEEE International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN) 1999 310 315
5. S. Basagni Finding a maximal weighted independent set in wireless networks Telecommunication Systems, Mobile Comput. Wireless Networks 18 1/3 2001 155 168 (special issue)
6. C. Bettstetter, and R. Krausser Scenario-based stability analysis of the distributed mobility-adaptive clustering (DMAC) algorithm Proceedings of the Second ACM International Symposium on Mobile Ad Hoc Networking & Computing 2001
7. H. Breu, and D.G. Kirkpatrick Unit disk graph recognition is NP-hard Comput. Geom. Theory Appl. 9 1-2 1998 3 24
8. T. Chan, Polynomial-time approximation schemes for packing and piercing fat objects, 2001, J. Algorithms, submitted for publication.
9. M. Chatterjee, S.K. Das, and D. Turgut A weight based distributed clustering algorithm for mobile ad hoc networks Proceedings of Seventh International Conference on High Performance Computing (HiPC) 2000 511 521
10. M. Chatterjee, S. Das, and D. Turgut WCA A weighted clustering algorithm for mobile ad hoc networks J. Cluster Comput. 5 2 2002 193 204
11. X. Cheng, X. Huang, D. Li, and D.-Z. Du Polynomial-time approximation scheme for minimum connected dominating set in ad hoc wireless networks Networks 42 4 2003 202 208
12. X. Cheng, B. Narahari, R. Simha, M.X. Cheng, D. Liu, Strong minimum energy topology in wireless sensor networks: NP-completeness and heuristics, IEEE Trans. Mobile Comput. 2(3).
13. B. Clark, C. Colbourn, and D. Johnson Unit disk graphs Discrete Math. 86 1990 165 177
14. B. Das, and V. Bharghavan Routing in ad-hoc networks using minimum connected dominating sets Proceedings of IEEE International Conference on Communications (ICC'97) vol. 1 1997 376 380
15. O. Egecioglu, and T. Gonzalez Minimum-energy broadcast in simple graphs with limited node power Proceedings of IASTED International Conference on Parallel and Distributed Computing and Systems 2001 334 338
16. T. Erlebach, K. Jansen, and E. Seidel Polynomial-time approximation schemes for geometric graphs Proceedings of Annual Symposium on Discrete algorithms 2001
17. M.C. Golumbic Algorithmic Graph Theory and Perfect Graphs 1980 Academic Press New York
18. I. Harry, B. Hunt, M.V. Marathe, V. Radhakrishnan, S.S. Ravi, D.J. Rosenkrantz, and R.E. Stearns NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs J. Algorithms 26 2 1998 238 274
19. D.S. Hochbaum Efficient bounds for the stable set, vertex cover, and set packing problems Discrete Appl. Math. 6 1983 243 254
20. D.S. Hochbaum, and W. Maass Approximation schemes for covering and packing problems in image processing and vlsi J. Assoc. Comput. Mach. 32 1985 130 136
21. O. Kachirski, and R. Guha Intrusion detection using mobile agents in wireless ad hoc networks Proceedings of IEEE Workshop on Knowledge Media Networking 2002
22. J.M. Keil, D. Schaefer, An optimal algorithm for finding dominating cycles in circular-arc graphs, Discrete Appl. Math. (1992) 25-34.
23. U.C. Kozat, G. Kondylis, B. Ryu, and M. Marina Virtual dynamic backbone for mobile ad hoc networks Proceedings of IEEE ICC 2001 2001
24. V.S.A. Kumar, M.V. Marathe, S. Parthasarathy, and A. Srinivasan End-to-end packet-scheduling in wireless ad-hoc networks SODA '04: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms 2004
25. J. Li, C. Blake, D.S.J. De Couto, H.I. Lee, and R. Morris Capacity of ad hoc wireless networks Proceedings of the Seventh Annual International Conference on Mobile Computing and Networking 2001
26. X.-Y. Li, and Y. Wang Simple heuristics and PTASs for intersection graphs in wireless ad hoc networks Proceedings of ACM Sixth International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIALM2002) 2002
27. B. Liang, and Z.J. Haas Virtual backbone generation and maintenance in ad hoc network mobility management Proceedings of Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM) 2000
28. H. Liu, and R. Gupta Selective backbone construction for topology control Proceedings of IEEE International Conference on Mobile Ad-hoc and Sensor Systems 2004
29. M.V. Marathe, H. Breu, H.B. Hunt III, S.S. Ravi, and D.J. Rosenkrantz Simple heuristics for unit disk graphs Networks 25 1995 59 68
30. T.A. McKee, F.R. McMorris, Topics in Intersection Graph Theory, Monographs on Discrete Mathematics and Applications, vol. 2, SIAM, Philadelphia, PA, 1999.
31. M. Min, F. Wang, D.-Z. Du, and P.M. Pardalos A reliable virtual backbone scheme in mobile ad-hoc networks Proceedings of IEEE International Conference on Mobile Ad-hoc and Sensor Systems 2004
32. R. Negi, and A. Rajeswaran Physical layer effect on mac performance in ad-hoc wireless networks Proceedings of Communication, Internet and Information Technology (CIIT 2003) 2003
33. S. Parthasarathy, and R. Gandhi Distributed algorithms for coloring and domination in wireless ad hoc networks Proceedings of Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS'04) 2004
34. F. Roberts Graph Theory and Its Applications to Problems of Society 1978 SIAM Press Philadelphia, PA
35. S. Sen, D.F. Towsley, Z.-L. Zhang, and J.K. Dey Optimal multicast smoothing of streaming video over an internetwork Proceedings of IEEE INFOCOM 1999
36. R. Sivakumar, B. Das, and V. Bharghavan The clade vertebrata spines and routing in ad hoc networks Proceedings of IEEE Symposium on Computers and Communications (ISCC98) Athens, Greece 1998
37. I. Stojmenovic, M. Seddigh, and J. Zunic Dominating sets and neighbor elimination based broadcasting algorithms in wireless networks IEEE Trans. on Parallel Distrib. Systems 13 1 2002 14 25
38. G. Szekeres, and H. Wilf An inequality for the chromatic number of a graph J. Combin. Theory 4 1968 1 3
39. H. Tamura, K. Watanabe, M. Sengoku, and S. Sengoku Graph theoretical considerations of a channel assignment problem on multihop wireless networks Proceedings of International Technical Conference On Circuits/Systems, Computers and Communications 2002
40. T.-C. Tsai, C.-M. Tu, An adaptive IEEE 802.11 MAC in multihop wireless ad hoc networks considering large interference range, in: Proceedings of Conference on Wireless On-Demand Network Systems (WONS2004), Lecture Notes on Computer Science, vol. 2928, 2004.
41. Y.-H. Tseng, E.H. Kuang Wuy, and G.-H. Chen Maximum traffic scheduling and capacity analysis for IEEE 802.15.3 high data rate mac protocol Proceedings of IEEE Semiannual Vehicular Technology Conference (VTC Fall 2003) 2003
42. P.-J. Wan, X.-Y. Li, and O. Frieder OVSF-CDMA Code Assignment in Wireless Ad Hoc Networks Proceedings of ACM International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications 2004
43. Y. Wang, and X.-Y. Li Geometric spanners for wireless ad hoc networks Proceedings of 22nd IEEE International Conference on Distributed Computing Systems (ICDCS) 2002
44. Y. Wang, W. Wang, and X.-Y. Li Efficient distributed low-cost backbone formation for wireless networks ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc) 2005
45. T.P. William Three-dimensional geometry and topology, The Geometry Center 1991 University of Minnesota Minneapolis, MN
46. J. Wu, F. Dai, M. Gao, and I. Stojmenovic On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networks IEEE/KICS J. Commun. Networks 4 1 2002 59 70
47. J. Wu, and H. Li A dominating-set-based routing scheme in ad hoc wireless networks Wireless Networks in the Telecommunication Systems Journal 3 2001 63 84 (special issue)
48. X. Wu, C. Yuen, Y. Gao, H. Wu, and B. Li Fair scheduling with bottleneck consideration in wireless ad-hoc networks Proceedings of IEEE International Conference on Computer Communications and Networks (ICCCN 2001) 2001
49. Y. Wu, Q. Zhang, W. Zhu, and S.-Y. Kung Bounding the power rate function of wireless ad hoc networks Proceedings of IEEE INFOCOM 2005
50. K. Xu, M. Gerla, and S. Bae How effective is the IEEE 802.11 RTS/CTS handshake in ad hoc networks? Proceedings of IEEE Global Telecommunications Conference 2002
51. S. Xu, and T. Saadawi Does the IEEE 802.11 MAC protocol work well in multihop wireless ad hoc networks? IEEE Comm. Mag. 39 6 2001 130 137
52. R. Zheng, G. He, I. Gupta, and L. Sha Time idexing in sensor networks Proceedings of IEEE International Conference on Mobile Ad-hoc and Sensor Systems 2004
53. R. Zheng, J.C. Hou, and L. Sha Asynchronous wakeup for ad hoc networks MobiHoc '03: Proceedings of the Fourth ACM International Symposium on Mobile Ad hoc Networking & Computing ACM Press, New York 2003 35 45