On target coverage in wireless heterogeneous sensor networks with multiple sensing units

Shih, Kuei‐Ping; Chen, Hung-Chang; Chou, Chien-Min; Liu, Bo-Jun

doi:10.1016/j.jnca.2009.01.002

Cited by 42 publications

(21 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Equation (5) guarantees that each target can be covered by at least one sensor. Equation (6) ensures that each sensor cannot overspend its initially supplied energy E in all cover sets. Equation (7) means that each cover set can cover all targets.…”

Section: Problem Formulationmentioning

confidence: 99%

“…There have been a lot of efforts to solve the target coverage problem in sensor networks [5][6][7][8][9][10][11][12][13][14]. The proposed schemes or algorithms usually are distributed, and the whole network is usually divided into some sub-networks or clusters, and each sub-network is responsible for data collecting and aggregating.…”

Section: Introductionmentioning

confidence: 99%

“…However, the proposed algorithm cannot guarantee the connectivity of the network. Shih et al [6] proposed a scheme to solve the target coverage problem based on remaining energy first (EF) in HWSNs. A sensor's status is decided by its remaining energy and its neighbors' status.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Polytype target coverage scheme for heterogeneous wireless sensor networks using linear programming

Xing

Wang

2012

Wirel. Commun. Mob. Comput.

View full text Add to dashboard Cite

Sensing coverage is one of fundamental problems in wireless sensor networks. In this paper, we investigate the polytype target coverage problem in heterogeneous wireless sensor networks where each sensor is equipped with multiple sensing units and each type of sensing unit can sense an attribute of multiple targets. How to schedule multiple sensing units of a sensor to cover multiple targets becomes a new challenging problem. This problem is formulated as an integer linear programming problem for maximizing the network lifetime. We propose a novel energy‐efficient target coverage algorithm to solve this problem based on clustering architecture. Being aware of the coverage capability and residual energy of sensor nodes, the clusterhead node in each cluster schedules the appropriate sensing units of sensor nodes that are in the active status to cover multiple targets in an optimal way. Extensive simulations have been carried out to validate the effectiveness of the proposed scheme. Copyright © 2012 John Wiley & Sons, Ltd.

show abstract

Section: Problem Formulationmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Polytype target coverage scheme for heterogeneous wireless sensor networks using linear programming

Xing

Wang

2012

Wirel. Commun. Mob. Comput.

View full text Add to dashboard Cite

show abstract

“…This capability is a critical issue for security applications, such as border surveillance, forest fires monitoring, and intruding enemy planes detection [2][3][4][5][6]. Three categories of the coverage problem exist in the literature [7,8]: target coverage [9][10][11][12][13][14][15], area coverage [16][17][18][19][20][21][22][23], and barrier coverage [24][25][26][27][28][29][30]. Unlike the full coverage, barrier coverage does not necessarily cover the whole region in the WSNs.…”

Section: Introductionmentioning

confidence: 99%

Solving k‐Barrier Coverage Problem Using Modified Gravitational Search Algorithm

Zhang

Sun

2017

Mathematical Problems in Engineering

View full text Add to dashboard Cite

Coverage problem is a critical issue in wireless sensor networks for security applications. The k-barrier coverage is an effective measure to ensure robustness. In this paper, we formulate the k-barrier coverage problem as a constrained optimization problem and introduce the energy constraint of sensor node to prolong the lifetime of the k-barrier coverage. A novel hybrid particle swarm optimization and gravitational search algorithm (PGSA) is proposed to solve this problem. The proposed PGSA adopts a k-barrier coverage generation strategy based on probability and integrates the exploitation ability in particle swarm optimization to update the velocity and enhance the global search capability and introduce the boundary mutation strategy of an agent to increase the population diversity and search accuracy. Extensive simulations are conducted to demonstrate the effectiveness of our proposed algorithm.

show abstract

“…Because of limited energy of single sensor node, how to saving energy and prolong the network lifetime at the same time of meeting user sense demand is the key point of wireless sensor networks coverage control technology design. For the wild scenes, special environment like desert or battlefield, way of randomly spreading redundant nodes in designated area is often applied for initial deployment [8][9][10]. Therefore, when area coverage algorithm is being designed, both of the realization of full area coverage by wireless sensor networks, which avoids appearance of coverage holes and ensures perception service quality, and extension of network lifetime as far as possible by sleep schedule, making use of redundancy characteristic of sensor nodes, are expected.…”

Section: Introductionmentioning

confidence: 99%

Research on connectivity to Localized Area Coverage algorithm In wireless Sensor Networks

Xia¹,

Song²,

Dongying³

et al. 2012

JDCTA

View full text Add to dashboard Cite

In wireless sensor networks, the area coverage sensing technology is the one of the key foundation technologies. IT is concerned about how to prolong the network lifetime based on meeting user sensing demands. Among the study of area coverage sensing technology, localized area coverage algorithm is gradually attracting wide attention for its less traffic and lower single-node computation. At present, the existing localized area coverage algorithms mainly depends on connectivity critical condition proposed by Xing. This condition is concerned about how to improve the perceived quality to coverage full area, ignores further studying for the network node connectivity. So, this connectivity condition is from the perspective of single node connectivity, resulting in limited conditions for algorithm application. For above issues, firstly, the coverage node set connectivity is introduced for localized area coverage algorithm in this paper. Secondly, the loose connectivity critical condition to ensure coverage and connectivity is re-analyzed from the perspective of network connectivity. Finally, a circle intersection localized coverage algorithm under different conditions to maintain connectivity is designed, to extend the application scene. Simulation results show that the algorithm, under different conditions, can maintain network node connectivity on the basis of ensuring full area coverage.

show abstract

On target coverage in wireless heterogeneous sensor networks with multiple sensing units

Cited by 42 publications

References 10 publications

Polytype target coverage scheme for heterogeneous wireless sensor networks using linear programming

Polytype target coverage scheme for heterogeneous wireless sensor networks using linear programming

Solving k‐Barrier Coverage Problem Using Modified Gravitational Search Algorithm

Research on connectivity to Localized Area Coverage algorithm In wireless Sensor Networks

Contact Info

Product

Resources

About