检索结果-内蒙古大学图书馆

Harnessing Dominating Set for target coverage in Internet of Things Enabled Wireless Sensor Networks

NATIONAL ACADEMY SCIENCE LETTERS-INDIA 2025年 1-6页

作者： Afizudeen, S. Pavithra, R. Vellore Inst Technol Chennai Campus Chennai 600127 Tamil Nadu India

Internet of Things (IoT) maintain the interconnection between sensing devices and objects, collecting the real-time data for analysis and decision-making with Artificial Intelligence (AI). Many IoT enabled sensor nodes are battery powered and non-replaceable. The optimal placement of IoT-based sensors improve the real-time accurate data collection. In this paper, a Domination based Sensor Placement Strategic (DSPS) algorithm is proposed to address the sensor requirement and its optimal coordinates. The simulation result shows that the proposed algorithm has better quality of coverage and minimal sensor requirement among the other existing algorithms. Analysis of Variance (ANOVA) test is performed to compare the simulation result statistically.

关键词： Dominating set Internet of Things Optimal sensor placement target coverage

来源：评论

学校读者我要写书评

暂无评论

target coverage-Oriented Deployment of Rechargeable Directional Sensor Networks With a Mobile Charger

引用

IEEE INTERNET OF THINGS JOURNAL 2019年第3期6卷 5196-5208页

作者： Zhu, Xiaojian Li, Jun Zhou, MengChu Changshu Inst Technol Sch Comp Sci & Engn Changshu 215500 Jiangsu Peoples R China Southeast Univ Key Lab Measurement & Control CSE Minist Educ Nanjing 210096 Jiangsu Peoples R China New Jersey Inst Technol Dept Elect & Comp Engn Newark NJ 07102 USA King Abdulaziz Univ Renewable Energy Res Grp Jeddah 21589 Saudi Arabia

With the advance on wireless energy transfer, it is reliable and favorable to power a directional sensor network (DSN) by wireless charging. This paper investigates how to deploy a rechargeable DSN using a mobile charger (MC) with the least number of nodes for perpetual target coverage subject to the limited sensing angles of directional sensors and limited energy capacity of the MC. We prove that the proposed problem is NP-hard. Next, we formulate it as a mixed integer nonlinear program to determine the smallest subset of sites to place sensors and the working directions of sensing nodes. Then, we propose two algorithms, i.e., an energy-bounded minimum-cost deployment and a relaxed-linear-program and repairing-based deployment. The simulation results demonstrate that the latter has higher success rate and solution quality than the former at the expense of more computational time.

关键词： Directional sensor networks (DSNs) mobile charger (MC) node deployment target coverage wireless energy transfer

来源：评论

学校读者我要写书评

暂无评论

target coverage-Aware Clustering in Directional Sensor Networks: A Distributed Approach

引用

IEEE ACCESS 2019年 7卷 64005-64014页

作者： Sharmin, Selina Nur, Fernaz Narin Islam, Maheen Razzaque, Md Abdur Hassan, Mohammad Mehedi Alelaiwi, Abdulhameed Univ Dhaka Dept Comp Sci & Engn Dhaka 1000 Bangladesh King Saud Univ Coll Comp & Informat Sci Riyadh 11543 Saudi Arabia King Saud Univ Res Chair Smart Technol Riyadh 11543 Saudi Arabia

Existing clustering algorithms for directional sensor networks mainly focused on maximizing network lifetime and/or data delivery performances. A distributed clustering algorithm named TRACE considering target coverage is proposed in this paper that improves the clustering performances, as well as, the sensing coverage in the network. TRACE is designed to operate in a fully distributed manner. It is also a light-weight clustering algorithm based on coverage and connectivity, where only single-hop neighborhood information is exploited by the nodes to determine cluster heads (CHs) and two-hop neighborhood messages for gateways. Moreover, a target-coverage algorithm is proposed, where the TRACE CHs try to activate the minimum number of sensor nodes in the network, as well as, greedily maximize the number of covered targets. To measure the performances, the TRACE system is implemented in Network Simulator version 3 (NS-3) and the simulation outcomes depict that the proposed TRACE performs better than the state-of-the-art work in terms of cluster-coverage ratio, network lifetime, and overhead.

关键词： Clustering target coverage network lifetime directional sensor

来源：评论

学校读者我要写书评

暂无评论

target coverage through distributed clustering in directional sensor networks

引用

EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND NETWORKING 2015年第1期000卷 1-18页

作者： Islam, Md. Mofijul Ahasanuzzaman, Md. Razzaque, Md. Abdur Hassan, Mohammad Mehedi Alelaiwi, Abdulhameed Xiang, Yang Univ Dhaka Dept Comp Sci & Engn Green Networking Res Grp Dhaka 1000 Bangladesh King Saud Univ Coll Comp & Informat Sci Informat Syst Dept Riyadh 11543 Saudi Arabia Deakin Univ Sch Informat Technol Burwood Vic 3125 Australia

Maximum target coverage with minimum number of sensor nodes, known as an MCMS problem, is an important problem in directional sensor networks (DSNs). For guaranteed coverage and event reporting, the underlying mechanism must ensure that all targets are covered by the sensors and the resulting network is connected. Existing solutions allow individual sensor nodes to determine the sensing direction for maximum target coverage which produces sensing coverage redundancy and much overhead. Gathering nodes into clusters might provide a better solution to this problem. In this paper, we have designed distributed clustering and target coverage algorithms to address the problem in an energy-efficient way. To the best of our knowledge, this is the first work that exploits cluster heads to determine the active sensing nodes and their directions for solving target coverage problems in DSNs. Our extensive simulation study shows that our system outperforms a number of state-of-the-art approaches.

关键词： Directional sensor networks target coverage Distributed algorithm Network lifetime Cluster

来源：评论

学校读者我要写书评

暂无评论

target coverage in camera networks for manufacturing workplaces

引用

JOURNAL OF INTELLIGENT MANUFACTURING 2016年第6期27卷 1221-1235页

作者： Hanoun, Samer Bhatti, Asim Creighton, Doug Nahavandi, Saeid Crothers, Phillip Esparza, Celeste Gloria Deakin Univ Ctr Intelligent Syst Res Geelong Vic Australia Boeing Res & Technol Melbourne Vic Australia GM Holden Melbourne Vic Australia

In this paper, we investigate the camera network placement problem for target coverage in manufacturing workplaces. The problem is formulated to find the minimum number of cameras of different types and their best configurations to maximise the coverage of the monitored workplace such that the given set of target points of interest are each k-covered with a predefined minimum spatial resolution. Since the problem is NP-complete, and even NP-hard to approximate, a novel method based on Simulated Annealing is presented to solve the optimisation problem. A new neighbourhood generation function is proposed to handle the discrete nature of the problem. The visual coverage is modelled using realistic and coherent assumptions of camera intrinsic and extrinsic parameters making it suitable for many real world camera based applications. Task-specific quality of coverage measure is proposed to assist selecting the best among the set of camera network placements with equal coverage. A 3D CAD of the monitored space is used to examine physical occlusions of target points. The results show the accuracy, efficiency and scalability of the presented solution method;which can be applied effectively in the design of practical camera networks.

关键词： Camera networks Camera network placement Simulated annealing target coverage Quality of coverage

来源：评论

学校读者我要写书评

暂无评论

target coverage in head and neck cancer treated with intensity-modulated radiotherapy: A comparison between conventional and conformal techniques

引用

TUMORI JOURNAL 2006年第6期92卷 503-510页

作者： Palazzi, Mauro Orlandi, Ester Pignoli, Emanuele Lualdi, Manuela Zonca, Giancarlo Sangalli, Claudia Stucchi, Claudio Olmi, Patrizia Ist Nazl Tumori Unit Radiotherapy I-20133 Milan Italy Ist Nazl Tumori Unit Med Phys I-20133 Milan Italy

Aims and background: We designed a comparative planning study aimed at quantifying the advantages of intensity-modulated radiotherapy (IMRT) over the conventional 3-field technique (3FT) and a 5-field conformal technique (5FCT) for head and neck (HN) cancer. Methods: We selected 9 patients treated at our institution with curative radiotherapy for a HN cancer. For all cases 4 plans were generated: 2 plans using the "standard" techniques (3FT and 5FCT), a third plan using IMRT, and a fourth "mixed" plan using IMRT followed by a conventional boost. Results: Our study confirmed literature data on the ability of IMRT to significantly decrease the dose received by organs at risk, compared with previous techniques. target coverage was systematically better with 5FCT and IMRT than with 3FT. However, the increase in coverage of both PTV2 and PTV1 was only about 3-5% and this was achieved at the price of a similar increase in maximum dose (D1%). Volumetric parameters (V100%, V95%) were much more sensitive in detecting the improvement with IMRT. Conclusions: The improvement of target coverage attained by IMRT, as compared with conventional and conformal techniques, might be overestimated by data currently available in the medical literature. If treatment with conventional techniques is planned using all tools provided by currently available fully 3-D planning systems, excellent target coverage can be obtained.

关键词： head and neck cancer IMRT planning study target coverage

来源：评论

学校读者我要写书评

暂无评论

target coverage optimisation of wireless sensor networks using a multi-objective immune co-evolutionary algorithm

引用

INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE 2011年第9期42卷 1531-1541页

作者： Ding, Yong-Sheng Lu, Xing-Jia Hao, Kuang-Rong Li, Long-Fei Hu, Yi-Fan Donghua Univ Coll Informat Sci & Technol Shanghai 201620 Peoples R China Ningbo Univ Technol Sch Sci Ningbo 315016 Peoples R China Donghua Univ Engn Res Ctr Digitized Text & Fash Technol Minist Educ Shanghai 201620 Peoples R China

target coverage is an important topic of wireless sensor networks. The target cover can be modelled as a minimal multi-objective vertex cover model with constraint of network connection. In order to search the optimal solution of the target cover set, we propose a multi-objective immune co-evolutionary algorithm (MOICEA) for target coverage. The MOICEA is inspired from the biological mechanisms of immune systems including clonal proliferation, hypermutation, co-evolution, immune elimination and memory mechanism. The affinity between antibody and antigen is used to measure the optimal target cover, and the affinity between antibodies is used to evaluate the diversity of population and to instruct the population evolution process. In order to examine the effectiveness of the MOICEA, we compare its performance with that of integer linear program and genetic algorithm in terms of four objectives while maintaining network connectivity. The experiment results show that the MOICEA can obtain promising performance in efficiently searching optimal vertex set by comparing with other approaches.

关键词： wireless sensor networks target coverage vertex cover multi-objective optimisation immune co-evolutionary algorithm

来源：评论

学校读者我要写书评

暂无评论

Theoretical Treatment of target coverage in Wireless Sensor Networks

引用

Journal of Computer Science & Technology 2011年第1期26卷 117-129页

作者：谷雨赵保华计宇生李颉 School of Computer Science University of Science and Technology of China State Key Laboratory of Networking and Switching Technology Information Systems Architecture Science Research Division National Institute of InformaticsTokyoJapan Department of Computer Science University of TsukubaTsukuba Science CityIbarakiJapan

The target coverage is an important yet challenging problem in wireless sensor networks, especially when both coverage and energy constraints should be taken into account. Due to its nonlinear nature, previous studies of this problem have mainly focused on heuristic algorithms; the theoretical bound remains unknown. Moreover, the most popular method used in the previous literature, i.e., discretization of continuous time, has yet to be justified. This paper fills in these gaps with two theoretical results. The first one is a formal justification for the method. We use a simple example to illustrate the procedure of transforming a solution in time domain into a corresponding solution in the pattern domain with the same network lifetime and obtain two key observations. After that, we formally prove these two observations and use them as the basis to justify the method. The second result is an algorithm that can guarantee the network lifetime to be at least （1 - ε） of the optimal network lifetime, where ε can be made arbitrarily small depending on the required precision. The algorithm is based on the column generation （CG） theory, which decomposes the original problem into two sub-problems and iteratively solves them in a way that approaches the optimal solution. Moreover, we developed several constructive approaches to further optimize the algorithm. Numerical results verify the efficiency of our CG-based algorithm.

关键词： target coverage wireless sensor networks time-dependent solution pattern-based solution column generation

来源：评论

学校读者我要写书评

暂无评论

target coverage using a Collaborative Platform for Sensor Cloud 9

Target Coverage using a Collaborative Platform for Sensor Cl...

引用

9th IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS)

作者： Sen, Biplab K. Khatua, Sunirmal Das, Rajib K. Univ Calcutta Dept Comp Sci & Engn Kolkata 700073 W Bengal India

ISBN: (纸本)9781509002931

Nowadays Sensor-cloud has received a lot of interests among researchers in the field of Wireless Sensor Networks (WSN) as well as Cloud Computing. An integral part of the Sensor Cloud platform is the Collaboration of WSN providers which improves the utilization of sensor resources. The physical sensors in such a collaborative environment are shared among multiple applications from different administrative domains. In this paper, we propose a Sensor Cloud Architecture which allows the users to deploy their sensor applications on-demand within the collaborative platform. The sensor resources used by the application are provided as a service to the user. The cost for offering such service depends on the number of physical sensors selected for covering the targets (locations of interest) for that application as well as connecting the selected physical sensors to the base station. In this paper, we proposed a two phase algorithm for this problem. In the first phase (coverage), an Integer Programming Problem(IPP) is used to find a minimum set of sensors to cover the targets. In the next phase (Connectivity) a heuristic is used to extend the set such that connectivity of all the selected sensors is ensured. The performance of the proposed approach is validated through simulation which shows significant improvement of using collaboration over multiple non-collaborative WSNs. We also establish the superiority of the heuristic for ensuring connectivity over one such algorithm in the literature.

关键词： Virtual sensor collaborative network sensor cloud target coverage

来源：评论

学校读者我要写书评

暂无评论

target coverage Heuristics in Wireless Sensor Networks 10th

Target Coverage Heuristics in Wireless Sensor Networks

引用

10th International Conference on Advanced Computing and Communication Technologies (ICACCT)

作者： Manju Singh, Deepti Chand, Satish Kumar, Bijendra Netaji Subhash Inst Technol Sect 3 New Delhi 110078 India Jawaharlal Nehru Univ Sch Comp & Syst Sci New Delhi 110067 India

ISBN: (纸本)9789811046032;9789811046025

In order to cover a fixed set of targets within a wireless sensor networks, sensor nodes are closely deployed. Since, sensors are heavily deployed, instead of all sensors, few sensors are sufficient to monitor full target set. Therefore, to maximize the total network lifetime for covering all the targets (target coverage problem), sensor nodes are partitioned into cover sets. Each cover set is sufficiently enough to monitor the complete target set. Then the cover sets are activated sequentially for a fixed duration. The summation of all the covers duration is called network lifetime. More number of such cover set results in longer global network lifetime. To do this, in this work, we propose an energy optimal heuristic which generates maximum possible cover sets to reach the upper bound calculated for network lifetime.

关键词： target coverage Network lifetime Upper bound Cover set

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：