Power Control and Maximum Flows of Wireless Lattice Networks

In this paper we investigate the power control problem associated with a special class of Wireless Mesh Networks, known as the Wireless Lattice Networks. These networks function mainly as backbone networks. A natural question for a network in such a class is to determine its maximum flow for a given an end-to-end traffic distribution. For a given set of self-interfering links, known as a web, the maximum flow is shown to be the solution of a nonlinear matrix equation. The maximum flow of the network can then be determined from the maximum flows of the webs it contains.

[1]  Jangeun Jun,et al.  The nominal capacity of wireless mesh networks , 2003, IEEE Wirel. Commun..

[2]  David Tse,et al.  Mobility increases the capacity of ad hoc wireless networks , 2002, TNET.

[3]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[4]  Massimo Franceschetti,et al.  Closing the gap in the capacity of random wireless networks , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[5]  Jitendra Padhye,et al.  Routing in multi-radio, multi-hop wireless mesh networks , 2004, MobiCom '04.

[6]  Robert Tappan Morris,et al.  Capacity of Ad Hoc wireless networks , 2001, MobiCom '01.

[7]  Farhad Shahrokhi,et al.  The maximum concurrent flow problem , 1990, JACM.

[8]  Murali S. Kodialam,et al.  Characterizing the capacity region in multi-radio multi-channel wireless mesh networks , 2005, MobiCom '05.

[9]  Jochen Könemann,et al.  Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems , 2007, SIAM J. Comput..

[10]  Gerard J. Foschini,et al.  A simple distributed autonomous power control algorithm and its convergence , 1993 .

[11]  Roy D. Yates,et al.  Integrated power control and base station assignment , 1995 .

[12]  Michael Gastpar,et al.  On the capacity of wireless networks: the relay case , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[13]  Stephen V. Hanly,et al.  An Algorithm for Combined Cell-Site Selection and Power Control to Maximize Cellular Spread Spectrum Capacity (Invited Paper) , 1995, IEEE J. Sel. Areas Commun..

[14]  E. Seneta.  Non-negative Matrices and Markov Chains , 2008 .

[15]  David Tse,et al.  Mobility increases the capacity of wireless adhoc networks , 2002 .

[16]  George Karakostas,et al.  Faster approximation schemes for fractional multicommodity flow problems , 2008, TALG.

[17]  Ian F. Akyildiz,et al.  Wireless mesh networks: a survey , 2005, Comput. Networks.

[18]  Jochen Könemann,et al.  Faster and simpler algorithms for multicommodity flow and other fractional packing problems , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[19]  Andrea J. Goldsmith,et al.  Capacity regions for wireless ad hoc networks , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[20]  Lang Tong,et al.  Stability and capacity of regular wireless networks , 2005, IEEE Transactions on Information Theory.

[21]  Norman B. Sigband,et al.  Book Reviews : Writing Communications in Business and Industry. Nelda R. Lawrence and Elizabeth Tebeaux, 3rd Edition, Prentice-Hall, Inc., Englewood Cliffs, New Jersey, 1982 , 1982 .

[22]  Tzi-cker Chiueh,et al.  Architecture and algorithms for an IEEE 802.11-based multi-channel wireless mesh network , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..