当前位置: X-MOL 学术Ad Hoc Netw. › 论文详情
Immigrant imperialist competitive algorithm to solve the multi-constraint node placement problem in target-based wireless sensor networks
Ad Hoc Networks ( IF 3.490 ) Pub Date : 2020-05-15 , DOI: 10.1016/j.adhoc.2020.102183
Wafa Barkhoda; Hemmat Sheikhi

The k-coverage and m-connected sensor placement problem in target-based wireless sensor networks (WSNs) is assessed here, where all target points must be covered by at least k sensor nodes and all senor nodes must be connected to the sink through at least m separate paths. The potential positions for placing sensor nodes are pre-specified. A new method based on the imperialist competitive algorithm (ICA) is proposed to solve this dual featured problem. The possibility of immigration for colonies from weak to stronger empires is added to the standard ICA. Immigration promotes the ability of the Immigrant imperialist competitive algorithm (IICA) in exploration and prevents the early convergence to local minimums. The mathematical formulation is provided for the immigration process. In simulations, the 2D and 3D environments together with grid and random WSNs are of concern. The main issues of concern here consist of the placed sensor node count and the run time. The experimental results indicate that this proposed method applies less sensor nodes than its counterparts and requires less run time.
更新日期:2020-05-15

 

全部期刊列表>>
如何通过Nature平台传播科研成果
跟Nature、Science文章学绘图
隐藏1h前已浏览文章
课题组网站
新版X-MOL期刊搜索和高级搜索功能介绍
中洪博元
ACS材料视界
x-mol收录
南开大学
朱守非
廖良生
南方科技大学
西湖大学
伊利诺伊大学香槟分校
徐明华
中山大学化学工程与技术学院
试剂库存
天合科研
down
wechat
bug