Optimal Design of Wireless Mesh Networks

Wireless Mesh Networks (WMNs) are cost-effective and provide an appealing answer to connectivity issues of ubiquitous computing. Unfortunately, wireless networks are known for strong waste of capacity when their size in- creases. Thus, a key challenge for network operators is to provide guaranteed quality of service. Maximizing network capacity requires to optimize jointly the gateways placement, the routing and the link scheduling taking interferences into account. We present MILP models for computing an optimal 802.11a or 802.16 WMN design providing max-min bandwidth guarantee.

[1]  Stéphane Pérennes,et al.  Hardness and approximation of gathering in static radio networks , 2006, Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06).

[2]  Hervé Rivano,et al.  Evaluation stochastique et simulation des réseaux radio , 2006 .

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

[4]  Bo Li,et al.  Joint routing and scheduling in multi-radio multi-channel multi-hop wireless networks , 2005, 2nd International Conference on Broadband Networks, 2005..

[5]  Raouf Boutaba,et al.  Gateway Placement Optimization in Wireless Mesh Networks With QoS Constraints , 2006, IEEE Journal on Selected Areas in Communications.

[6]  Murali Kodialam,et al.  On the Capacity Region of Multi-Radio Multi-Channel Wireless Mesh Networks , .

[7]  Leen Stougie,et al.  An approximation algorithm for the wireless gathering problem , 2008, Oper. Res. Lett..

[8]  Jian Tang,et al.  Link scheduling with power control for throughput enhancement in multihop wireless networks , 2006, IEEE Trans. Veh. Technol..

[9]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[10]  Robert Tappan Morris,et al.  Performance of multihop wireless networks: shortest path is not enough , 2003, CCRV.

[11]  Harish Viswanathan,et al.  Throughput-range tradeoff of wireless mesh backhaul networks , 2006, IEEE Journal on Selected Areas in Communications.

[12]  David B. Shmoys,et al.  Approximation algorithms for facility location problems , 2000, APPROX.

[13]  Chaitanya Swamy,et al.  LP-based approximation algorithms for capacitated facility location , 2004, Math. Program..

[14]  Ranveer Chandra,et al.  Optimizing the Placement of Integration Points in Multi-hop Wireless Networks , 2004 .

[15]  Hervé Rivano,et al.  Capacity Evaluation Framework and Validation of Self-Organized Routing Schemes , 2006, 2006 3rd Annual IEEE Communications Society on Sensor and Ad Hoc Communications and Networks.

[16]  O. Kariv,et al.  An Algorithmic Approach to Network Location Problems. I: The p-Centers , 1979 .

[17]  Ian F. Akyildiz,et al.  A survey on wireless mesh networks , 2005, IEEE Communications Magazine.

[18]  Jian Tang,et al.  Link scheduling with power control for throughput enhancement in multihop wireless networks , 2005, Second International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (QSHINE'05).

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

[20]  Lili Qiu,et al.  Impact of Interference on Multi-Hop Wireless Network Performance , 2003, MobiCom '03.

[21]  Aravind Srinivasan,et al.  Algorithmic aspects of capacity in wireless networks , 2005, SIGMETRICS '05.

[22]  Xiang-Yang Li,et al.  Efficient interference-aware TDMA link scheduling for static wireless networks , 2006, MobiCom '06.

[23]  O. Kariv,et al.  An Algorithmic Approach to Network Location Problems. II: The p-Medians , 1979 .

[24]  Chih-Shun Hsu,et al.  Scheduling of broadcasts in multihop wireless networks , 2003 .