Gateways Placement in Backbone Wireless Mesh Networks

Abstract

This paper presents a novel algorithm for the gatew ay placement problem in Backbone Wireless Mesh Networks (BWMNs). Different from existing algorithm s, the new algorithm incrementally identifies gateways and assigns mesh routers to identified gate ways. The new algorithm can guarantee to find a feas ible gateway placement satisfying Quality-of-Service (Qo S) constraints, including delay constraint, relay l oad constraint and gateway capacity constraint. Experim ental 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 us ed for BWMNs that do not form one connected component, and it is easy to implement and use.