Characterizing Achievable Rates in Multi-hop Wireless Networks: The Joint Routing and Scheduling Problem

Proceedings of the Annual International Conference on Mobile Computing and Networking, MOBICOM

Volumn , Issue , 2003, Pages 42-54

  Kodialam, Murali ^a   Nandagopal, Thyaga ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

Graph Coloring; Optimization; Routing; Scheduling; Wireless Networks

Indexed keywords

ANTENNAS; CHANNEL CAPACITY; GRAPH THEORY; MATHEMATICAL MODELS; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING; ROUTERS; SCHEDULING; VECTORS; WIRELESS TELECOMMUNICATION SYSTEMS;

GRAPH COLORING; ROUTING; WIRELESS NETWORKS;

TELECOMMUNICATION NETWORKS;

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

References (17)

1. Baker, D.J., Wieselthier, J.E., and Ephremides, A., "A Distributed Algorithm for Scheduling the Activation of Links in a Self-Organizing Mobile Radio Networks", IEEE Int. Conference Communications, 1982, pp. 2F6.1-2F6.5.
2. Hajek, B., and Sasaki, G., "Link Scheduling in Polynomial Time", IEEE Transactions on Information Theory, 34(5), pp. 910-917, 1988.
3. Gupta, P., and Kumar, P.R., "The Capacity of Wireless Networks", IEEE Transactions on Information Theory, 46(2), pp. 388-404, 2000.
4. Ahuja, R.K., Magnanti, T.L., Orlin, J.B., "Network Flows: Theory, Algorithms, and Applications", Prentice Hall, 1993.
5. Grotschel, M., Lovasz, L., and Schrijver, A., "The Ellipsoid Method and its Consequences in Combinatorial Optimization", Combinatorica, 1(2), pp. 169-197, 1981.
6. Post, M.J, Kershenbaum, A.S. and Sarachik, P.E., "Scheduling Multi-hop CDMA Networks in the Presence of Secondary Conflicts", Algorithmica, 1989, pp. 365-393.
7. Wieselthier, J.E., Barnhart, C.M., and Ephremides, A., "A Neural Network Approach to Routing Without Interference in Multi-hop Networks", IEEE Transactions on Communications, 1994.
8. Jain, K., Padhye, J., Padmanabhan, V., and Qiu, L., "Impact on Interference on Multi-hop Wireless Network Performance", ACM Mobicom'03, September 2003.
9. Shahrokhi, F., and Matula, D., "The Maximum Concurrent Flow Problem", Journal of the ACM, 37, pp. 318-334, 1990.
10. Garg, N., and Könemann, J., "Faster and Simpler Algorithms for Multi-commodity Flow and other Fractional Packing Problems", Proceedings of the 39th Annual Symposium on Foundations of Computer Science, pp.300-309, 1998.
11. Karakostas, G., "Faster Approximation Schemes for Fractional Multi-commodity Flow Problems", 13th ACM/SIAM Symposium on Discrete Algorithms, pp. 166-173, 2002.
12. Shannon, C.E., "A Theorem on Coloring the Lines of a Network", J. of Math. Physics, 28, pp. 148-151, 1949.
13. Nishizeki, T., and Kashiwagi, K., "On the 1.1 Edge-Coloring of Multi-graphs", SIAM Journal of Discrete Math., 3(3), pp. 391-410, 1990.
14. Ramanathan, S., "A Unified Framework and Algorithm for (T/F/C)DMA Channel Assignment in Wireless Networks", IEEE Int. Conference on Communications, 1991, pp. 7d.2.1-7d.2.8
15. Kodialam, M., and Nandagopal, T., "The Effect of Interference on the Capacity of Multi-hop Wireless Networks", Bell Labs Technical Report, Lucent Technologies, July 2003.
16. Barrett, C., Istrate, G., Anil Kumar, V.S., Marathe, M., and Thite, S., "Approximation Algorithms for Distance-2 Edge Coloring", Unpublished Document, 2002.
17. Suurballe, J.W., and Tarjan, R.E., "A Quick Method for Finding Shortest Pairs of Disjoint Paths", Networks, 14, pp. 325-336, 1984.