Optimizing traffic flow in fixed wireless networks

We consider the problem of optimizing traffic flow in a fixed network of wired and wireless links where some wireless links interfere with each other. The objective of the network operator is to maximize the total amount of traffic carried. We present algorithms for computing traffic flow in in a mixed wired-wireless network to meet demand and maximize the total traffic carried.

[1]  Sanjeev Khanna,et al.  On wireless spectrum estimation and generalized graph coloring , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[2]  Frederick S. Hillier,et al.  Introduction of Operations Research , 1967 .

[3]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1990, 29th IEEE Conference on Decision and Control.

[4]  Nabil Kahale,et al.  Dynamic global packet routing in wireless networks , 1997, Proceedings of INFOCOM '97.

[5]  William J. Cook,et al.  Combinatorial optimization , 1997 .

[6]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[7]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[8]  Frederick S. Hillier,et al.  Introduction of Operations Research , 1967 .