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

Sleep-wakeup scheduling algorithm for lifespan maximization of directional sensor networks: a discrete cuckoo search optimization algorithm

引用

COMPLEX & INTELLIGENT SYSTEMS 2023年第6期9卷 6459-6491页

作者： Mortazavi, Mir Gholamreza Shirvani, Mirsaeid Hosseini Dana, Arash Fathy, Mahmood Islamic Azad Univ Dept Elect Engn Cent Tehran Branch Tehran Iran Islamic Azad Univ Dept Comp Engn Sari Branch Sari Iran Iran Univ Sci & Technol Sch Comp Engn Tehran *** Iran Inst Res Fundamental Sci IPM Sch Comp Sci Tehran Iran

directional sensor networks (DSNs) are ad-hoc networks which are utilized in different industrial applications. Their usual engagements are to monitor and to perform the coverage of all specific targets in the observing fields permanently. These kinds of networks include numerous configurable directional sensors in which they can be utilized in one of the possible directions along with the one of their adjustable ranges. Although the energy harvesting methodology is being applied for these battery-hungry applications, the battery management and network lifetime maximization are still prominent challenges. In this paper, the network lifetime extension is formulated to a discrete optimization problem which is a famous non-deterministic polynomial time hardness (NP-Hard) problem. To solve this combinatorial problem, a discrete cuckoo search algorithm (D-CSA) is designed and is called in several rounds. A cover is a sub set of configured sensors capable of monitoring all targets in the observing field. In each round, the most efficient cover is constituted along with its activation time. In the determined activation time, the sensors in the cover are scheduled in wakeup mode whereas others are set in sleep mode to save energy. Despite other meta-heuristic algorithms, this proposed algorithm utilizes the novel defined discrete walking around procedures that makes to reach a good balance between exploration and exploitation in this complex search space. The proposed algorithm has been tested in different scenarios to be evaluated. The simulation results in the variety circumstances prove the superiority of the proposed algorithm is about 20.29%, 19.55%, 14.40%, 14.51%, 7.70% and 8.03% in term of average lifespan improvement against H-MNLAR, Hm-LifMax-BC, GA, ACOSC, H-GATS, and HDPSO algorithms, respectively. The results also show the high potential scalability of the proposed algorithm.

关键词： directional sensor network Target coverage Cover set Discrete cuckoo search optimization algorithm

来源：评论

学校读者我要写书评

暂无评论

Coverage improvement using Voronoi diagrams in directional sensor networks

引用

IET WIRELESS sensor SYSTEMS 2021年第3期11卷 111-119页

作者： Zarei, Zahra Bag-Mohammadi, Mozafar Islamic Azad Univ Dept Comp Engn Ilam Iran Ilam Univ Engn Fac Wireless Networks Lab Ilam Iran

Recently, the area coverage problem has emerged in the directional sensor network (DSN), where the sensor's sensed area depends on its working direction and viewing angle. This study has proposed a new algorithm based on the Voronoi diagram, called prioritized geometric area coverage (PGAC), to increase DSN's covered area. In a Voronoi diagram, all internal points of a convex polygon (cell) formed around a sensor are closer to the sensor than any other sensor. Therefore, the best sensor for covering a Voronoi cell area is the corresponding sensor of the cell. In contrast to similar approaches, PGAC considers the relation between the cell area and the sensor's covered area when selecting a sensor's working direction. It categorizes Voronoi cells, based on their geometric sizes, into three categories. In each category, PGAC adjusts the sensor's working direction to maximize the covered area and minimize the overlapping between adjacent cells. It also turns off redundant sensors for extending the network lifetime. Our simulation results showed that PGAC increases the covered area and decreases the number of active sensors compared to similar methods.

关键词： active sensor network Voronoi cell area DSN covered area Reliability computational geometry Voronoi diagram prioritized geometric area coverage problem Wireless sensor networks wireless sensor networks convex polygon redundant sensor network directional sensor network PGAC telecommunication network reliability adjacent cells coverage improvement

来源：评论

学校读者我要写书评

暂无评论

A Coverage-Enhancing Method for 3D directional sensor networks

A Coverage-Enhancing Method for 3D Directional Sensor Networ...

引用

IEEE INFOCOM Conference 2009

作者： Ma, Huadong Zhang, Xi Ming, Anlong Beijing Univ Posts & Telecommun Beijing Key Lab Intelligent Telecomm Software & M Beijing 100876 Peoples R China Dept Elect & Comp Engn Network Informat Syd College Stn TX 77843 USA

ISBN: (纸本)9781424435128

In conventional directional sensor networks, coverage control for each sensor is based on a 2D directional sensing model. However, 2D directional sensing model cannot accurately characterize the actual application scene of image/video sensor networks. To remedy this deficiency, we propose a 3D directional sensor coverage-control model with tunable orientations. In order to improve the efficiency of target-detecting, we develop a virtual potential-field based coverage-enhancing scheme to improve the coverage performance. Furthermore, we apply the simulated annealing algorithm for objective optimization. The extensive simulations show the effectiveness of our proposed 3D sensing model and coverage enhancing method.

关键词： directional sensor network 3D sensing model coverage enhancement potential field simulated annealing

来源：评论

学校读者我要写书评

暂无评论

Crucial Area Coverage of directional sensor networks with Limited Resource

Crucial Area Coverage of Directional Sensor Networks with Li...

引用

7th IEEE International Conference on Wireless Communications and Signal Processing (WCSP)

作者： Huang, Yafei Gu, Chaochen Wu, Kaijie Chen, Cailian Guan, Xinping Shanghai Jiao Tong Univ Dept Automat Key Lab Syst Control & Informat Proc Minist Educ China Shanghai 200240 Peoples R China

ISBN: (纸本)9781467376877

In many problems of directional sensor networks, the coverage problem is a fundamental one, which draws attention of researchers. However, full coverage of an area is hardly achieved due to the vast resource expenditure. Covering crucial part of an area is a more feasible way to realize. To achieve this target, we propose a weighting function to describe the target area. In order to cover the important part of the target area, we utilize Particle Swarm Optimization (PSO) to adjust locations and orientations of directional sensors which enhance the coverage effect. Furthermore, we apply the simulated annealing (SA) algorithm to help algorithm approach to the global optimization. Simulation results show that our proposed weighting function and coverage enhancing algorithms can clearly guide directional sensors cover crucial part of the target area.

关键词： directional sensor network area coverage particle swarm optimization simulated annealing

来源：评论

学校读者我要写书评

暂无评论

A Target-Oriented Conflict Graph-based Approach for the Coverage Problem in directional sensor networks 21

A Target-Oriented Conflict Graph-based Approach for the Cove...

引用

8th International Conference on networking, Systems and Security, NSysS 2021

作者： Afroze, Syeda Farzia Rahman, Ashikur Bangladesh University of Engineering and Technology Bangladesh

ISBN: (纸本)9781450387378

Maximizing target coverage with minimum number of sensors is an elementary problem in the area of wireless sensor networks which has many applications in monitoring, tracking, security, and surveillance systems. The recent increase in the use of directional sensors adds a new dimension to the problem. As the problem is understood to be NP-hard, most of the previous works attempt greedy heuristics for achieving a near-optimal solutions. Unlike previous research works, we take a graph theoretic target-oriented approach to the problem and provide a novel solution based on a polynomial time graph algorithm. The usage of graph models minimizes the run time complexity while simultaneously improves the solution's optimality. In over-provisioned Visual sensor networks where there exist sufficient number of sensors to cover all the targets, the suggested approach exhibits promising results. © 2021 ACM.

关键词： Wireless sensor networks Graph-Theoretic Approach Coverage maximization directional sensor network

来源：评论

学校读者我要写书评

暂无评论

Distributed Algorithm for Area Monitoring in directional sensor networks 12th

Distributed Algorithm for Area Monitoring in Directional Sen...

引用

12th International Conference on Information Systems and Advanced Technologies, ICISAT 2022

作者： Bendimerad, Nawel Boumedjout, Amal Bot, Bena Department of Systems Engineering National Polytechnic School of Oran Maurice Audin El M’Naouer PO. Box 1523 Oran31000 Algeria

ISBN: (纸本)9783031253430

directional sensor networks (DSNs) are still receiving consideration in different fields of high-level monitoring applications. However, unlike traditional omni-directional sensors, directional sensors are characterized by a limited sensing angle, which causes various problems for satisfying the coverage quality requirements of a critical region. In this paper, a novel distributed algorithm is proposed to significantly improve the area coverage ratio using a DSN. Based on a directional sensor node model combined with geometry concepts, we provide each directional sensor with the ability to calculate the most appropriate working direction. This solution allows us to maximize coverage, in such a way to obtain a better surveillance quality in monitoring and control applications. To extend the network lifetime, redundant sensors are exploited to keep just a set of directional sensors in active mode. Simulation results demonstrate that the proposed approach effectively improves the area coverage ratio compared to the existing algorithms. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Area coverage directional sensor network Distributed algorithm Simulation

来源：评论

学校读者我要写书评

暂无评论

A Coverage-Preserving Density Control Algorithm for directional sensor networks

引用

JOURNAL OF INTERNET TECHNOLOGY 2009年第1期10卷 37-42页

作者： Tao, Dan Chen, Hou-Jin Sun, Yan Beijing Jiaotong Univ Sch Elect & Informat Engn Elect & Informat Engn Dept Beijing Peoples R China Beijing Univ Posts & Telecommun Dept Comp Sci & Technol Beijing Peoples R China

In dense sensor networks, density control is a common way to prolong network's lifetime while providing sufficient sensing coverage. Most of the existing density control algorithms are based on isotropic sensing model. However, directional sensor networks, whose nodes meet directional sensing model, have great application chances. In this paper, we propose a Coverage-Preserving Density Control Algorithm (CPDCA) for directional sensor networks, which can effectively turn off redundant directional nodes to reduce network energy consumption and extend the network lifetime while maintaining a considerable ability of network coverage. Extensive simulations are conducted to verify the effectiveness of our solution, and we give detailed discussions on the effects of different system parameters.

关键词： directional sensor network Density Control Perimeter Coverage

来源：评论

学校读者我要写书评

暂无评论

sensor scheduling for target coverage in directional sensor networks

引用

INTERNATIONAL JOURNAL OF DISTRIBUTED sensor networkS 2017年第6期13卷 1-12页

作者： Jia, Jinglan Dong, Cailin He, Xinggang Li, Deying Yu, Ying Cent China Normal Univ Sch Math & Stat Wuhan Peoples R China Renmin Univ China Sch Informat Beijing Peoples R China Cent China Normal Univ Sch Comp Wuhan 430079 Peoples R China

directional sensor networks have a lot of practical applications, and target coverage is one of the most important issues. In this article, we study the target coverage problem in directional sensor network, where directional sensors can rotate freely around their centers and targets are attached with differentiated coverage quality requirements. Our goal is to maximize the lifetime of sensor network, satisfying the coverage quality requirements of all targets. We model it as the maximum cover sets problem and address it by organizing the directions of sensors into a group of non-disjoint cover sets, which can cover all targets, satisfying their coverage quality requirements, and then schedule them alternately to extend the network lifetime. It consists of two parts. First, since directional sensor has infinite directions by rotating continuously, we propose sensing direction partition algorithm to find all non-redundancy directions for each sensor according to the targets deployed within the sensing region of the sensor. Then, based on the result of the sensing direction partition algorithm, we propose an efficient heuristic algorithm for the maximum cover sets problem to organize the directions of sensors into a number of non-disjoint cover sets and allocate work time for each cover set. Besides, we get an upper bound of the optimal solution for the problem. Finally, simulation results are presented to demonstrate the performance of our algorithm.

关键词： Coverage quality directional sensor network network lifetime sensor scheduling target coverage

来源：评论

学校读者我要写书评

暂无评论

An Area Coverage and Energy Consumption Optimization Approach Based on Improved Adaptive Particle Swarm Optimization for directional sensor networks

引用

sensorS 2019年第5期19卷 1192页

作者： Peng, Song Xiong, Yonghua China Univ Geosci Sch Automat Wuhan 430074 Hubei Peoples R China Hubei Key Lab Adv Control & Intelligent Automat C Wuhan 430074 Hubei Peoples R China

Coverage is a vital indicator which reflects the performance of directional sensor networks (DSNs). The random deployment of directional sensor nodes will lead to many covergae blind areas and overlapping areas. Besides, the premature death of nodes will also directly affect the service quality of network due to limited energy. To address these problems, this paper proposes a new area coverage and energy consumption optimization approach based on improved adaptive particle swarm optimization (IAPSO). For area coverage problem, we set up a multi-objective optimization model in order to improve coverage ratio and reduce redundancy ratio by sensing direction rotation. For energy consumption optimization, we make energy consumption evenly distribute on each sensor node by clustering network. We set up a cluster head selection optimization model which considers the total residual energy ratio and energy consumption balance degree of cluster head candidates. We also propose a cluster formation algorithm in which member nodes choose their cluster heads by weight function. We next utilize an IAPSO to solve two optimization models to achieve high coverage ratio, low redundancy ratio and energy consumption balance. Extensive simulation results demonstrate the our proposed approach performs better than other ones.

关键词： directional sensor network area coverage cluster particle swarm optimization energy consumption balance

来源：评论

学校读者我要写书评

暂无评论

Energy Aware Wireless sensor network Low Energy Consumption Full network Coverage Algorithm

引用

INTERNATIONAL JOURNAL OF GRID AND DISTRIBUTED COMPUTING 2016年第7期9卷 73-82页

作者： Luo Yonghua Wu Jiawei Qiu Shangming Guangdong AIB Polytech Coll Dept Comp Guangzhou 510507 Guangdong Peoples R China South China Normal Univ Coll Comp Guangzhou 510631 Guangdong Peoples R China

The energy aware based active node decision and the sensing directions thereof become the research hotspots of DNN (directional sensor network). Therefore, an EACO (Energy aware-based coverage optimal) algorithm is proposed in this paper. Specifically, each cluster head decides the number of the active nodes of the cluster members and the sensing directions thereof according to the coverage area of the sensor nodes and the energy information thereof. Meanwhile, the dormancy mechanism is adopted to minimize the overlapping area among the clusters. The simulation result shows that the proposed EACO algorithm is improved in the aspects of coverage rate and network lifetime.

关键词： directional sensor network Coverage rate Dormancy Region optimization Energy aware

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：