Optimal placement of mesh routers in a wireless mesh network with mobile mesh clients using simulated annealing

Lamri Sayad
{"title":"Optimal placement of mesh routers in a wireless mesh network with mobile mesh clients using simulated annealing","authors":"Lamri Sayad","doi":"10.1109/ISCBI.2017.8053542","DOIUrl":null,"url":null,"abstract":"A wireless mesh network (WMN) is a set of three kinds of nodes: clients, routers and gateways. One of the most challenging issues when dealing with a WMN is how to deploy mesh routers when the positions of mesh clients are known. In this paper, we consider a dynamic router node placement problem where, in addition, mesh clients are mobile. To solve this issue, we apply the simulated annealing metaheuristic (SA). At every iteration, clients are moving from their positions to new positions engendering new network topologies. To serve these clients, routers should update their positions by moving according to the new topology. Therefore, SA algorithm is applied to determine the positions of mesh routers every time it is needed. Simulation results demonstrate that the proposed approach is promising in determining optimal positions of mesh routers.","PeriodicalId":128441,"journal":{"name":"2017 5th International Symposium on Computational and Business Intelligence (ISCBI)","volume":"262 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 5th International Symposium on Computational and Business Intelligence (ISCBI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCBI.2017.8053542","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

A wireless mesh network (WMN) is a set of three kinds of nodes: clients, routers and gateways. One of the most challenging issues when dealing with a WMN is how to deploy mesh routers when the positions of mesh clients are known. In this paper, we consider a dynamic router node placement problem where, in addition, mesh clients are mobile. To solve this issue, we apply the simulated annealing metaheuristic (SA). At every iteration, clients are moving from their positions to new positions engendering new network topologies. To serve these clients, routers should update their positions by moving according to the new topology. Therefore, SA algorithm is applied to determine the positions of mesh routers every time it is needed. Simulation results demonstrate that the proposed approach is promising in determining optimal positions of mesh routers.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于模拟退火的移动网状客户端无线网状网络中网状路由器的优化配置
无线网状网络(WMN)由三种节点组成:客户端、路由器和网关。在处理WMN时,最具挑战性的问题之一是如何在网状客户端位置已知的情况下部署网状路由器。在本文中,我们考虑了一个动态路由器节点放置问题,另外,网格客户端是移动的。为了解决这个问题,我们应用了模拟退火元启发式算法(SA)。在每次迭代中,客户端都从它们的位置移动到产生新的网络拓扑的新位置。为了服务这些客户端,路由器应该根据新的拓扑移动来更新自己的位置。因此,每次需要时,采用SA算法来确定网状路由器的位置。仿真结果表明,该方法在确定网状路由器的最优位置方面是有希望的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Critical success factors of enterprise resource planning implementation in construction: Case of Taiwan Portfolios optimization with coherent risk measures in fuzzy asset management Onward movement detection and distance estimation of object using disparity map on stereo vision Triangle similarity approach for detecting eyeball movement Optimizing K-means text document clustering using latent semantic indexing and pillar algorithm
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1