The distance-2 matching problem and its relationship to the MAC-layer capacity of ad hoc wireless networks

IEEE Journal on Selected Areas in Communications

Volumn 22, Issue 6, 2004, Pages 1069-1079

  Balakrishnan, Hari ^a   Barrett, Christopher L ^b   Kumar, V S Anil ^b   Marathe, Madhav V ^b   Thite, Shripad ^c  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b LOS ALAMOS NATIONAL LABORATORY   (United States)

^c University of Illinois at Urbana Champaign   (United States)

Author keywords

Approximation algorithms; Graph theory; Media access (MAC) protocols; Network capacity; Sensor networks; Wireless ad hoc networks

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; GRAPH THEORY; NETWORK PROTOCOLS; PROBLEM SOLVING; SENSORS; TRANSCEIVERS;

MEDIA ACCESS (MAC) PROTOCOLS; NETWORK CAPACITY; SENSOR NETWORKS; WIRELESS AD HOC NETWORKS;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 4344610803     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/JSAC.2004.830909     Document Type: Article

References (19)

1. H. Balakrishnan, C. Barrett, V. S. A. Kumar, M. Marathe, and S. Thite, "The distance-2 matching problem and its relationship to the MAC-layer capacity of ad hoc networks," Los Alamos Nat. Lab., Tech. Rep., Los Alamos, MM, 2003.
2. C. Barrett, V. S. A. Kumar, M. Marathe, and S. Thulasidasan, "Improving MAC Performance With Locality Information," Los Alamos Nat. Lab., Tech. Rep., Los Alamos, NM, 2003.
3. B. Chen, K. Jamieson, H. Balakrishnan, and R. Morris, "Span: An energy-efficient coordination algorithm for topology maintenance in ad hoc wireless networks," ACM Wireless Networks J., vol. 8, no. 5, Sept. 2002.
4. T. Erlebach, K. Jansen, and E. Seidel, "Polynomial-time approximation schemes for geometric graphs," in Proc. 12th Symp. Discrete Algorithms (SODA), 2001, pp. 671-679.
5. M. Golumbic and M. Lewenstein, "New results on induced matchings," Discrete Appl. Math., vol. 101, pp. 157-165, 2000.
6. P. Gupta and P. R. Kumar, "The capacity of wireless networks," IEEE Trans. Infom.Theory, vol. 46, pp. 388-404, Mar. 2000.
7. J. Hastad, "Clique is hard to approximate within n to the power 1-epsilon," Acta. Math., vol. 182, pp. 105-142, 1999.
8. H. B. Hunt in, 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. Algorithm, vol. 26, pp. 238-274, 1998.
9. V. S. A. Kumar, M. V. Marathe, S. Parthasarathy, and A. Srinivasan, "End-to-end packet scheduling in wireless ad hoc networks," presented at the ACM Symp. Discrete Algorithms, New Orleans, LA, 2004.
10. S. O. Krumke, M. V. Marathe, and S. S. Ravi, "Models and approximation algorithms for channel assignment in radio networks," Wireless Networks, vol. 7, pp. 575-584, 2001.
11. M. V. Marathe, H. Breu, H. B. Hunt III, S. S. Ravi, and D. J. Rosenkrantz, "Simple heuristics for unit disk graphs," Networks, vol. 25, pp. 59-68, 1995.
12. M. Mahdian, "The strong chromatic index of graphs," M.Sc. thesis, Dept. Comput. Sci., Univ. Toronto, Toronto, ON, Canada, 2000.
13. D. Peleg, "Distributed computing: A locality sensitive approach," in SIAM Monographs on Discrete Mathematics and Applications. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2000.
14. C. Peraki and S. D. Servetto, "On the maximum stable throughput problem in random networks with directional antennas," in Proc. ACM MobiHoc, 2003, pp. 76-87.
15. S. Ramanathan, "A unified framework and algorithm for (T/F/C) DMA channel assignment in wireless networks," in Proc. IEEE INFOCOM'97, Kobe, Japan, Apr. 1997, pp. 900-907.
16. C. Reidys, "Distance-2 matchings in random graphs," Ann. Combinatorics, 2004, to be published.
17. J. P. Schmidt, A. Siegel, and A. Srinivasan, "Chernoff-Hoeffding bounds for applications with limited independence," SIAM J. Discrete Math., vol. 8, no. 2, pp. 223-250, 1995.
18. L. Stockmeyer and V. Vazirani, "NP-completeness of some generalizations of the maximum matching problem," Inform. Process. Lett., vol. 15, no. 1, pp. 14-19, 1982.
19. Y. Xu, J. Heidemann, and D. Estrin, "Geography-informed energy conservation for ad hoc routing," in Proc. ACM MOBICOM, July 2001, pp. 70-84.