This paper presents a novel algorithm for the gate瑆ay placement problem in Backbone Wireless Mesh Networks (BWMNs). Different from existing algorithms, the new algorithm incrementally identifies gateways and assigns mesh routers to identified gateways. The new algorithm can guarantee to find a feasible gateway placement satisfying Quality-of-Service (QoS) constraints, including delay constraint, relay load constraint and gateway capacity constraint. Experimental results show that its performance is as good as that of the best of existing algorithms for the gateway placement problem. But, the new algorithm can be used for BWMNs that do not form one connected component, and it is easy to implement and use.
References
[1]
B. Aoun, R. Boutaba, Y. Iraqi, and G. Kenward, “Gateway placement optimization in wireless mesh networks with QoS constraints,” IEEE Journal on Selected Areas in Communications, Vol. 24, No. 11, pp. 2127–2136, November 2006.
[2]
M. R. Garey and D. S. Johnson, “Computers and intractability; A guide to the theory of NP-completeness,” New York, NY, USA: W. H. Freeman & Co., 1990.
[3]
J. Wong, R. Jafari, and M. Potkonjak, “Gateway placement for latency and energy efficient data aggregation,” in Proceedings IEEE LCN, pp. 490–497, 2004.
[4]
Y. Bejerano, “Efficient integration of multihop wireless and wired networks with QoS constraints,” IEEE/ACM Transactions on Networking, Vol. 12, No. 6, pp. 1064–1078, December 2004.
[5]
R. Chandra, L. Qiu, K. Jain, and M. Mahdian, “Optimizing the placement of Internet TAPs in wireless neighborhood networks,” in Proceedings IEEE ICNP, pp. 271–282, 2004.
