Routing and scheduling in multi-hop wireless networks

IEEE Vehicular Technology Conference

Volumn 58, Issue 5, 2003, Pages 3055-3059

  Puri, Anuj ^a   Varaiya, Pravin ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ROUTERS; SCHEDULING; TELECOMMUNICATION LINKS; TELECOMMUNICATION TRAFFIC; WIRELESS TELECOMMUNICATION SYSTEMS; WIRELESS NETWORKS;

NETWORK OPERATORS; TRAFFIC FLOW; WIRELESS LINKS; WIRELESS NETWORKS; MULTIHOP WIRELESS NETWORK; NETWORK OPERATOR; ROUTING AND SCHEDULING; WIRELESS LINK;

TELECOMMUNICATION NETWORKS; NETWORK ROUTING;

EID: 4143102341     PISSN: 07400551     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/vetecf.2003.1286185     Document Type: Conference Paper

References (7)

1. M.R. Garey and D.S. Johnson. Computers arid Intractability - a Guide to the theory of NP-Completeness. Freeman, San Francisco. 1979.
2. F. S. Hiller and G. J. Lieberman, Introduction to Operations Research, McGraw-Hill, 1990.
3. S. Khanna and K. Kumaran, On Wireless Spectrum Estimation and Generalized Graph Coloring, Infocom, 1998.
4. N. Kanale and P. E. Wright, Dynamic Global Packet Routing in Wireless Networks, Infocom. 1997.
5. C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization, Prentice-Hall, 1982.
6. L. Tassiulas and A. Ephremides, Stability Properties of Constrained Queueing Systems and Scheduling Policies for Maximum Throughput in Multihop Radio Networks. IEEE Transactions on Automatic Control, Dec. 1992.
7. Special Issue on Packet Radio Networks, IEEE Proc., Jan. 1987.