An Optimization Algorithm for Barrier Coverage in Mobile Sensor Networks

2014 ◽  
Vol 926-930 ◽  
pp. 3485-3488
Author(s):  
Hui Lin Wang
Keyword(s):  
Homeland Security ◽  
Mobile Sensor Networks ◽  
Critical Issue ◽  
Sensor Nodes ◽  
Mobile Sensors ◽  
Barrier Coverage ◽  
Mobile Sensor ◽  
Heterogeneous Sensors ◽  
Security Applications ◽  
Simulation Results

Barrier coverage of heterogeneous sensors with randomly deployed is a critical issue in military and homeland security applications. In this paper we study how to exploit sensor mobility to improve barrier coverage. We presented an efficient algorithm to relocate mobile sensors accord to line so as to improve barrier coverage. The algorithm firstly scans whole barrier and finds out barrier gaps. Then it relocates mobile sensor nodes to fill the gaps with energy consumption limited. Simulation results show that the algorithms can effectively improve the barrier coverage.

scholarly journals Towards an Optimal Energy Consumption for Unattended Mobile Sensor Networks through Autonomous Sensor Redeployment

2014 ◽  
Vol 2014 ◽  
pp. 1-12 ◽  
Author(s):  
Jian Chen ◽  
Jie Jia ◽  
Yingyou Wen ◽  
Dazhe Zhao
Keyword(s):  
Energy Consumption ◽  
Sensor Networks ◽  
Mathematical Problem ◽  
Mobile Sensor Networks ◽  
Sensor Nodes ◽  
Target Area ◽  
Mobile Sensor ◽  
Energy Hole ◽  
Autonomous Sensor ◽  
Optimal Node

Energy hole is an inherent problem caused by heavier traffic loads of sensor nodes nearer the sink because of more frequent data transmission, which is strongly dependent on the topology induced by the sensor deployment. In this paper, we propose an autonomous sensor redeployment algorithm to balance energy consumption and mitigate energy hole for unattended mobile sensor networks. First, with the target area divided into several equal width coronas, we present a mathematical problem modeling sensor node layout as well as transmission pattern to maximize network coverage and reduce communication cost. And then, by calculating the optimal node density for each corona to avoid energy hole, a fully distributed movement algorithm is proposed, which can achieve an optimal distribution quickly only by pushing or pulling its one-hop neighbors. The simulation results demonstrate that our algorithm achieves a much smaller average moving distance and a much longer network lifetime than existing algorithms and can eliminate the energy hole problem effectively.

Coverage Control for Mobile Sensor Networks on a Circle

2014 ◽  
Vol 02 (03) ◽  
pp. 243-248 ◽  
Author(s):  
Cheng Song ◽  
Gang Feng
Keyword(s):  
Sensor Networks ◽  
Mobile Agents ◽  
Mobile Sensor Networks ◽  
Mobile Sensors ◽  
Mobile Sensor ◽  
Coverage Problem ◽  
Control Laws ◽  
Coverage Control ◽  
Order Preservation ◽  
Multi Agent

This paper investigates the coverage problem for mobile sensor networks on a circle. The goal is to minimize the largest distance from any point on the circle to its nearest sensor while preserving the mobile sensors' order. The coverage problem is translated into a multi-agent consensus problem by showing that the largest distance from any point to its nearest sensor is minimized if the counterclockwise distance between each sensor and its right neighbor reaches a consensus. Distributed control laws are also developed to drive the mobile agents to the optimal configuration with order preservation. Simulation results illustrate the effectiveness of the proposed control laws.

scholarly journals Energy-efficient non-linear k-barrier coverage in mobile sensor network

2020 ◽  
Vol 17 (3) ◽  
pp. 737-758
Author(s):  
Zijing Ma ◽  
Shuangjuan Li ◽  
Longkun Guo ◽  
Guohua Wang
Keyword(s):  
Sensor Network ◽  
Mobile Sensors ◽  
Barrier Coverage ◽  
Force Model ◽  
Mobile Sensor ◽  
Mobile Sensor Network ◽  
Virtual Force ◽  
Straight Line ◽  
Non Linear ◽  
Single Sensor

K-barrier coverage is an important coverage model for achieving robust barrier coverage in wireless sensor networks. After initial random sensor deployment, k-barrier coverage can be achieved by moving mobile sensors to form k barriers consisting of k sensor chains crossing the region. In mobile sensor network, it is challenging to reduce the moving distances of mobile sensors to prolong the network lifetime. Existing work mostly focused on forming linear barriers, that is the final positions of sensors are on a straight line, which resulted in large redundant movements. However, the moving cost of sensors can be further reduced if nonlinear barriers are allowed, which means that sensors? final positions need not be on a straight line. In this paper, we propose two algorithms of forming non-linear k barriers energy-efficiently. The algorithms use a novel model, called horizontal virtual force model, which considers both the euclidean distance and horizontal angle between two sensors. Then we propose two barrier forming algorithms. To construct a barrier, one algorithm always chooses the mobile sensor chain with the largest horizontal virtual force and then flattens it, called sensor chain algorithm. The other chooses the mobile sensor with the largest horizontal virtual force to construct the barrier, other than the mobile sensor chain, called single sensor algorithm. Simulation results show that the algorithms significantly reduce the movements of mobile sensors compared to a linear k-barrier coverage algorithm. Besides, the sensor chain algorithm outperforms the single sensor algorithm when the sensor density becomes higher.

Graph Intersection-Based Benchmarking Algorithm for Maximum Stability Data Gathering Trees in Wireless Mobile Sensor Networks

2014 ◽  
pp. 433-458
Author(s):  
Natarajan Meghanathan ◽  
Philip Mumford
Keyword(s):  
Sensor Networks ◽  
Spanning Trees ◽  
Data Gathering ◽  
Mobile Sensor Networks ◽  
Sensor Nodes ◽  
Mobile Sensor ◽  
Topology Changes ◽  
Maximum Stability ◽  
Wireless Mobile ◽  
Data Gathering Tree

The authors propose a graph intersection-based benchmarking algorithm to determine the sequence of longest-living stable data gathering trees for wireless mobile sensor networks whose topology changes dynamically with time due to the random movement of the sensor nodes. Referred to as the Maximum Stability-based Data Gathering (Max.Stable-DG) algorithm, the algorithm assumes the availability of complete knowledge of future topology changes and is based on the following greedy principle coupled with the idea of graph intersections: Whenever a new data gathering tree is required at time instant t corresponding to a round of data aggregation, choose the longest-living data gathering tree from time t. The above strategy is repeated for subsequent rounds over the lifetime of the sensor network to obtain the sequence of longest-living stable data gathering trees spanning all the live sensor nodes in the network such that the number of tree discoveries is the global minimum. In addition to theoretically proving the correctness of the Max.Stable-DG algorithm (that it yields the lower bound for the number of discoveries for any network-wide communication topology like spanning trees), the authors also conduct exhaustive simulations to evaluate the performance of the Max.Stable-DG trees and compare to that of the minimum-distance spanning tree-based data gathering trees with respect to metrics such as tree lifetime, delay per round, node lifetime and network lifetime, under both sufficient-energy and energy-constrained scenarios.

scholarly journals Cognitive routing optimization protocol based on multiple channels in wireless sensor networks

2020 ◽  
Vol 16 (4) ◽  
pp. 155014772091451 ◽  
Author(s):  
Shuguang Deng ◽  
Buwen Cao ◽  
Xiang Xiao ◽  
Hua Qin ◽  
Bing Yang
Keyword(s):  
Sensor Networks ◽  
Network Lifetime ◽  
Large Scale ◽  
Mobile Sensor Networks ◽  
Network Throughput ◽  
Sensor Nodes ◽  
Multiple Channels ◽  
Mobile Sensor ◽  
Substantial Impact ◽  
Wireless Mobile

With the development of modern communication, available spectrum resources are becoming increasingly scarce, which reduce network throughput. Moreover, the mobility of nodes results in the changes of network topological structure. Hence, a considerable amount of control information is consumed, which causes a corresponding increase in network power consumption and exerts a substantial impact on network lifetime. To solve the real-time transmission problem in large-scale wireless mobile sensor networks, opportunistic spectrum access is applied to adjust the transmission power of sensor nodes and the transmission velocity of data. A cognitive routing and optimization protocol based on multiple channels with a cross-layer design is proposed to study joint optimal cognitive routing with maximizing network throughput and network lifetime. Experimental results show that the cognitive routing and optimization protocol based on multiple channels achieves low computational complexity, which maximizes network throughput and network lifetime. This protocol can be also effectively applied to large-scale wireless mobile sensor networks.

Maximizing the Lifetime of Sliding Wireless Sensors in Barrier Coverage

2012 ◽  
Vol 157-158 ◽  
pp. 503-506 ◽  
Author(s):  
Tao Yang ◽  
Pan Guo Fan ◽  
De Jun Mu
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Network Lifetime ◽  
Wireless Sensors ◽  
Specific Area ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Barrier Coverage ◽  
Coverage Ratio ◽  
Simulation Results

Wireless sensor network is always deployed in specific area for intrusion detection and environmental monitoring. The sensor nodes suffer mostly from their limited battery capacity.Maximizing the lifetime of the entire networks is mainly necessary considered in the design. Sliding the sensors in different barriers under the optimal barrier construction is a good solution for both maximizing network lifetime and providing predetermined coverage ratio. The simulation results demonstrate that the scheme can effectively reduce the energy consumption of the wireless sensor network and increase the network lifetime.

Location-Based Performance Tuning in Mobile Sensor Networks

2013 ◽  
pp. 30-38 ◽  
Author(s):  
Vladimir I. Zadorozhny
Keyword(s):  
Sensor Networks ◽  
Mobile Sensor Networks ◽  
Sensor Nodes ◽  
Performance Tuning ◽  
Mobile Sensor ◽  
Mobile Nodes ◽  
The Past ◽  
Mission Critical

The author of this chapter considers the location-based approach for performance tuning that significantly facilitates the challenge of utilizing Mobile Sensor Networks. The authors introduce mobile nodes that can be deployed in conjunction with stationary sensor nodes to perform mission critical surveillance and monitoring tasks. It details the past advances in this field and discusses other approaches to this challenge.

scholarly journals On virtual-force algorithms for coverage-optimal node deployment in mobile sensor networks via the two-dimensional Yukawa crystal

2019 ◽  
Vol 15 (9) ◽  
pp. 155014771986488
Author(s):  
Rongxin Tang ◽  
Xin Qian ◽  
Xiangyu Yu
Keyword(s):  
Sensor Networks ◽  
Crystalline Structure ◽  
Pair Correlation ◽  
Minimum Energy ◽  
Mobile Sensor Networks ◽  
Fixed Number ◽  
Sensor Nodes ◽  
Mobile Sensor ◽  
Node Deployment ◽  
Virtual Force

As theoretical proof has shown that a hexagonal topology can obtain maximal coverage with a fixed number of sensor nodes, node deployment for mobile sensor networks has the objective of forming a hexagonal network topology while consuming minimum energy. Using virtual-force algorithms to move initially randomly distributed nodes into a target topology is one of the widely studied methods for achieving this goal. In this work, a novel virtual-force algorithm based on physical laws in a dusty plasma system (i.e. VFA-DP) was applied within a mobile sensor network deployment scenario. The VFA-DP force has a central attracting force which can provide a screening effect via exponential decay. Here, to evaluate how perfect the final grids become from virtual-force algorithms, we introduce a performance metric based on the pair correlation function in a crystalline structure. Via simulation studies, we determined that the topology resulting from the VFA-DP is much closer to a hexagon. The analysis also indicated that the VFA-DP converges faster than another virtual-force algorithm based on the Lennard-Jones potential (VFA-LJ), resulting in lower communication-related energy costs in real deployment scenarios. The method developed in this article is derived from studies of crystalline structure from condensed matter physics and shows clear evidence of when the regular lattice is ready. It will provide some guidance for engineering by aiding deployment in complex geometric areas or those recovering from disaster.

Sign in / Sign up

Export Citation Format

Share Document