Abstract: Many wireless sensor network applications require
K-coverage of the monitored area. In this paper, we propose a
scalable harmony search based algorithm in terms of execution
time, K-Coverage Enhancement Algorithm (KCEA), it attempts to
enhance initial coverage, and achieve the required K-coverage degree
for a specific application efficiently. Simulation results show that
the proposed algorithm achieves coverage improvement of 5.34%
compared to K-Coverage Rate Deployment (K-CRD), which achieves
1.31% when deploying one additional sensor. Moreover, the proposed
algorithm is more time efficient.
Abstract: In order to monitor for traffic traversal, sensors can be
deployed to perform collaborative target detection. Such a sensor
network achieves a certain level of detection performance with the
associated costs of deployment and routing protocol. This paper
addresses these two points of sensor deployment and routing algorithm
in the situation where the absolute quantity of sensors or total energy
becomes insufficient. This discussion on the best deployment system
concluded that two kinds of deployments; Normal and Power law
distributions, show 6 and 3 times longer than Random distribution in
the duration of coverage, respectively. The other discussion on routing
algorithm to achieve good performance in each deployment system
was also addressed. This discussion concluded that, in place of the
traditional algorithm, a new algorithm can extend the time of coverage
duration by 4 times in a Normal distribution, and in the circumstance
where every deployed sensor operates as a binary model.