Abstract
When determining the location of candidate wireless mesh routers, it is easy to ensure whether each mesh client node is within the communication range of candidate routers, but it is difficult to ensure that selected mesh routers from the candidate routers can constitute a connected network. In addition, the locations of the candidate router can also be placed too much, but too many candidate routers will affect the performance of network. According to the existing problem, we propose that all user terminals must be within at least one wireless router's coverage, and the least mesh routers to cover all of the user's terminals. Therefore, the selected mesh routers connected with each other, but usually the candidate routers only form several local connected sub-nets without connecting with each other. So making the local connective network communicating with each other is a subsequent work. Using the method of combining the genetic algorithm and the minimum spanning tree algorithm, the problem that candidate mesh routers can construct a general connected network was solved and the least selected wireless Mesh routers connected with each other and all mesh clients are covered. The feasibility and practicability of the proposed method are verified by MATLAB simulation.
Sign-in/Register to access full text options 
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 Internet Protocol Technology
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.
