scholarly journals Sensor Node Activation Using Bat Algorithm for Connected Target Coverage in WSNs

Sensors ◽  
2020 ◽  
Vol 20 (13) ◽  
pp. 3733
Author(s):  
Jaemin Kim ◽  
Younghwan Yoo

This paper proposes a sensor node activation method using the nature-inspired algorithm (NIA) for the target coverage problem. The NIAs have been used to solve various optimization problems. This paper formulates the sensor target coverage problem into an object function and solves it with an NIA, specifically, the bat algorithm (BA). Although this is not the first attempt to use the BA for the coverage problem, the proposed method introduces a new concept called bat couple which consists of two bats. One bat finds sensor nodes that need to be activated for sensing, and the other finds nodes for data forwarding from active sensor nodes to a sink. Thanks to the bat couple, the proposed method can ensure connectivity from active sensor nodes to a sink through at least one communication path, focusing on the energy efficiency. In addition, unlike other methods the proposed method considers a practical feature of sensing: The detection probability of sensors decreases as the distance from the target increases. Other methods assume the binary model where the success of target detection entirely depends on whether a target is within the threshold distance from the sensor or not. Our method utilizes the probabilistic sensing model instead of the binary model. Simulation results show that the proposed method outperforms others in terms of the network lifetime.

2014 ◽  
Vol 8 (1) ◽  
pp. 567-572
Author(s):  
Fang Zhao

In order to reduce the algorithm complexity of the target coverage problem in Wireless Sensor Network, three kinds of approaches are designed to decrease the network scale, that is, one is deleting the redundant sensor nodes, another is removing the redundant targets, and the third is decomposing the target coverage graph into multiple independent sub graphs. This paper proves that the three approaches are correct, and presents the Construct Independent Sub Graph Algorithm( CISGA) to divide target coverage graph. Experiment results show that CISGA can reduce 30% of network scale and greatly reduce the algorithm complexity of target coverage problem.


2012 ◽  
Vol 8 (10) ◽  
pp. 254318 ◽  
Author(s):  
Xiu Deng ◽  
Jiguo Yu ◽  
Dongxiao Yu ◽  
Congcong Chen

Area coverage is one of the key issues for wireless sensor networks. It aims at selecting a minimum number of sensor nodes to cover the whole sensing region and maximizing the lifetime of the network. In this paper, we discuss the energy-efficient area coverage problem considering boundary effects in a new perspective, that is, transforming the area coverage problem to the target coverage problem and then achieving full area coverage by covering all the targets in the converted target coverage problem. Thus, the coverage of every point in the sensing region is transformed to the coverage of a fraction of targets. Two schemes for the converted target coverage are proposed, which can generate cover sets covering all the targets. The network constructed by sensor nodes in the cover set is proved to be connected. Compared with the previous algorithms, simulation results show that the proposed algorithm can prolong the lifetime of the network.


Author(s):  
Purnima Khuntia ◽  
Prasant Kumar Pattnaik

Wireless Sensor Network is an emerging field that is achieving much importance due to its immense contribution in varieties of target specific applications. One of the active issues is Target Coverage that deals with the coverage of a specific set of targets. Static sensor nodes are being deployed in a random manner to monitor the required targets and collect as much information as possible. In this Paper we have presented an overview of WSN and some of the strategies of the Target Coverage Problem.


2012 ◽  
Vol 2012 ◽  
pp. 1-9 ◽  
Author(s):  
S. Mini ◽  
Siba K. Udgata ◽  
Samrat L. Sabat

Solving coverage problem alone is not adequate in a wireless sensor network, since data has to be transmitted to the base station. This leads to the lookout for an energy efficient method to solve connected coverage problem. This paper addresses M-connected (each sensor node will have at least M other sensor nodes within its communication range) target coverage problem in wireless sensor networks, where the required level of connectivity and coverage may be high or low as required. We propose a heuristic for M-connected target coverage problem, where initially a cover is decided and later on it is checked for M-connectivity. M-connectivity for simple coverage, k-coverage, and Q-coverage is focussed on in this paper. We use a Low-Energy Adaptive Clustering Hierarchy (LEACH) inspired model, where a cluster is considered as a set of sensor nodes satisfying M-connectivity and required level of coverage. It is enough if one among these nodes transmits the monitored information to the base station. When the required level of coverage are high, chances of nodes being connected in the cover is high. Simulation results show that our proposed method can achieve better results than Communication Weighted Greedy Cover (CWGC).


IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 74315-74325 ◽  
Author(s):  
Manju ◽  
Samayveer Singh ◽  
Sandeep Kumar ◽  
Anand Nayyar ◽  
Fadi Al-Turjman ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document