arrow
返回

Efficient sensor network management for asset localization

delete2018-11-01
delete9
delete
OA
AI
A
Andrei Soeanu *
S
Sujoy Ray
J
Jean Berger
M
Mourad Debbabi
DOI:10.1016/j.cor.2018.06.001delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
Asset localization represents an important application over wireless sensor networks (WSN) with a wide area of applicability ranging from network surveillance to search and rescue operations. In this paper, we address a research problem of network management where resource constrained sensors, in terms of capacity, sensing range and energy, are assigned to multiple targets in order to optimally localize assets with minimized error. We consider a heterogeneous network of omnidirectional sensors, each of which has an individual capacity to focus on a number of targets and a specific range to accurately estimate its distances to the targets that it is focusing on. A proper localization of each target requires a minimum of K (typically three) sensors where the target location is estimated using the intersection of the K range circles. We further analyze the problem under the constraint of a globally specified overall WSN energy budget which limits the possible assignments for the capacitated sensors. Restricting the energy budget leads to a trade-off between energy conservation and localization performance. In this context, we propose a heuristic solution approach leveraging evolutionary learning followed by meta-heuristic improvements based on target swapping among sensors. This approach actually minimizes a quantifier that is composed of the total localization area for all targets in addition to a penalty for each target if it is assigned less than minimum sensors. We provide an illustrative case study for the proposed approach and assess its effectiveness experimentally via benchmark results obtained on a data-set derived from known vehicle routing problem instances. (C) 2018 Elsevier Ltd. All rights reserved.
Keyword:
Asset localization
Wireless sensor network
Multi-dimensional assignment
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

C
Computers and Operations Research
IF:
4.3
论文数:
6.5K
被引数:
1.8W

机构

C
concordia university - canada
学者数:
8.0K
论文数: 8.9K
被引数: 4
引用论文

引用论文

Localized algorithms for information fusion in resource constrained networks
err2014-01-01
err10
PREAI
errNakamura, Eduardo Freire; Ferreira Loureiro, Antonio Alfredo; Boukerche, Azzedine; Zomaya, Albert Y.
err分享
err收藏
err分享
err收藏
Integer programming models for the multidimensional assignment problem with star costs
err2014-06-01
err17
PREAI
errWalteros, Jose L.; Vogiatzis, Chrysafis; Pasiliao, Eduardo L.; Pardalos, Panos M.
err分享
err收藏
学者 查看更多内容