• The Journal of the Korea Contents Association
• /
• v.10 no.6
• /
• pp.91-105
• /
• 2010

A wireless sensor network communication technique has been broadly studied with continuous advances in ubiquitous computing environment. Especially, because the resource of the sensor node is limited, it is important to reduce the communication energy by using an energy-efficient routing protocol. The existing cluster-based routing protocols have a problem that they cannot select a cluster head efficiently by randomly choosing a head. In addition, because the existing cluster-based routing protocols do not support the large scale of network, they cannot be used for various applications. To solve the above problems, we, in this paper, propose a new cluster-based routing protocol using representative paths. The proposed protocol constructs an efficient cluster with distributed cluster heads by creating representative paths based on hop count. In addition, a new routing protocol supports multi-hop routing for data communication between a cluster member node and a cluster head as well as between cluster heads. Finally, we show that our protocol outperforms LEACH and Multihop-LEACH in terms of reliability and scalability.

• Journal of Communications and Networks
• /
• v.12 no.4
• /
• pp.358-365
• /
• 2010

We develop a low complexity cooperative diversity protocol for low energy adaptive clustering hierarchy (LEACH) based wireless sensor networks. A cross layer approach is used to obtain spatial diversity in the physical layer. In this paper, a simple modification in clustering algorithm of the LEACH protocol is proposed to exploit virtual multiple-input multiple-output (MIMO) based user cooperation. In lieu of selecting a single cluster-head at network layer, we proposed M cluster-heads in each cluster to obtain a diversity order of M in long distance communication. Due to the broadcast nature of wireless transmission, cluster-heads are able to receive data from sensor nodes at the same time. This fact ensures the synchronization required to implement a virtual MIMO based space time block code (STBC) in cluster-head to sink node transmission. An analytical method to evaluate the energy consumption based on BER curve is presented. Analysis and simulation results show that proposed cooperative LEACH protocol can save a huge amount of energy over LEACH protocol with same data rate, bit error rate, delay and bandwidth requirements. Moreover, this proposal can achieve higher order diversity with improved spectral efficiency compared to other virtual MIMO based protocols.

• International journal of advanced smart convergence
• /
• v.9 no.2
• /
• pp.185-194
• /
• 2020

Designing of a hierarchical clustering algorithm is one of the numerous approaches to minimize the energy consumption of the Wireless Sensor Networks (WSNs). In this paper, a homogeneous and randomly deployed sensor nodes is considered. These sensors are energy constrained elements. The nominal selection of the Cluster Head (CH) which falls under the clustering part of the network protocol is studied and compared to Low Energy Adaptive Clustering Hierarchy (LEACH) protocol. CHs in this proposed process is the function of total remaining energy of each node as well as total average energy of the whole arrangement. The algorithm considers initial energy, optimum value of cluster heads to elect the next group of cluster heads for the network as well as residual energy. Total remaining energy of each node is compared to total average energy of the system and if the result is positive, these nodes are eligible to become CH in the very next round. Analysis and numerical simulations quantify the efficiency and Average Energy Ratio (AER) of the proposed system.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.20 no.1
• /
• pp.36-41
• /
• 2010

In oder to operate sensor networks effectively it is very important to use the energy in the individual nodes efficiently and so increase their lifetime. Cluster-based routing algorithms such as LEACH and HEED obtain the efficiency of energy using data transfer between cluster heads and its members. In this paper we analyze the typical cluster-based routing algorithms and suggest a new energy efficient method of electing the cluster heads with the maximum delay of dead nodes occurrence. The efficiency of the proposed algorithm is verified through MATLAB simulation.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.5
• /
• pp.87-91
• /
• 2019

WSN is a wirelessly configured network of sensor nodes with limited power such as batteries. If the sensor node's battery is exhausted, the node is no longer available. Therefore, if the network is to be used for a long time, energy consumption should be minimized. There are many Wireless Sensor Network Protocols to improve energy efficiency, including Cluster-based and chain-based Protocols. Cluster-based Protocols elect Cluster Heads and divide sensor field into Clusters. The Cluster Head collects the data in the Cluster and transmits it to the Base Station. In the case of nodes elected as Cluster Heads, there is a problem of energy consumption. The chain-based Protocol links sensor nodes in a chain and finally transmits all data to the Base Station. In this paper, we intend to increase the network lifetime by using a chain to reduce the energy consumption of the Cluster Head in the Cluster-based Protocol, LEACH Protocol.

• The KIPS Transactions:PartC
• /
• v.17C no.3
• /
• pp.291-298
• /
• 2010

In wireless sensor networks, energy is the most important consideration because the lifetime of the sensor node is limited by battery. The clustering is the one of methods used to manage network energy consumption efficiently and LEACH(Low-Energy Adaptive Clustering Hierarchy) is one of the most famous clustering algorithms. LEACH utilizes randomized rotation of cluster-head to evenly distribute the energy load among the sensor nodes in the network. The random selection method of cluster-head does not guarantee the number of cluster-heads produced in each round to be equal to expected optimal value. And, the cluster head in a high-density cluster has an overload condition. In this paper, we proposed both a token based cluster-head selection algorithm for guarantee the number of cluster-heads and a cluster selection algorithm for uniform-density cluster. Through simulation, it is shown that the proposed algorithm improve the network lifetime about 9.3% better than LEACH.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.3
• /
• pp.163-169
• /
• 2016

To establish the equitable distribution of total energy load, a representative cluster based routing protocol LEACH selects cluster heads randomly in accordance with the pre-determined probability every round. But because the current energy level of sensor nodes is not considered, if a sensor node which has little residual energy is elected as a cluster head, it can not live to fulfil the role of cluster head which has big energy load. As a result, the first time of death of a node is quickened and the service quality of WSN gets worse. In this regard we propose a new routing method that, by considering the current energy of a cluster head and the distance between cluster heads and a base station, selects the sub cluster head for saving the energy of a cluster head. Simulation results show that the first time of death of a node prolongs, more data arrive at the base station and the service quality of WSN improves.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.9
• /
• pp.33-40
• /
• 2017

In this paper, we propose a sink-location management and data-routing scheme to effectively support the mobile sink in solar-powered WSN. Battery-based wireless sensor networks (WSNs) have a limited lifetime due to their limited energy, but solar energy-based WSNs can be supplied with energy periodically and can operate forever. On the other hand, introduction of mobile sink in WSNs can solve some energy unbalance problem between sink-neighboring nodes and outer nodes which is one of the major challenges in WSNs. However, there is a problem that additional energy should be consumed to notify each sensor node of the location of the randomly moving mobile sink. In the proposed scheme, one of the nodes that harvests enough energy in each cluster are selected as the cluster head, and the location information of the mobile sink is shared only among the cluster heads, thereby reducing the location management overhead. In addition, the overhead for setting the routing path can be removed by transferring data in the opposite direction to the path where the sink-position information is transferred among the heads. Lastly, the access node is introduced to transmit data to the sink more reliably when the sink moves frequently.

• The KIPS Transactions:PartC
• /
• v.13C no.6 s.109
• /
• pp.757-766
• /
• 2006

Mobile Ad-hoc Network(MANET) is an autonomous network consisted of mobile hosts. A considerable number of studies have been conducted on the MANET with studies of ubiquitous computing. Several studies have been made on the clustering schemes which manage network hierarchically to Improve flat architecture of MANET. But the conventional schemes have the lack of multi-hop clustering and load balancing. This paper proposes a clustering scheme to support multi-hop clustering and to consider load balancing between cluster heads. We define the split of clusters and states of cluster, and propose join, merge, divide, and election of cluster head schemes for load balancing of between cluster heads

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.8
• /
• pp.3683-3703
• /
• 2018

Wireless sensor networks (WSNs) consist of set of sensor nodes. These sensor nodes are deployed in unattended area which are able to sense, process and transmit data to the base station (BS). One of the primary issues of WSN is energy efficiency. In many existing clustering approaches, initial centroids of cluster heads (CHs) are chosen randomly and they form unbalanced clusters, results more energy consumption. In this paper, an energy efficient clustering protocol to prevent unbalanced clusters based on firefly and midpoint algorithms called EEC-FM has been proposed, where midpoint algorithm is used for initial centroid of CHs selection and firefly is used for cluster formation. Using residual energy and Euclidean distance as the parameters for appropriate cluster formation of the proposed approach produces balanced clusters to eventually balance the load of CHs and improve the network lifetime. Simulation result shows that the proposed method outperforms LEACH-B, BPK-means, Park's approach, Mk-means, and EECPK-means with respect to balancing of clusters, energy efficiency and network lifetime parameters. Simulation result also demonstrate that the proposed approach, EEC-FM protocol is 45% better than LEACH-B, 17.8% better than BPK-means protocol, 12.5% better than Park's approach, 9.1% better than Mk-means, and 5.8% better than EECPK-means protocol with respect to the parameter half energy consumption (HEC).