A Novel Cluster Head Selection Method based on K-Means Algorithm for Energy Efficient Wireless Sensor Network

Park, Geon Yong; Kim, Heeseong; Jeong, Hwi Woon; Youn, Hee Yong

doi:10.1109/waina.2013.123

Cited by 66 publications

(11 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this subsection, we explain the proposed opportunistic scheduling schemes for multi-hop transmission in WSNs. In order to analyze the impacts of scheduling schemes on the secure performance, we assume that various techniques, e.g., clustering protocols [35,36], eavesdropper channel estimation [34], distributed coordination function (DCF) in IEEE 802.11 [37,38], etc., perfectly support the proposed node selection schemes as in [24,26,32,33].…”

Section: Opportunistic Scheduling Schemementioning

confidence: 99%

Exploiting Opportunistic Scheduling Schemes and WPT-Based Multi-Hop Transmissions to Improve Physical Layer Security in Wireless Sensor Networks

Shim

Nguyen

2019

Sensors

View full text Add to dashboard Cite

This paper studies the secrecy performance of wireless power transfer (WPT)-based multi-hop transmissions in wireless sensors networks (WSNs), where legitimate nodes harvest energy from multiple power beacons (PBs) to support the multi-hop secure data transmission to a destination in the presence of an eavesdropper. Specifically, the PBs not only transfer radio frequency energy to the legitimate nodes but also act as friendly jammers to protect data transmission. To improve secrecy performance, we propose two secure scheduling schemes, named minimum node selection (MNS) scheme and optimal node selection (ONS) scheme. We then evaluate the performance of the proposed schemes in terms of the exact closed-form for secrecy outage probability (SOP) and asymptotic SOP. The developed analyses are verified by Monte-Carlo simulations. The numerical results show that the ONS scheme outperforms the MNS scheme emerging as an effective protocol for secure multi-hop transmission in WSNs. Furthermore, the effects of the number of PBs, number of hops, time switching ratio, and the secure target data rate on the system performance are also investigated.

show abstract

Section: Opportunistic Scheduling Schemementioning

confidence: 99%

Exploiting Opportunistic Scheduling Schemes and WPT-Based Multi-Hop Transmissions to Improve Physical Layer Security in Wireless Sensor Networks

Shim

Nguyen

2019

Sensors

View full text Add to dashboard Cite

show abstract

“…In Ref. [10], Park et al presented an improved CH selection method based on K-means. The initial centroids are selected randomly, which results in different kinds of clusters in different runs.…”

Section: Related Workmentioning

confidence: 99%

Energy-Efficient Routing Protocol for Wireless Sensor Networks Based on Improved Grey Wolf Optimizer

Zhao¹,

Zhu²,

Aleksić³

et al. 2018

KSII TIIS

View full text Add to dashboard Cite

To utilize the energy of sensor nodes efficiently and extend the network lifetime maximally is one of the primary goals in wireless sensor networks (WSNs). Thus, designing an energy-efficient protocol to optimize the determination of cluster heads (CHs) in WSNs has become increasingly important. In this paper, we propose a novel energy-efficient protocol based on an improved Grey Wolf Optimizer (GWO), which we refer to as Fitness value based Improved GWO (FIGWO). It considers a fitness value to improve the finding of the optimal solution in GWO, which ensures a better distribution of CHs and a more balanced cluster structure. According to the distance to the CHs and the BS, sensor nodes' transmission distance are recalculated to reduce the energy consumption. Simulation results demonstrate that the proposed approach can prolong the stability period of the network in comparison to other algorithms, namely by 31.5% in comparison to SEP, and even by 57.8% when compared with LEACH protocol. The results also show that the proposed protocol performs well over the above comparative protocols in terms of energy consumption and network throughput.

show abstract

“…Geon yong Park [3] introduced K-means algorithm, where k candidate nodes are selected for CH. K-means applies greedy algorithm and clusters are not formed in globally optimized manner.…”

Section: Related Workmentioning

confidence: 99%

“…Each CH aggregates the data sent from the sensor nodes belonging to its cluster, and then transmits them to the BS. Forming the clusters, especially CH selection, is one of the most critical tasks in the management of WSNs since CHs consume much larger energy than other bodes in the network [3]. It is usually difficult to recharge or replace the sensor nodes which have limited battery capacity.…”

Section: Introductionmentioning

confidence: 99%

K Means++ based Energy Efficient Routing for WSN: A Review

Singh¹,

Singh²

2018

IJCA

View full text Add to dashboard Cite

A Wireless Sensor Network (WSN) constructs a subset of Adhoc networks. Node in the WSN have restrictions of memory, storage, processing and energy. Sensors nodes in WSN are used to measure the environmental parameters like temperature, pressure, humidity, sound, vibration etc. WSNs are assumed to be energy restrained because sensor nodes operate with small capacity DC source or may be placed such that replacement of its energy source is not possible. Due to these limitations several routing protocols have been proposed to utilize sensor's energy to prolong the life time of deployed WSN. An effective routing protocol is desirable which is able to manage communication among energy restrained sensor nodes and able to provide load in uniform way such that difference between life times of nodes is not very large. In this paper, K-means++ based routing algorithm has been implemented, Proposed algorithm selects two nodes in each cluster, one is CH and another is Twins node. K-means++ algorithm forms cluster and calculate centroid to find cluster head. In implemented routing protocol clusters are formed according to global optimization which solves the problem of local optimization of K-means. Cluster head gathers information of its respective cluster and sends to its base station. Twins node reduces the overhead of cluster head by sending gathered information to base station, so that energy dissipation in WSN will be in uniformed manner.

show abstract

A Novel Cluster Head Selection Method based on K-Means Algorithm for Energy Efficient Wireless Sensor Network

Cited by 66 publications

References 11 publications

Exploiting Opportunistic Scheduling Schemes and WPT-Based Multi-Hop Transmissions to Improve Physical Layer Security in Wireless Sensor Networks

Exploiting Opportunistic Scheduling Schemes and WPT-Based Multi-Hop Transmissions to Improve Physical Layer Security in Wireless Sensor Networks

Energy-Efficient Routing Protocol for Wireless Sensor Networks Based on Improved Grey Wolf Optimizer

K Means++ based Energy Efficient Routing for WSN: A Review

Contact Info

Product

Resources

About