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

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

作者： Zhang, Mengyi Goupil, Alban Colas, Maxime Gelle, Guillaume Univ Reims CReSTIC Reims France

ISBN: (纸本)9781467376877

The selection of active units is an essential task for sensor networks because it allows to increase the service life of the networks while guaranteeing coverage. In this paper, we propose a fully distributed method for active units selection that automatically adapts to sensors extinction without activating unnecessary idle units. This method relies on both of the use of homology and the discrete Morse theory.

关键词： coverage problem sensor's activation Homology groups distributed algorithm discrete vector field

来源：评论

学校读者我要写书评

暂无评论

Effects of UAV Mobility Patterns on Data Collection in Wireless Sensor Networks 4

Effects of UAV Mobility Patterns on Data Collection in Wirel...

引用

IEEE Int Conference Commun Networks Satellite

作者： Rashed, Sarmad Soyturk, Mujdat Marmara Univ Dept Comp Engn Istanbul Turkey

ISBN: (纸本)9781467382496

Sensor nodes in a Wireless Sensor Network (WSN) can be dispersed over a remote sensing area e.g. the regions that cannot be accessed by human beings (inaccessible regions). In such kind of networks, data collection becomes one of the major issues. Getting connected to each sensor node and retrieving the information in time introduces new challenges. Mobile sink usage, especially the Unmanned Aerial Vehicle (UAV), is the most convenient approach to cover the area and access each sensor node in such a large scale WSN. However, the operation of the UAV depends on some parameters such as endurance time, altitude, speed, radio type in use, and the path. In this paper, we explore various mobility patterns of UAV that follow different paths to sweep the playground in order to seek the best area coverage with maximum number of covered nodes in less amount of time needed by the mobile sink. A realistic simulation environment is used in order to compare and evaluate the performance of the system. We present the performance results for the explored UAV mobility patterns. The results are very useful to present the tradeoff between maximizing the covered nodes and minimizing the operation time for choosing the appropriate mobility pattern.

关键词： unmanned aerial vehicle UAV cluster head mobility pattern coverage problem utilization quality of service

来源：评论

学校读者我要写书评

暂无评论

Optimizing Roadside Advertisement Dissemination in Vehicular Cyber-Physical Systems 35

Optimizing Roadside Advertisement Dissemination in Vehicular...

引用

2015 IEEE 35th International Conference on Distributed Computing Systems

作者： Zheng, Huanyang Wu, Jie Temple Univ Dept Comp & Informat Sci Philadelphia PA 19122 USA

ISBN: (纸本)9781467372145

In this paper, we address a promising application in the Vehicular Cyber-Physical Systems (VCPS) called roadside advertisement dissemination. Its application involves three elements: the drivers in the vehicles, Roadside Access Points (RAPs), and shopkeepers. The shopkeeper wants to attract as many customers as possible, through using RAPs to disseminate advertisements to the passing vehicles. Upon receiving an advertisement, the driver may detour towards the shop, depending on the detour distance. Given a fixed number of RAPs and the traffic distribution, our goal is to optimize the RAP placement for the shopkeeper to maximally attract potential customers. This application is a non-trivial extension of traditional coverage problems, the difference being that we use RAPs to cover the traffic flows. RAP placement algorithms may pose complex trade-offs. If we place RAPs at locations that can provide small detour distances to attract more customers, these locations may not necessarily be located in heavy traffic regions. While heavy traffic regions cover more flows, they can cause large detour distances, making shopping less attractive to customers. To balance this tradeoff, novel RAP placement algorithms are proposed. Since real-world traffic distributions exhibit unique patterns, here we further consider the Manhattan grid scenario and then propose corresponding near-optimal solutions. Real trace-driven experiments validate the competitive performance of the proposed algorithms.

关键词： Vehicular cyber-physical systems advertisement dissemination placement coverage problem

来源：评论

学校读者我要写书评

暂无评论

Self-Deployment Algorithms for coverage problem in a Network of Mobile Sensors with Unidentical Sensing Ranges

Self-Deployment Algorithms for Coverage Problem in a Network...

引用

IEEE Global Telecommunications Conference (GLOBECOM 2010)

作者： Mahboubi, Hamid Moezzi, Kaveh Aghdam, Amir G. Sayrafian-Pour, Kamran Marbukh, Vladimir Concordia Univ Dept Elect & Comp Engn 1455 Maisonneuve Blvd WEV005-139 Montreal PQ H3G 1M8 Canada Natl Inst Stand & Technol Gaithersburg MD 20899 USA

ISBN: (纸本)9781424456383

In this paper, efficient sensor deployment algorithms are proposed to improve the coverage area in the target field. The proposed algorithms calculate the position of the sensors iteratively, based on the existing coverage holes in the target field. The multiplicatively weighted Voronoi (MW-Voronoi) diagram is used to discover the coverage holes corresponding to different sensors with different sensing ranges. Under the proposed procedures, the sensors move in such a way that the coverage holes in the target field are reduced. Simulation results are provided to demonstrate the effectiveness of the deployment schemes proposed in this paper.

关键词： Voronoi diagram computational geometry coverage problem mobile sensors network self-deployment algorithms sensor placement unidentical sensing ranges wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Adaptive and distributed sensor activation in WSN

Adaptive and distributed sensor activation in WSN

引用

International Conference on Wireless Communications and Signal Processing

作者： Mengyi Zhang Alban Goupil Maxime Colas Guillaume Gelle CReSTIC University of Reims Champagne-Ardenne

ISBN: (纸本)9781467376884

关键词： coverage problem Sensor's activation Homology groups Distributed algorithm Discrete vector field

来源：评论

学校读者我要写书评

暂无评论

Distributed clustering approach for UAV integrated wireless sensor networks

引用

INTERNATIONAL JOURNAL OF AD HOC AND UBIQUITOUS COMPUTING 2014年第1-3期15卷 106-120页

作者： Okcu, Huseyin Soyturk, Mujdat Naval Sci & Engn Inst TR-93942 Istanbul Turkey Marmara Univ Dept Comp Engn TR-34722 Istanbul Turkey

Wireless sensor networks (WSNs) consist of battery-limited sensor nodes which have the ability of sensing the environment, communicating with other nodes and processing the data. Large number of sensor node deployment over a geographical area imposes some constraints on the retrieval of the data. The use of mobile sinks (e. g., unmanned aerial vehicle, UAV) is an effective solution method for such large-scale networks. However, depending on the path and altitude of the UAV, and the type of radios in use, coverage problem arises where some nodes cannot get connected to the UAV. In this paper, the coverage problem is examined where UAV is used as mobile sink node. On the basis of our analysis, a dynamic and distributed clustering approach is proposed. Evaluations are performed with a realistic simulation environment. Performance results show that proposed approach reduces the energy-consumption and construct more stable and well balanced clusters that connect the uncovered nodes to the UAV.

关键词： WSNs wireless sensor networks energy efficiency network lifetime clustering UAV unmanned aerial vehicle RSS received signal strength RSSI received signal strength indicator coverage problem

来源：评论

学校读者我要写书评

暂无评论

Enhanced algorithms for deploying the minimum sensors to construct a wireless sensor network having full coverage of critical square grids

引用

WIRELESS NETWORKS 2014年第2期20卷 331-343页

作者： Liu, Bing-Hong Su, Kuo-Wen Natl Kaohsiung Univ Appl Sci Dept Elect Engn Kaohsiung 80778 Taiwan

With the rapid technological development of sensors, many applications have been designed to use wireless sensor networks to monitor a certain area and provide quality-of-service guarantees. Therefore, the coverage problem had an important issue for constructing wireless sensor networks. Recently, a coverage problem of constructing a minimum size wireless sensor network to fully cover critical squares in a sensor field, termed CRITICAL-SQUARE-GRID coverage, has received much attention. CRITICAL-SQUARE-GRID coverage is shown to be NP-Complete, and an approximation algorithm, termed Steiner-tree-based critical grid covering algorithm (STBCGCA), is proposed accordingly. In STBCGCA, a sensor is selected to cover critical squares only if at least one of the critical squares is fully covered by the sensor. However, a critical square grid can be cooperatively covered by two or more sensors;that is, one sensor covers one part of the critical square, and the other sensors cover the other part of the critical square. This motivates us to propose two efficient algorithms based on STBCGCA, termed critical-grid-partitioned (CGP-STBCGCA) and reference-point-covered (RPC-STBCGCA), that select sensors that can cooperatively cover critical squares in an attempt to minimize the size of the wireless sensor network. The theoretical analysis shows that sensors deployed by CGP-STBCGCA and RPC-STBCGCA can form a connected wireless sensor network that fully covers all critical grids. In addition, a performance guarantee for CGP-STBCGCA is provided. Simulation results show that the ratio of the average number of deployed sensors in STBCGCA to that in CGP-STBCGCA and RPC-STBCGCA in about 90 % of the cases was between 1.08 and 2.52 for CRITICAL-SQUARE-GRID coverage.

关键词： Wireless sensor network coverage problem NP-Complete Sensor deployment Approximation algorithm

来源：评论

学校读者我要写书评

暂无评论

Efficient Power Conservation Mechanism in Spline Function Defined WSN Terrain

引用

IEEE SENSORS JOURNAL 2014年第3期14卷 853-864页

作者： Tseng, Fan-Hsun Cho, Hsin-Hung Chou, Li-Der Chao, Han-Chieh Natl Cent Univ Dept Comp Sci & Informat Engn Tao Yuan 32001 Taiwan Natl Ilan Univ Dept Comp Sci & Informat Engn Ilan 26047 Taiwan Natl Ilan Univ Dept Elect Engn Ilan 26047 Taiwan Natl Dong Hwa Univ Dept Elect Engn Hualien 97401 Taiwan

coverage is a vital issue that ensures that basic functions are available in wireless sensor networks (WSNs). These functions provide communications during emergency rescue or in war environments. Sensor nodes must be dispersed and survive in place for a long time in order to accurately monitor all events. However, sensor nodes rely on limited battery energy restricted to the lifetime of the entire network. When few sensor nodes are awake during an epoch, the entire network lifetime becomes longer. This implies that the coverage problem must be solved based on the energy efficiency issue. In order to strengthen the coverage ratio with a limited number of sensor nodes, practical coverage algorithms were proposed in the existing researches but investigated in a 2-D plane, which is not suitable for a realistic environment. Few researchers have investigated the WSN coverage problem for a 3-D space. The actual terrain is rugged and bumpy that prevents deploying sensor nodes in three-dimension space. In this paper, we consider the field of interest as a complex surface but also use the spline function to obtain factual information about a complex surface. Furthermore, dynamic programming is utilized to optimize the sensing radius for reducing the power consumption.

关键词： Wireless sensor network coverage problem power consumption Spline function dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Game Theory Based Mobile Wireless Sensor Network for Area coverage

Game Theory Based Mobile Wireless Sensor Network for Area Co...

引用

International Conference on High Performance Computing and Applications (ICHPCA)

作者： Das, Tathagata Roy, Sarbani Alumnus Software Ltd Kolkata India Jadavpur Univ Dept Comp Sci & Engn Kolkata India

ISBN: (纸本)9781479959587

In the present scenario, there are substantial amount of applications where mobile wireless sensor network (MWSN) would be preferred over static wireless sensor network. coverage is one of those areas where MWSN provides better solution. coverage in static WSN depends on the initial deployment strategy whereas in MWSN, mobility of sensor nodes can be utilized to enhance the coverage of the network. One of the fundamental problems of MWSN is how to coordinate these mobile sensors in such a way that they can move together to accomplish the given task. Here, we study a generalized case of this problem. In this paper, we present a game theory inspired coordination based motion control (GT-CBMC) scheme where all mobile nodes form a group such that they cover an area by exchanging some key information between themselves. This is a continuation of our previous work on coordination based motion control (CBMC). The objective of the proposed scheme is to minimize the travel distance of each sensor node. The concept of cooperative game theory is used here. In this scheme, mobile sensors form a co-operative group and movement of one sensor influences the movements of its neighbors. Objective of this cooperative group is to minimize the overlap in the coverage path of sensor nodes. NS-3 simulation shows the effectiveness of the scheme. The proposed scheme is compared CBMC, random way-point mobility model (RWP) and three other variants of RWP.

关键词： Mobile Wireless Sensor Network (MWSN) coverage problem Cooperative Game Theory Coalition Motion NS-3

来源：评论

学校读者我要写书评

暂无评论

Adaptive and distributed homology computation with application to large scale sensor networks 6

Adaptive and distributed homology computation with applicati...

引用

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

作者： Zhang, Mengyi Goupil, Alban Colas, Maxime Gelle, Guillaume Univ Reims CReSTIC F-51100 Reims France

ISBN: (纸本)9781479973392

The homology groups provide useful information about a space. In several applications, including sensor networks, a combinatorial space is built to reflect the data and their relations about a specific topic to be analyzed. Hence the computation of the homology groups is of prime interest. However, the combinatorial space may vary and the computation of its homology groups becomes more difficult. This paper proposes an adaptive algorithm which updates incrementally the homology groups, and because it uses mostly small local computations, it is inherently well adapted to large-scale network. In the second part of the paper, the algorithm is developed and applied to the sensing coverage problem in a sensor networks. Because of its structure, the algorithm is inherently distributed.

关键词： Homology groups distributed algorithm coverage problem discrete vector field

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：