2016
DOI: 10.1016/j.eswa.2016.04.016
|View full text |Cite
|
Sign up to set email alerts
|

Multi objective clustering for wireless sensor networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
18
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 45 publications
(18 citation statements)
references
References 14 publications
0
18
0
Order By: Relevance
“…The experimental results showed the proposed approach achieved competitive performance compared to the standard discrete multi‐objective particle swarm optimization. Hacioglu, Kand, and Sesli () employed NSGA‐II with seven objective functions for clustering routes in wireless sensor networks. Heloulou, Radjef, and Kechadi () proposed a game‐theoretic model for multi‐objective clustering.…”
Section: Meta‐heuristic Multi‐ and Many‐objective Algorithms Applied mentioning
confidence: 99%
“…The experimental results showed the proposed approach achieved competitive performance compared to the standard discrete multi‐objective particle swarm optimization. Hacioglu, Kand, and Sesli () employed NSGA‐II with seven objective functions for clustering routes in wireless sensor networks. Heloulou, Radjef, and Kechadi () proposed a game‐theoretic model for multi‐objective clustering.…”
Section: Meta‐heuristic Multi‐ and Many‐objective Algorithms Applied mentioning
confidence: 99%
“…Wireless sensor nodes are generally operated on internal power source like batteries often in isolated environments where batteries cannot be recharged, and battery outage can cause sensor node's disconnection from the network. Sensor nodes consume most of their energy in communicating with other nodes [2] [7]. It is pertinent to optimize the data communications among sensor nodes for effective and efficient use of resources, which are albeit limited, to enhance network lifetime [7].…”
Section: Introductionmentioning
confidence: 99%
“…Chu et al [17] proposed a distributed cooperative topology control and adaptation algorithm to achieve the extend of network lifetime. Hacioglu et al [18] presented a clustering-based routing methodology, which minimized the communication costs among clusters and maximized the node quantity in each cluster, and NSGA-II [19] was combined to select excellent solutions. However, all these studies only explored the case of 2D plane.…”
Section: Introductionmentioning
confidence: 99%