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

Wireless sensor networks scheduling for full angle coverage

MULTIDIMENSIONAL SYSTEMS AND SIGNAL PROCESSING 2009年第2期20卷 101-119页

作者： Chow, Kit-Yee Lui, King-Shan Lam, Edmund Y. Univ Hong Kong Dept Elect & Elect Engn Hong Kong Hong Kong Peoples R China

Many current studies in tracking and surveillance assume that a target can be monitored by a single sensor. However, there are situations where a sensor can only monitor a certain portion of the object. Examples include image capturing and coastline monitoring. In our previous work, we develop the Minimum Cost Cover algorithm to identify a set of sensors which preserve 360A degrees coverage of a target with minimum cost, such that when different cost functions for the sensors are used, covers with different optimization objectives can be identified. In this work, we study the scheduling problem to monitor a target continuously with full angle coverage. To increase network lifetime, we develop several algorithms by adopting different cost functions in selecting the sensors. We evaluate the performance of our schemes through extensive simulations. The simulation results show that our proposed Conditional Scheduling metric can help to improve the network lifetime as well as the time to the first node failure.

关键词： angle coverage Minimum cost cover Scheduling

来源：评论

学校读者我要写书评

暂无评论

Modeling and Maximizing angle coverage in Visual Sensor Networks 37

Modeling and Maximizing Angle Coverage in Visual Sensor Netw...

引用

37th Chinese Control Conference (CCC)

作者： Xiong, Yonghua Lu, Manjie Chen, Wei 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 Guizhou Tobacco Sci Inst Guiyang 550081 Guizhou Peoples R China

ISBN: (纸本)9789881563958

Maintaining the quality of network coverage is a major concern in visual sensor networks. In this paper, we study the angle coverage problem in visual sensor networks, considering the target is very large, and each camera node can only monitor a portion of its perimeter. The goal of the proposed work is to schedule camera nodes to achieve maximum angle coverage in different period. Firstly, we establish a novel coverage model and formally prove that the problem is NP-hard in general. Next, we present a scheduling scheme based on greedy algorithm, to schedule camera nodes into disjoint cover sets working in turn. Then, we conclude that the approximate ratio of the proposed algorithm is k, theoretically, and the time complexity of the algorithm is O(n). Finally, extensive simulations have been conducted to evaluate the performance of the proposed algorithm.

关键词： Visual sensor network angle coverage camera node scheduling greedy algorithm

来源：评论

学校读者我要写书评

暂无评论

The angle coverage algorithm of mobile object in wireless camera sensor networks

The angle coverage algorithm of mobile object in wireless ca...

引用

International Joint Conference on Awareness Science and Technology and Ubi-Media Computing (iCAST-UMEDIA)

作者： Tsai, Hua-Wen Jhong, Jhen-Jhou Lin, Meng-Ruei Lunghwa Univ Sci & Tech Dept Comp Info & Net Engn Taoyuan 33306 Taiwan

ISBN: (纸本)9781479944002

Visual sensor networks offer surveillance applications, particularly object tracking. This study proposed an angle converge algorithm for mobile object to cover all angles of a mobile object in wireless camera sensor networks. This algorithm mainly applies to a security monitor system that can detect the object tracks and need to catch the 360 degrees images of mobile object. This study designs a node selection algorithm to find a set of coverage nodes. The field of views of coverage nodes can cover all angles of mobile object. When the object moves, the set of coverage nodes has to update to maintain full coverage angle. We have to select the minimum number of nodes to cover full coverage angle. The wireless camera sensor network is random deployed in the monitor area environment. Each sensor node has rotational camera lens, and each camera can rotate 360 degrees. When a node detects a mobile object in the monitor area, it starts the tracking task and selects a set of coverage nodes to cover the mobile object. The field of view of camera is turned to follow the tracks of object. The mobile object is monitored by the proposed algorithm.

关键词： angle coverage Camera Node Selection Algorithm Object Tracking Wireless Sensor Network

来源：评论

学校读者我要写书评

暂无评论

A New angle coverage Scheduling Optimization Method for Heterogeneous Nodes in Directional Sensor Networks 46

A New Angle Coverage Scheduling Optimization Method for Hete...

引用

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

来源：评论

学校读者我要写书评

暂无评论

Modeling and Maximizing angle coverage in Visual Sensor Networks

Modeling and Maximizing Angle Coverage in Visual Sensor Netw...

引用

第37届中国控制会议

作者： Yonghua Xiong Manjie Lu Wei Chen School of Automation China University of Geosciences Hubei Key Laboratory of Advanced Control and Intelligent Automation for Complex Systems Guizhou Tobacco Science Institute

Maintaining the quality of network coverage is a major concern in visual sensor networks. In this paper, we study the angle coverage problem in visual sensor networks, considering the target is very large, and each camera node can only monitor a portion of its perimeter. The goal of the proposed work is to schedule camera nodes to achieve maximum angle coverage in different period. Firstly, we establish a novel coverage model and formally prove that the problem is NP-hard in ***, we present a scheduling scheme based on greedy algorithm, to schedule camera nodes into disjoint cover sets working in ***, we conclude that the approximate ratio of the proposed algorithm is k, theoretically, and the time complexity of the algorithm is O（n）. Finally, extensive simulations have been conducted to evaluate the performance of the proposed algorithm.

关键词： Visual sensor network angle coverage camera node scheduling greedy algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：