• International Journal of Internet, Broadcasting and Communication
• /
• v.9 no.4
• /
• pp.51-58
• /
• 2017

This paper deals with the improvement of cluster head selection method in L-SEP for heterogeneous nodes among hierarchical routing protocols of wireless sensor network. Wireless sensor networks are classified into homogeneous and heterogeneous network. In heterogeneous network, SEP, L-SEP are mainly used because cluster head selection probability is different depending on node type. But, since protocol based on SEP has different cluster head selection probabilities depending on the node type, clusters that transmit data inefficiently can be formed. to improve this, it is necessary to select the cluster head that minimizes the transmission distance of member node and the cluster head. Therefore, we propose a protocol that improve the cluster head selection method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.6B
• /
• pp.342-349
• /
• 2007

Clustering protocol of Wireless sensor networks(WSNs) not only reducing the volume of inter-node communication by the nodes's data aggreation but also extending the nodes's sleep times by cluster head's TDMA-schedule coordination. In order to extend network lifetime of WSNs, we propose ECS algorithm to select cluster-head using three variables. It consists of initial and current energy of nodes, round information and total numbers which have been selected as cluster head until current round.

• Journal of information and communication convergence engineering
• /
• v.22 no.1
• /
• pp.1-6
• /
• 2024

Energy efficiency in wireless sensor networks (WSNs) is a critical issue because batteries are used for operation and communication. In terms of scalability, energy efficiency, data integration, and resilience, WSN-cluster-based routing algorithms often outperform routing algorithms without clustering. Low-energy adaptive clustering hierarchy (LEACH) is a cluster-based routing protocol with a high transmission efficiency to the base station. In this paper, we propose an energy consumption model for LEACH and compare it with the existing LEACH, advanced LEACH (ALEACH), and power-efficient gathering in sensor information systems (PEGASIS) algorithms in terms of network lifetime. The energy consumption model comprises energy-sensitive cluster formation and a cluster head selection technique. The setup and steady-state phases of the proposed model are discussed based on the cluster head selection. The simulation results demonstrated that a low-energy-consumption network was introduced, modeled, and validated for LEACH.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.12
• /
• pp.5865-5872
• /
• 2011

Multi-hop communication in clustering system is the technique that forms the cluster to aggregate the sensing data and transmit them to base station through midway cluster head. Cluster head around base station send more packet than that of far from base station. Because of this hot spot problem occurs and cluster head around base station increases energy consumption. In this paper, I propose a cluster group head selection using trajectory clustering technique(CHST). CHST select cluster head and group head using trajectory clustering technique and fitness function and it increases the energy efficiency. Hot spot problem can be solved by selection of cluster group with multi layer and balanced energy consumption using it's fitness function. I also show that proposed CHST is better than previous clustering method at the point of network energy efficiency.

• International Journal of Computer Science & Network Security
• /
• v.21 no.1
• /
• pp.6-11
• /
• 2021

Routing protocols play a pivotal role in the energy management and lifespan of any Wireless Sensor Network. Lower network lifetime has been one of the biggest concerns in LEACH protocol due to dead nodes. The LEACH protocol suffers from uneven energy distribution problem due to random selection of a cluster head. The cluster head has much greater responsibility compared to other non- cluster head nodes and consumes greater energy for its roles. This results in early dead nodes due to energy lost for the role of cluster- head. This study proposes an approach to balance the energy consumption of the LEACH protocol by using a semi-deterministic opportunity coefficient to select the cluster head. This is calculated in each node with the battery energy level and node ID. Ultimately, based on the opportunity cost, cluster head will be selected and broadcasted for which other nodes with higher opportunity cost will agree. It minimizes the chances of nodes with lower battery level being elected as cluster head. Our simulation experiments demonstrate that cluster heads chosen using our proposed algorithm perform better than those using the legacy LEACH protocol.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.3
• /
• pp.608-614
• /
• 2009

In wireless sensor networks, there are hundreds to thousands of small battery powered devices which are called sensors. As sensors have a limited energy resources, there is a need to use it effectively. A clustering based routing protocol forms clusters by distributed algorithm. Member nodes send their data to their cluster heads then cluster heads integrate data and send to sink node. In this paper we propose an energy efficient cluster-head selection algorithm. We have used some factors(a previous cluster head experience, a existence of data to transmit and an information that neighbors have data or not) to select optimum cluster-head and eventually improve network lifetime. Our simulation results show its effectiveness in balancing energy consumption and prolonging the network lifetime compared with LEACH and HEED algorithms.

• The Journal of the Korea Contents Association
• /
• v.9 no.1
• /
• pp.167-176
• /
• 2009

Traditional cluster-based routing method is a representative method for increasing the energy efficiencies. In these cluster-based routing methods, the selected cluster head collect/aggregate the information and send the aggregated information to the base station. But they have to solve the unnecessary energy dissipation of frequent information exchange between the cluster head and whole member nodes in cluster. In this paper, we minimize the frequency of the information exchange for reducing the unnecessary transmit/receive frequencies as calculate the overlapped area or number of overlapped member nodes between the selected cluster head and previous cluster head in the setup phase. So, we propose the modified cluster selection protocol method that optimizes the energy dissipation in the setup phase and reuses the saved energy in the steady-state phase efficiently that prolongs the whole wireless sensor network lifetime by uniformly selecting the cluster head.

• International Journal of Computer Science & Network Security
• /
• v.23 no.1
• /
• pp.11-16
• /
• 2023

Vehicular networks are part of the next generation wireless and smart Intelligent Transportation Systems (ITS). In the future, autonomous vehicles will be an integral part of ITS and will provide safe and reliable traveling features to the users. The reliability and security of data transmission in vehicular networks has been a challenging task. To manage data transmission in vehicular networks, road networks are divided into clusters and a cluster head is selected to handle the data. The selection of cluster heads is a challenge as vehicles are mobile and their connectivity is dynamically changing. In this paper, a novel secure cluster head selection algorithm is proposed for secure and reliable data sharing. The idea is to use the secrecy rate of each vehicle in the cluster and adaptively select the most secure vehicle as the cluster head. Simulation results show that the proposed scheme improves the reliability and security of the transmission significantly.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.1
• /
• pp.125-129
• /
• 2015

The most important factor within the wireless sensor network is to have effective network usage and increase the lifetime of the individual nodes in order to operate the wireless network more efficiently. Therefore, many routing protocols have been developed. The LEACH protocol presented by Wendi Heinzelman, especially well known as a simple and efficient clustering based routing protocol. However, because LEACH protocol in an irregular network is the total data throughput efficiency dropped, the stability of the cluster is declined. Therefore, to increase the stability of the cluster head, in this paper, it proposes a stochastic cluster head selection method for improving the LEACH protocol. To this end, it proposes a SH-LEACH(Stochastic Cluster Head Selection Method-LEACH) that it is combined to the HEED and LEACH protocol and the proposed algorithm is verified through the simulation.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.2
• /
• pp.25-30
• /
• 2010

Wireless sensor networks is composed of many similar sensor nodes with limited resources. They are randomly scattered over a specific area and self-organize the network. For guarantee of network life time, load balancing and scalability in sensor networks, sensor networks needs the clustering algorithm which distribute the networks to a local cluster. In existing clustering algorithms, the cluster head selection method has two problems. One is additional communication cost for finding location and energy of nodes. Another is unequal clustering. To solve them, this paper proposes a novel cluster head selection algorithm revised previous clustering algorithm, LEACH. The simulation results show that the energy compared with the previous clustering method is reduced.