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

46th Annual Conference of the IEEE-Industrial-Electronics-Society (IECON)

作者： Peng, Song Xiong, Yonghua China Univ Geosci Sch Automat Wuhan Peoples R China

ISBN: (纸本)9781728154145

An important issue in directional sensor networks is how to prolong the network lifetime when the coverage requirement is met in angle scenarios. To address this problem, this paper proposes a new angle coverage scheduling optimization method (NACSOM) for heterogeneous nodes. In this method, a coverage-enhancing algorithm of nodes with unadjustable coverage angle is first devised to improve the coverage ratio. For the uncovered angle, a hole-repairing algorithm of nodes with adjustable angle is proposed to repair the coverage hole and achieve the full-angle coverage. To achieve the constant scheduling, a sustainable multi-round angle coverage scheduling algorithm is developed to prolong the network lifetime when the coverage ratio is maximized. Simulation results demonstrate that our method has better performance in real situations.

关键词： Angle coverage directional sensor networks scheduling optimization method

来源：评论

学校读者我要写书评

暂无评论

The Sector Cover and Transmission Weighted Greedy Algorithm for Connected Target Coverage in directional sensor networks 2020

The Sector Cover and Transmission Weighted Greedy Algorithm ...

引用

2020 The 9th International Conference on networks, Communication and Computing

作者： Yu-Fang Jian Wei-Fu Lu Asia University Taiwan

ISBN: (纸本)9781450388566

The directional connected target coverage (DCTC) problem that schedules directional sensors to cover all targets and forward target information back to the sink to maximize system lifetime is still an important research issue in directional sensor networks. In this paper, a Sector Cover and Transmission Weighted Greedy Algorithm (SCTW-greedy algorithm) is proposed to construct the scheduling of sensors for the DCTC problem. The directional sensor nodes used in the previous works are composed of fixed number of sensors, and the orientations of sensors are fixed. This paper considers the directional sensors with arbitrary sensing orientations. To evaluate the performance of the proposed algorithm, several simulations are conducted. Experimental results show that our algorithm can contribute to extending the network lifetime than previous algorithms.

关键词： directional sensor networks Scheduling Network lifetime Connected target coverage

来源：评论

学校读者我要写书评

暂无评论

Probabilistic coverage in directional sensor networks

引用

WIRELESS networks 2019年第1期25卷 355-365页

作者： Si, Pengju Wu, Chengdong Zhang, Yunzhou Chu, Hao Teng, He Northeastern Univ Fac Robot Sci & Engn Shenyang 110819 Liaoning Peoples R China

Correct and realistic sensing model is of great significance for sensor networks to perform environmental monitoring. However, the sensing capabilities of directional sensors are usually affected by environmental factors and intrinsic properties. As a result, it is not suitable to use simple binary sensing model for directional sensor networks (DSNs). In this paper, we consider probabilistic sensing models for DSNs to have practical considerations. Firstly, an exponential decay probabilistic sensing model for DSNs is considered reference to omni-directional probabilistic sensing model for traditional sensor. Secondly, we propose a fault-tolerant probabilistic sensing model with respect to orientation error and rotation error. Furthermore, combined the exponential decay probability with the fault-tolerant probability, a hybrid probabilistic sensing model is formed for DSNs. Then, based on our probability sensing models, a probabilistic coverage algorithm is introduced for random deployment to compute the coverage probability of DSNs. Performance results demonstrate that the proposed algorithm with probabilistic sensing models for DSNs is capable of providing desirable surveillance level.

关键词： directional sensor networks Probabilistic sensing model Coverage probability Random deployment Algorithm

来源：评论

学校读者我要写书评

暂无评论

A new genetic-based approach for maximizing network lifetime in directional sensor networks with adjustable sensing ranges

引用

PERVASIVE AND MOBILE COMPUTING 2019年 52卷 1-12页

作者： Alibeiki, Abolghasem Motameni, Homayun Mohamadi, Hosein Islamic Azad Univ Dept Comp Engn Sari Branch Sari Iran Islamic Azad Univ Dept Comp Engn Azadshahr Branch Azadshahr Iran

In recent years, the directional sensor networks have been attractive to researchers due to their wide and different applications. These networks normally contain a number of self-configurable directional sensors holding adjustable spherical sectors with limited angle. One of the most significant problems in such networks is how to monitor the targets scattered in these networks using sensors with adjustable sensing range and, at the same time, maximize the network lifetime. This problem is recognized as Maximum Network Lifetime With Adjustable Ranges;it has been already proved as an NP-complete problem. As an efficient solution to this problem, the present paper proposes a target-oriented GA-based algorithm that can form cover sets comprising sensors with appropriate directions and sensing ranges in a way to desirably monitor all targets in the network. We examined the efficiency of the proposed algorithm by comparing its obtained results with those of a greedy-based one introduced recently in literature. The comparative results confirmed the efficient performance of the proposed algorithm and also its superiority over the greedy-based algorithm in terms of extending the network lifetime. (C) 2018 Elsevier B.V. All rights reserved.

关键词： directional sensor networks Cover set formation Scheduling algorithms Genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

A learning automata-based algorithm for solving the target k-coverage problem in directional sensor networks with adjustable sensing ranges

引用

PHYSICAL COMMUNICATION 2020年 42卷 101156-101156页

作者： Bakht, Ahmad Javan Motameni, Homayun Mohamadi, Hosein Islamic Azad Univ Dept Comp Engn Sari Branch Sari Iran Islamic Azad Univ Dept Comp Engn Azadshahr Branch Azadshahr Iran

In order to find a solution for the target coverage problem in directional sensor networks (DSNs), some researchers have recently introduced several efficient algorithms. These sensors are conventionally supposed to have a single power level and a single coverage is just needed for targets. In other words, there are various sensing ranges and power consumptions for these sensors under real conditions and at least k times monitoring is required for each target. The present paper addresses this issue as the target k-coverage with adjustable sensing range, which has not been already studied in DSNs. To solve this problem, two learning automata-based algorithms (Algorithms 1 and 2) are proposed and equipped with a strong pruning rule that facilitates the selection of appropriate sensor directions capable of providing the targets with k-coverage. After evaluating the efficiency of the algorithms' performance by conducting several experiments, the results were compared to those ones obtained by a greedy-based algorithm, which is discussed in the literature. Finding indicated that algorithms have superiority over their rivals regarding the prolonged lifetime of their network. (C) 2020 Elsevier B.V. All rights reserved.

关键词： directional sensor networks Cover set formation Scheduling algorithms Learning automata k-coverage

来源：评论

学校读者我要写书评

暂无评论

Quantized Kalman Filter Tracking in directional sensor networks

引用

IEEE TRANSACTIONS ON MOBILE COMPUTING 2018年第4期17卷 871-883页

作者： Hu, Xiaoqing Bao, Ming Zhang, Xiao-Ping Wen, Sha Li, Xiaodong Hu, Yu-Hen Chinese Acad Sci Inst Acoust Beijing 100190 Peoples R China Ryerson Univ Toronto ON M5B 2K3 Canada Elect Technol Informat Res Inst Beijing 100040 Peoples R China Univ Wisconsin Madison WI 53706 USA

Moving target tracking in directional sensor networks has recently attracted attention by right of special directional sensing features. Unlike omnidirectional sensors, the directional sensor senses the target only in the direction of its orientation. It can provide quantized direction that indicates the presence or absence of the target in the sensing field, rather than just the analog measurement of sensing signal with respect to the detected target. A quantized Kalman filter (QKF) based on both quantized directions and analog ranging measurements is derived in the minimum mean-square error (MMSE) sense. Its performances of mean square estimation error (MSE) and complexity are also analyzed. Then, a reduced-complexity QKFof high-accuracy is pursued to facilitate its implementation. It is proved that the QKF yields a smaller MSE than the traditional extended Kalman filter (EKF) merely based on analog measurements. The posterior Cramer-Rao lower bound (PCRLB) is introduced as the performance measure. The performance advantages of the proposed QKF are demonstrated using Monte Carlo simulations in a target tracking application using ultrasonic ranging sensors.

关键词： directional sensor networks target tracking Kalman filter minimum mean-square error

来源：评论

学校读者我要写书评

暂无评论

Barrier coverage in adjustable-orientation directional sensor networks: A learning automata approach

引用

COMPUTERS & ELECTRICAL ENGINEERING 2018年 72卷 859-876页

作者： Khanjary, Mohammad Sabaei, Masoud Meybodi, Mohammad Reza Islamic Azad Univ Sci & Res Branch Comp & Elect Engn Dept Tehran Iran Amirkabir Univ Technol Comp Engn & Informat Technol Dept Tehran Iran

Barrier coverage is one of the main applications of wireless sensor networks. There are two kinds of barrier coverage: weak and strong. While weak barrier coverage can only guarantee detecting intruders moving along predetermined or congruent paths, strong barrier coverage guarantees detecting all intruders regardless of their crossing paths. In this paper, we first present a centralized algorithm based on distributed learning automata to find strong barrier lines in adjustable-orientation directional sensor networks in which nodes can adjust their orientation in a non-overlapping form such as camera sensor networks. Then, we will present the distributed version of the proposed algorithm to be used in practical sensor networks. Moreover, the results of extensive simulations will be presented to compare the performance of proposed algorithms against the optimal algorithm, a greedy algorithm and a previously-proposed algorithm. The results confirm that the proposed algorithms achieve near-optimal results and outcome other algorithms completely. (C) 2018 Elsevier Ltd. All rights reserved.

关键词： Barrier coverage Percolation Learning automata directional sensor networks Camera sensor networks

来源：评论

学校读者我要写书评

暂无评论

Boosting an evolution strategy with a preprocessing step: application to group scheduling problem in directional sensor networks

引用

APPLIED INTELLIGENCE 2018年第12期48卷 4760-4774页

作者： Srivastava, Gaurav Singh, Alok Univ Hyderabad Sch Comp & Informat Sci Hyderabad 500046 Telangana India

This paper presents a two-membered evolution strategy based approach to address the total rotation minimization problem (TRMP) pertaining to directional sensor networks. TRMP is an -hard problem. Performance of the proposed approach is enhanced by employing a pre-processing step that utilizes a constructive heuristic and the concept of opposite solutions. We have compared our approach with the best approach available in the literature. The experimental results demonstrate our approach to be highly effective with substantial gain in terms of solution quality, in comparison to the best approach available in the literature. However, our approach requires more time in comparison to this approach.

关键词： directional sensor networks Group scheduling Evolution strategy Total rotation minimization problem Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Priority-based target coverage in directional sensor networks

引用

IET networks 2018年第6期7卷 414-421页

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

The target coverage optimisation is an important problem in directional sensor networks (DSNs). In this study, the authors present a novel algorithm, called cover critical target first (CCTF), for improving the coverage ratio in DSN. CCTF simultaneously maximises the number of covered targets, reduces the number of active sensors, and extends network lifetime. For a set of uncovered targets, CCTF always finds the highest priority target which has the minimum number of covering sensors. Among sensors that could cover this target, CCTF activates a sensor that covers more additional targets besides the found target. CCTF's performance is evaluated in terms of coverage ratio, the number of active sensors, and power consumption through extensive simulation. The simulation indicates that CCTF is robust against orientation and localisation errors.

关键词： optimisation wireless sensor networks telecommunication network reliability multimedia communication priority-based target coverage directional sensor networks target coverage optimisation network lifetime CCTF performance cover critical target DSN cover critical target first power consumption

来源：评论

学校读者我要写书评

暂无评论

Area coverage estimation model for directional sensor networks

引用

INTERNATIONAL JOURNAL OF EMBEDDED SYSTEMS 2018年第1期10卷 13-21页

作者： Liu, Zhimin Jia, Weijia Wang, Guojun Cent S Univ Sch Informat Sci & Engn Changsha 410083 Hunan Peoples R China Shanghai Jiao Tong Univ Sch Elect Informat & Elect Engn Shanghai 200240 Peoples R China Guangzhou Univ Sch Comp Sci & Educ Software Guangzhou 510006 Guangdong Peoples R China

Recently, directional sensor networks (DSNs) have received a great deal of attention owing to their wide range of applications in different fields. A directional sensor has a smaller angle of sensing range compared to an omni-directional sensor. Coverage is one of the fundamental problems of directional sensor networks at present, which reflects how well the environment is monitored. In this paper, we propose a coverage estimation model to estimate coverage problem with boundary effect. In order to guide initial deployment of DSNs and better meet requirements with certain initial coverage probability effectively, a novel probability-based area coverage estimation model with boundary effect, named PCPMB, is proposed. Simulation results show that our proposed model outperforms the previous proposed model without boundary effect.

关键词： directional sensor networks area coverage coverage estimation node estimation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：