The placement of mesh routers in a mobile mesh network strongly influences the network performance. In particular, when the mesh clients are mobile, this deployment issue becomes more difficult to solve since mesh routers should adapt their locations to the dynamic network topology. In this letter, we propose to apply a simulated annealing algorithm to deal with the dynamic router node placement issue. The performance metrics considered when deploying these routers are: client coverage, network connectivity, and the average distance traveled by routers. Simulation results show a significant performance improvement in terms of client coverage and network connectivity and a considerable decrease in router movements.
KEYWORDSdynamic router node placement, router deployment, simulated annealing algorithm, wireless mesh network 1 How to cite this article: Sayad L, Bouallouche-Medjkoune L, Aissani D. A simulated annealing algorithm for the placement of dynamic mesh routers in a wireless mesh network with mobile clients. Internet Technology Letters 2018;1:e35. https://doi.
This paper tackles the routing issue in mobile ad hoc networks by introducing a novel approach. The most challenging issue, when designing a routing protocol in this context, is the mobility of nodes, which engenders frequent links breakage. Therefore, most of research effort in this field should be conducted in this sense so that routing protocol will not be affected by route failures caused by link disconnections. The proposed routing protocol, called on-demand routing protocol with tabu search based local route repair, uses an intelligent technique to locally repair the failed routes. The idea is to connect the two parts of the failed route using minimum overhead and without generating loops. Hence, when a route is failed, a special packet containing a tabu list of upstream nodes (nodes of the first part the route) is launched with a minimum time-to-leave value. The motivation on using a local route repair approach rather than a new route discovery process is to save delay and to reduce control packet overhead, which leads to less network contention and less packets drop. However, this technique can lead longer routes between nodes, consequently, network performances will be worsened. To avoid this kind of situation, destination node invalidates the route when the number of repairs overtakes a given limit. Simulation results demonstrate that our proposed protocol achieves better in terms of communication delay, packet delivery ratio and control packet overhead than existing AODV-BFABL, DSR and AOMDV.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.