Abstract
This paper presents a novel algorithm for the gateway 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.
Highlights
A wireless mesh network is an ad hoc communication network that is made up of wireless communication nodes organized in a mesh topology
A Backbone Wireless Mesh Networks (BWMNs) consists of a collection of wireless mesh routers, each of which can communicate with other wireless mesh routers and clients
Compared with existing algorithms for the gateway placement problem, the new algorithm has the following advantages: first, it guarantees to find a gateway placement satisfying all the constraints; second, it has competitive performance; third, it can be used for the BWMNs that does not form a connected component; fourth, it is easy to implement and use
Summary
A wireless mesh network is an ad hoc communication network that is made up of wireless communication nodes organized in a mesh topology It allows for continuous connections and reconfiguration around broken or blocked paths by hopping from node to node until the destination is reached. In a wireless mesh network communication nodes can connect to each other via multiple hops and they are not mobile. The clients connect to the wireless network through a wireless mesh router and they do not have restriction on mobility. The delay is a function of the number of communication hops between the mesh router and its gateway [1]. This paper presents a new algorithm, namely incremental clustering algorithm, for the gateway placement problem.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Communications, Network and System Sciences
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
