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

information coverage in randomly deployed wireless sensor networks

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2007年第8期6卷 2994-3004页

作者： Wang, Bang Chua, Kee Chaing Srinivasan, Vikram Wang, Wei Natl Univ Singapore Dept Elect & Comp Engn Singapore 117548 Singapore

coverage is an important issue. in wireless sensor networks. The most commonly used coverage model in the literature defines a point to be covered if its Euclidian distance to at least one sensor is less than a fixed threshold. This is a conservative definition of coverage which implicitly assumes that each sensor makes a decision independent of other sensors in the field. Sensors can cooperate to make an accurate estimation, even if any single sensor is unable to do so. We have previously proposed a new notion of information coverage [1] and investigated its properties. In this paper, we study sensor density requirements for complete information coverage of a field with,random sensor deployment. We provide an upper bound on the probability that an arbitrary point in a randomly deployed sensor field is not information covered and find the relationship between the sensor density and the average field vacancy. Simulation results validate our theoretical analysis and show that significant savings in terms of sensor density for complete coverage can be achieved with information coverage.

关键词： coverage information coverage sensor density wireless sensor networks parameter estimation

来源：评论

学校读者我要写书评

暂无评论

information coverage for wireless sensor networks

引用

IEEE COMMUNICATIONS LETTERS 2005年第11期9卷 967-969页

作者： Wang, B Wang, W Srinivasan, V Chua, KC Natl Univ Singapore Dept Elect & Comp Engn Singapore 117548 Singapore

coverage is a very important issue in wireless sensor networks. Current literature defines a point to be covered if it is within the sensing radius of at least one sensor. In this paper we argue that this is a conservative definition of coverage. This definition implicitly assumes that each sensor makes a decision independent of other sensors in the field. However, sensors can cooperate to make an accurate estimation, even if any single sensor is unable to do so. We then propose, a new notion of information coverage and investigate its implications for sensor deployment. Numerical and simulation results show that significant savings in terms of sensor density for complete coverage can be achieved by using our definition of information coverage compared to that by using the existing definition.

关键词： coverage information coverage sensor networks estimation

来源：评论

学校读者我要写书评

暂无评论

SENSOR PLACEMENT FOR COMPLETE information coverage IN DISTRIBUTED SENSOR NETWORKS

引用

JOURNAL OF CIRCUITS SYSTEMS AND COMPUTERS 2008年第4期17卷 627-636页

作者： Wang, Bang Nanyang Technol Univ Intelligent Syst Ctr Singapore 637537 Singapore

The sensor placement problem for complete information coverage in a distributed sensor network is studied. Sensors are assumed to be placed on the grid points of a grid in the sensor. field and complete information coverage is claimed if all the grid points are information covered. This sensor placement problem is formulated as a constrained optimization problem where the objective is to minimize the total cost while guaranteeing certain coverage requirement. We propose a greedy algorithm to solve this problem. Computational results show that the proposed algorithm can efficiently obtain a good quality solution with greatly reduced computation complexity and the number of sensors can be greatly reduced for information coverage.

关键词： Sensor placement information coverage constrained optimization

来源：评论

学校读者我要写书评

暂无评论

Effective sensor deployment based on field information coverage in precision agriculture

引用

WIRELESS COMMUNICATIONS & MOBILE COMPUTING 2015年第12期15卷 1606-1620页

作者： An, Wei Ci, Song Luo, Haiyan Wu, Dalei Adamchuk, Viacheslav Sharif, Hamid Wang, Xueyi Tang, Hui Chinese Acad Sci High Performance Network Lab IOA Beijing 100190 Peoples R China Univ Nebraska Lincoln Dept CEEN Omaha NE 68106 USA Cisco Syst Inc Austin TX 78731 USA MIT Dept Mech Engn Cambridge MA 02139 USA

coverage is an importance issue in wireless sensor networks. In this work, we first propose a novel notion of information coverage, which refers to the coverage efficiency of field information covered by deployed sensor nodes. On the basis of information coverage, we consider an optimization problem of how to partition the given field into multiple parcels and to deploy sensor nodes in some selected parcels such that the field information covered by the deployed sensor nodes meets the requirement. First, we develop two effective polynomial-time algorithms to determine the deployed locations of source nodes for information 1-coverage and q-coverage of the field, respectively, without consideration of communication, where information q-coverage implies that the field information in terms of information point is covered by at least q source nodes. Also, we prove the upper bound in the theoretical for the approximate solution derived by our proposed method. Second, another polynomial-time algorithm is presented for deriving the deployed locations of relay nodes. In the theoretical, this proposed algorithm can achieve the minimized number of relay nodes. Further, the related information 1-coverage algorithms are applied in our wireless sensor network-based automatic irrigation project in precision agriculture. Experimental results show the major trade-offs of impact factors in sensor deployment and significant performance improvements achieved by our proposed method. Copyright (c) 2013 John Wiley & Sons, Ltd.

关键词： sensor deployment information coverage precision agriculture communications linear programming

来源：评论

学校读者我要写书评

暂无评论

Scheduling sensor activity for information coverage of discrete targets in sensor networks

引用

WIRELESS COMMUNICATIONS & MOBILE COMPUTING 2009年第6期9卷 745-757页

作者： Wang, Bang Chua, Kee Chaing Srinivasan, Vikram Wang, Wei Nanyang Technol Univ Intelligent Syst Ctr Singapore 637553 Singapore Natl Univ Singapore ECE Dept Singapore 117548 Singapore

In this paper, we study the problem of scheduling sensor activity to cover a set of targets with known locations such that all targets can be monitored all the time and the network can operate as long as possible. A solution to this scheduling problem is to partition all sensors into some sensor covers such that each cover can monitor all targets and the covers are activated sequentially. In this paper, we propose to provide information coverage instead of the conventional sensing disk coverage for target. The notion of information coverage is based oil estimation theory to exploit the collaborative nature of geographically distributed sensors. Due to the use of information coverage, a target that is not within the sensing disk of any single sensor can still be considered to be monitored (information covered) by the cooperation of more than one sensor. This change of the problem settings complicates the solutions compared to that by using a disk coverage model. We first define the target information coverage (TIC) problem and prove its NP-completeness. We then propose a heuristic to approximately solve our problem. Simulation results show that our heuristic is better than an existing algorithm and is close to the upper bound when only the sensing disk coverage model is used. Furthermore, simulation results also show that the network lifetime can be significantly improved by using the notion of information coverage compared with that by using the conventional definition of sensing disk coverage. Copyright (C) 2008 John Wiley & Sons, Ltd.

关键词： sensor activity scheduling information coverage sensing disk coverage information covers wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Connected sensor cover for area information coverage in wireless sensor networks

引用

INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS 2008年第11期21卷 1181-1203页

作者： Wang, Bang Chua, Kee Chaing Srinivasan, Vikram Nanyang Technol Univ Intelligent Syst Ctr Singapore 637553 Singapore Natl Univ Singapore Dept Elect & Comp Engn Singapore 117548 Singapore

coverage is an important issue in wireless sensor networks (WSNs) and is often used to measure how well a sensor field is monitored by the deployed sensors. If the area covered by a sensor can also be covered by some other sensors, this sensor can go into an energy-saving sleep active sensors with the constraints that the selected active sensors can provide complete field coverage and are completely connected. We propose to use the notion of information coverage, which is based on estimation theory to exploit the collaborative nature of WSNs, instead of using the conventional definition of coverage. Owing to the use of information coverage, a point that is not within the sensing disk of any sensor can still be considered to be covered without loss of estimation reliability. We propose a heuristic to approximately solve our problem. The basic idea is to grow a connected sensor tree to maximize the profit from the covered points of the selected sensors in each step. Simulations are used to validate the effectiveness of the proposed algorithm and the results illustrate that the number of active sensors to provide area coverage can be greatly reduced by using the notion of information coverage compared with that by using the conventional definition of coverage. Copyright (C) 2008 John Wiley & Sons, Ltd.

关键词： sensor activity scheduling information coverage connected sensor cover wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

The delay-constrained information coverage problem in mobile sensor networks: single hop case

引用

WIRELESS NETWORKS 2010年第7期16卷 1961-1973页

作者： Keung, Gabriel Y. Zhang, Qian Li, Bo Hong Kong Univ Sci & Technol Dept Comp Sci & Engn Hong Kong Hong Kong Peoples R China

In this paper, we study the delay-constrained information coverage problem in mobile sensor networks. Motivated by real application needs, our formulation takes advantage of the sensor mobility for sensing information collection, which takes place when a sensor moves into the proximity (single hop) of stationary sink nodes. To the best of our knowledge, we present the first formulation for the delay-constrained information coverage problem, which targets at optimal sink nodes placement with the objective of maximizing sensing information collection within a constrained time. We prove that this problem is NP-hard even under finite search space approximation and we develop theoretical analysis to derive its upper and lower performance bounds. We then develop approximation techniques and use simulations to verify their effectiveness.

关键词： Mobile sensor network Mobility information coverage Sink node placement

来源：评论

学校读者我要写书评

暂无评论

A practical information coverage approach in wireless sensor network

引用

information PROCESSING LETTERS 2015年第1期115卷 6-10页

作者： Yang, Hao Tang, Keming Yu, Jianjiang Zhu, Licai Yancheng Teachers Univ Sch Informat Sci & Technol Yancheng 224002 Jiangsu Peoples R China

In order to improve energy-effectiveness in wireless sensor network, in practice some sensors in observation points are selected not to gather data. In this case, the insufficient data gathered by the rest of sensors have to cover the total network so that the complete information of the whole environment could be estimated rationally, which is similar to compressive sensing. However, the process of estimation has to cost a lot of energy, which is a crucial problem. This paper proposes a practical and effective information coverage approach in which an actual constrained condition is considered for consensus estimation to reduce unnecessary energy cost reasonably. In our experiments, the method has been proved valuable and feasible. (c) 2014 Elsevier B.V. All rights reserved.

关键词： Combinatorial problems information coverage Consensus Estimation Compressive sensing Wireless sensor network

来源：评论

学校读者我要写书评

暂无评论

Deterministic deployment based on information coverage in wireless sensor networks

引用

WIRELESS COMMUNICATIONS & MOBILE COMPUTING 2014年第18期14卷 1657-1671页

作者： Zheng, Jianying Huang, Yan Wang, Yiming Xiao, Yang Soochow Univ Sch Urban Trail Transportat Suzhou Peoples R China Suzhou Vocat Univ Dept Elect Informat Engn Suzhou Peoples R China Soochow Univ Sch Elect & Informat Engn Suzhou Peoples R China Univ Alabama Dept Comp Sci Tuscaloosa AL 35487 USA

In this study, a deterministic deployment problem in wireless sensor networks is examined. On the basis of information coverage, we study equilateral triangle and square deployment strategies, and we provide the maximum distance between sensors in order to reach the required detection probability for any point in the monitoring field. First, we provide a model of the signal attenuation. On the basis of the detected signal from the K sensors, the best linear and unbiased estimation is used to estimate the signal parameter with the corresponding error. For the equilateral triangle deployment, the maximum distance between sensors is computed and provided when the received signal data from two or three sensors is used. Similarly, we have computed and supplied the maximum distance between sensors in the square deployment. Simulations are performed to show the relationship between the number of sensors and the detection probability. The simulation results show that it is not a good choice to improve the detection probability with a larger number of *** (c) 2012 John Wiley & Sons, Ltd.

关键词： wireless sensor networks information coverage deterministic deployment parameter estimation

来源：评论

学校读者我要写书评

暂无评论

Efficient scheduling of sensor activity for information coverage in wireless sensor networks

Efficient scheduling of sensor activity for information cove...

引用

2nd International Conference on Communication Systems Software and Middleware

作者： Vashistha, S. Azad, A. P. Chockalingam, A. Indian Inst Sci Dept ECE Bangalore 560012 Karnataka India

ISBN: (纸本)9781424406135

In this paper, we are concerned with algorithms for scheduling the sensing activity of sensor nodes that are deployed to sense/measure point-targets in wireless sensor networks using information coverage. Defining a set of sensors which collectively can sense a target accurately as an information cover, we propose an algorithm to obtain Disjoint Set of information Covers (DSIC), which achieves longer network life compared to the set of covers obtained using an Exhaustive-Greedy-Equalized Heuristic (EGEH) algorithm proposed recently in the literature. We also present a detailed complexity comparison between the DSIC and EGEH algorithms.

关键词： sensor activity scheduling physical coverage information coverage network lifetime

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：