实现最大覆盖和最小通信的最佳智能移动接入点放置

Amin Majd, M. Daneshtalab, E. Troubitsyna, Golnaz Sahebi
{"title":"实现最大覆盖和最小通信的最佳智能移动接入点放置","authors":"Amin Majd, M. Daneshtalab, E. Troubitsyna, Golnaz Sahebi","doi":"10.1145/3123779.3123799","DOIUrl":null,"url":null,"abstract":"A selection of the optimal placements of the access points and sensors constitutes one of the fundamental challenges in the monitoring of spatial phenomena in wireless sensor networks (WSNs). Access points should occupy the best locations in order to obtain a sufficient degree of coverage with a low communication cost. Finding an optimal placement is an NP-hard problem that is further complicated by the real-world conditions such as obstacles, radiation interference etc. In this paper, we propose a compound method to select the best near-optimal placement of SMAPs with the goal to maximize the monitoring coverage and to minimize the communication cost. Our approach combines a parallel implementation of the Imperialist Competitive Algorithm (ICA) with a greedy method. The benchmarking of the proposed approach demonstrates its clear advantages in solving and optimizing the placement problem.","PeriodicalId":405980,"journal":{"name":"Proceedings of the Fifth European Conference on the Engineering of Computer-Based Systems","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2017-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Optimal smart mobile access point placement for maximal coverage and minimal communication\",\"authors\":\"Amin Majd, M. Daneshtalab, E. Troubitsyna, Golnaz Sahebi\",\"doi\":\"10.1145/3123779.3123799\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A selection of the optimal placements of the access points and sensors constitutes one of the fundamental challenges in the monitoring of spatial phenomena in wireless sensor networks (WSNs). Access points should occupy the best locations in order to obtain a sufficient degree of coverage with a low communication cost. Finding an optimal placement is an NP-hard problem that is further complicated by the real-world conditions such as obstacles, radiation interference etc. In this paper, we propose a compound method to select the best near-optimal placement of SMAPs with the goal to maximize the monitoring coverage and to minimize the communication cost. Our approach combines a parallel implementation of the Imperialist Competitive Algorithm (ICA) with a greedy method. The benchmarking of the proposed approach demonstrates its clear advantages in solving and optimizing the placement problem.\",\"PeriodicalId\":405980,\"journal\":{\"name\":\"Proceedings of the Fifth European Conference on the Engineering of Computer-Based Systems\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-08-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Fifth European Conference on the Engineering of Computer-Based Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3123779.3123799\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Fifth European Conference on the Engineering of Computer-Based Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3123779.3123799","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

接入点和传感器的最佳位置的选择构成了无线传感器网络(wsn)空间现象监测的基本挑战之一。接入点应占据最佳位置,以便以较低的通信成本获得足够程度的覆盖。寻找最优位置是一个np困难问题,现实世界的条件(如障碍物、辐射干扰等)使其进一步复杂化。在本文中,我们提出了一种复合方法来选择smap的最佳近最优放置,目标是最大化监控覆盖率和最小化通信成本。我们的方法结合了帝国主义竞争算法(ICA)的并行实现和贪婪方法。对标测试表明,该方法在解决和优化布局问题方面具有明显的优势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Optimal smart mobile access point placement for maximal coverage and minimal communication
A selection of the optimal placements of the access points and sensors constitutes one of the fundamental challenges in the monitoring of spatial phenomena in wireless sensor networks (WSNs). Access points should occupy the best locations in order to obtain a sufficient degree of coverage with a low communication cost. Finding an optimal placement is an NP-hard problem that is further complicated by the real-world conditions such as obstacles, radiation interference etc. In this paper, we propose a compound method to select the best near-optimal placement of SMAPs with the goal to maximize the monitoring coverage and to minimize the communication cost. Our approach combines a parallel implementation of the Imperialist Competitive Algorithm (ICA) with a greedy method. The benchmarking of the proposed approach demonstrates its clear advantages in solving and optimizing the placement problem.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Optimal smart mobile access point placement for maximal coverage and minimal communication Dual channel security Information system evolution management: a complex evaluation Towards analysis of IP communication in a constrained environment of tactical radio networks Instructions energy consumption on a heterogeneous multicore platform
×
引用
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