Multiflows in multihop wireless networks

Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)

Volumn , Issue , 2009, Pages 85-94

  Wan, Peng Jun ^a  

^a Illinois Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION RATIOS; DESIGN AND ANALYSIS; INTERFERENCE CONSTRAINTS; MAXIMUM CONCURRENT FLOW; MULTI-COMMODITY FLOW; MULTIHOP WIRELESS NETWORK; NP-HARDNESS; POLYNOMIAL TIME APPROXIMATION SCHEMES; RUNNING TIME; UNIFIED FRAMEWORK;

AD HOC NETWORKS; COMPUTER SCIENCE; HARDNESS; MOBILE AD HOC NETWORKS; POLYNOMIAL APPROXIMATION; TELECOMMUNICATION NETWORKS; WIRELESS NETWORKS;

APPROXIMATION ALGORITHMS;

EID: 70450159048     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1530748.1530761     Document Type: Conference Paper

References (21)

1. M. Alicherry, R. Bhatia, and L. E. Li, Joint Channel Assignment and Routing for Throughput Optimization in Multiradio Wireless Mesh Networks, IEEE JSAC 24(11):1960-1971 (2006). Also appeared in Proc. of ACM MobiCom 2005.
2. H. Balakrishnan, C. L. Barrett, V. S. A. Kumar, M. V. Marathe, and S. Thite, The distance-2 matching problem and its relationship to the MAC-Layer capacity of ad hoc wireless networks, IEEE JSAC 22(6): 1069-1079 (2004).
3. C. Buragohain, S. Suri, C. D. Toth, and Y. Zhou, Improved Throughput Bounds for Interference-Aware Routing in Wireless Networks, Proc. COCOON2007, LNCS 4598, Springer, pp. 210-221.
4. B. Carr and S. Vempala, Randomized meta-rounding, Proc. of ACM STOC2000.
5. T. Erlebach, K. Jansen, E. Seidel, Polynomial-time approximation schemes for geometric graphs, SIAM Journal on Computing 34 (6) (2005) 1302-1323. Also appeared in Proc. of ACM-SIAM SODA 2001, pp. 671-679.
6. M. Grötschel, L. Lovász, and A. Schrijver, The ellipsoid method and its consequences in combinatorial optimization, Combinatorica1 (1981) 169-197.
7. D. S. Hochbaum, and W. Maass, Approximation schemes for covering and packing problems in image processing and VLSI, Journal of the ACM32 (1) (1985) 130-136.
8. H. B. Hunt III, 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, Journal of Algorithms26 (2) (1998) 238-274.
9. K. Jain, M. Mahdian, and M. R. Salavatipour, Packing Steiner trees, Proceedings of ACM-SIAM SODA2003, pp.266-274.
10. K. Jain, J. Padhye, V. N. Padmanabhan, and L. Qiu, Impact of interference on multi-hop wireless network performance, ACM/Springer Wireless Networks11:471-487, 2005. Also appeared in Proc. of ACM MobiCom 2003.
11. K. Jansen, Approximate strong separation with application in fractional graph coloring and preemptive scheduling, Theoretical Computer Science302 (1-3) (2003) 239-256.
12. N. Karmarkar, R. M. Karp, An efficient approximation scheme for the one-dimensional bin-packing problem, Proc. of IEEE FOCS1982, pp. 206-213.
13. M. Kodialam and T. Nandagopal, Characterizing achievable rates in multi-hop wireless networks: the joint routing and scheduling problem, Proc. of ACM MobiCom2003.
14. M. Kodialam and T. Nandagopal. Characterizing the capacity region in multi-radio multi-channel wireless mesh networks, Proc. of ACM MobiCom2005.
15. V. S. A. Kumar, M. V. Marathe, S. Parthasarathy, and A. Srinivasan, Algorithmic aspects of capacity in wireless networks, SIGMETRICS Perform. Eval. Rev.33(1):133-144, 2005.
16. T. Matsui, Approximation algorithms for maximum independent set problems and fractional coloring problems on unit disk graphs, JCDCG 1998, LNCS 1763, Springer, pp. 194-200.
17. T. Nieberg, J. Hurink, and W. Kern, A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs, Proc. WG 2004, LNCS 3353, Springer, pp. 214-221.
18. Z. Nutov, I. Beniaminy, and R. Yuster, A (1-1/e)-approximation algorithm for the generalized assignment problem. Oper. Res. Lett.34(3): 283-288 (2006).
19. E. J. van Leeuwen, Better Approximation Schemes for Disk Graphs, Proc. SWAT2006, LNCS 4059, Springer, pp. 316-327.
20. D. Wang and Y.-S. Kuo, A study on two geometric location problems, Information Processing Letters, 28:281-286, 1988.
21. Y. Wang, W. Wang, X.-Y. Li, and W.-Z. Song, Interference-Aware Joint Routing and TDMA Link Scheduling for Static Wireless Networks, IEEE TPDS 19(12): 1709-1726, Dec. 2008. An early version appeared in Proc. of ACM MobiCom 2006.