2013
DOI: 10.1016/j.engappai.2012.05.018
|View full text |Cite
|
Sign up to set email alerts
|

Multi-objective node deployment in WSNs: In search of an optimal trade-off among coverage, lifetime, energy consumption, and connectivity

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
75
0
4

Year Published

2013
2013
2022
2022

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 137 publications
(79 citation statements)
references
References 23 publications
0
75
0
4
Order By: Relevance
“…The aim of the evolutionarybased approaches reported in [19][20][21][22][23][24][25] is to dynamically cluster the sensor nodes in the setup phase in such a way that some criteria (e.g., energy consumption, clustering distances, etc.,) to be optimized. For nodes, there are totally 2 − 1 different solutions, where in the every solution, each node can be selected as a cluster head or not.…”
Section: -14 Aslpr (Application-specific Low Power Routing)mentioning
confidence: 99%
See 1 more Smart Citation
“…The aim of the evolutionarybased approaches reported in [19][20][21][22][23][24][25] is to dynamically cluster the sensor nodes in the setup phase in such a way that some criteria (e.g., energy consumption, clustering distances, etc.,) to be optimized. For nodes, there are totally 2 − 1 different solutions, where in the every solution, each node can be selected as a cluster head or not.…”
Section: -14 Aslpr (Application-specific Low Power Routing)mentioning
confidence: 99%
“…Recently, evolutionary algorithms have attracted attentions from researchers to develop clustering protocols in wireless sensor networks [19][20][21][22][23][24][25][26][27]. The aim of the evolutionarybased approaches reported in [19][20][21][22][23][24][25] is to dynamically cluster the sensor nodes in the setup phase in such a way that some criteria (e.g., energy consumption, clustering distances, etc.,) to be optimized.…”
Section: -14 Aslpr (Application-specific Low Power Routing)mentioning
confidence: 99%
“…Cardei et al model the solution as the maximum set covers problem and design two heuristics that efficiently compute the sets, using linear programming and a greedy approach [8]. In [22] the sensor node deployment task has been formulated as a constrained multiobjective optimization problem where the aim is to find a deployed sensor node arrangement to maximize the area of coverage, minimize the net energy consumption, maximize the network lifetime, and minimize the number of deployed sensor nodes while maintaining connectivity between each sensor node and the sink node for proper data transmission.…”
Section: Related Workmentioning
confidence: 99%
“…The application of linear programming in coverage problem focuses on point (or target) coverage, where the objective is to cover a set of points (targets) [6,8,[20][21][22]. Zhao and Gurusamy consider the connected target coverage (CTC) problem with the objective of maximizing the network lifetime by scheduling sensors into multiple sets, each of which can maintain both target coverage and connectivity.…”
Section: Related Workmentioning
confidence: 99%
“…Network reliability is based on the node deployment [11,12], localization [13], communication protocol [14], and energy-aware routing protocols. In particular, transporting the required information in time is a challenging task in the wireless sensor network because of time constraints.…”
Section: Introductionmentioning
confidence: 99%