Area Coverage Problem in Wireless Sensor Networks

Wang, “Coverage problems in sensor networks: A survey,” ACM Comput..  Yourim Yoon, Yong-Hyuk Kim, “An Efficient Genetic Algorithm for Maximum Coverage Deployment in Wireless Sensor Netw

The 1 st UTS-VNU Research School

Advanced Technologies for IoT Applications

 Input

o k: the number of sensor types

o n: the number of sensors

o n i : the number of sensors for type i (i = 1 k), such that

o r i : the sensing radius of sensor for type i (i = 1 k)

o W, H: the width and the length of the 2D domain A

respectively

 Output

o The position for each sensor node

 Objective

o Maximize the area coverage of n sensors on A (coA)

 B Wang, “Coverage problems in sensor networks: A survey,”

ACM Comput Surveys, vol 43, no 4, pp 32:1–32:53, 2011.

 Yourim Yoon, Yong-Hyuk Kim, “An Efficient Genetic Algorithm

for Maximum Coverage Deployment in Wireless Sensor Networks”, IEEE Transactions on 43.5, pp 1473-1483, 2013

 Apply to wireless sensor networks with obstacles

 Apply to dynamic wireless sensor networks

 Integrate with other objectives and constraints:

o Connectivity assuarance

o Energy optimization

Area Coverage Problem in Wireless Sensor Networks

Dinh Thi Ha Ly - Huynh Thi Thanh Binh

Modeling, Simulation and Optimization Lab School of Information Communication and Technology

Hanoi University of Science and Technology

We are interested in a new model of area coverage problem

in wireless sensor networks that is to maximize covered area

in a region of interest with a given number of sensors instead

of finding the minimum number of sensors such that the region of interest can be completely supervised.

 Propose a new function to evaluate quality of solution:

Olap

 Propose algorithms to solve this problem:

o Genetic algorithm (IGA)

o Particle Swarm Optimaztion (PSO, DPSO)

o Cuckoo Search (ICS)

o Chaotic Flower Pollination (CFPA)

 Analyse convergence of proposed algorithms

 Publication: Huynh Thi Thanh Binh, Nguyen Thi Hanh, La

Van Quan, Nilanjan Dey, Improved Cuckoo Search and

Chaotic Flower Pollination Algorithms for Maximizing Area Coverage in Wireless Sensor Networks, Neural

Computing and Applications (SCI-E Index, IF: 1.492)

Abstract Author Names and Affiliations

Results

The best solustions found by IGA (a), PSO (b), ICS (c), CFPA (d) after 30 runnings times on the largest instance

(a)

Convergence timve of IGA, DPSO, ICS and CFPA in the

same instance

30 ruuning timve of IGA, PSO, DPSO, ICS and CFPA in the

instances

(b)

Problem Statement

1

k

i i

n n







1 1

i

n k

i j

coA area c x y A

Contributions