2014 3rd Mediterranean Conference on Embedded Computing (MECO) 2014
DOI: 10.1109/meco.2014.6862696
|View full text |Cite
|
Sign up to set email alerts
|

Area coverage in wireless sensor network by using harmony search algorithm

Abstract: The area coverage is a popular problem in wireless sensor networks and many attempts in the past several years have been made to provide an optimal solution to this particular type of problem. This paper presents a novel approach to solving the area coverage problem, namely the Harmony Search optimization algorithm. The Harmony Search algorithm is an optimization technique which is often used to solve NP-complete problems, i.e. problems which deterministic approaches to solve are not efficient for. The results… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
5
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(5 citation statements)
references
References 6 publications
0
5
0
Order By: Relevance
“…Another disadvantage is that the diagram can be sensitive to changes in the position of the sensors, which can lead to inaccurate results. Also, Panov and Koceski [23] have solved the area coverage problem in WSNs using the HS algorithm. The HS algorithm determines the location and number of the optimal sensor nodes in this study.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Another disadvantage is that the diagram can be sensitive to changes in the position of the sensors, which can lead to inaccurate results. Also, Panov and Koceski [23] have solved the area coverage problem in WSNs using the HS algorithm. The HS algorithm determines the location and number of the optimal sensor nodes in this study.…”
Section: Related Workmentioning
confidence: 99%
“…The performance of the proposed method is compared with the performance of the HS [23], PSO [22], ACO [24], multiobjective GA [37], ABC [31], and hybrid PSO with DE [25] algorithms. Therefore, we considered the datasets and parameters used in these studies.…”
Section: B Datasetmentioning
confidence: 99%
“…On the other hand, PSM, which is considered more realistic and more precise than BSM, takes in practice several dependent factors instead of the sensing radius that is used in BSM. These factors have no associated uncertainty in BSM such as noises and interferences among sensors that can affect the coverage value negatively and minimize the signal intensity [61,62]. The coverage probability of PSM is shown in Figure 4 and calculated in Equation ( 12) [60].…”
Section: Categorization Of Coverage Probability Based On Psmmentioning
confidence: 99%
“…Many optimization approaches have been proposed for area coverage problems. Among them, some explore the movement-assisted sensor node deployment by using mobile nodes to improve coverage quality [7,8,9,10,11,12], and these approaches are only suitable to the scenario where the sensor node is omnidirectional.…”
Section: Related Workmentioning
confidence: 99%
“…In Ref. [11], the authors propose a harmony search optimization algorithm to solve area coverage problem. A previous study in Ref.…”
Section: Related Workmentioning
confidence: 99%