• Journal of the Korea Society of Computer and Information
• /
• v.25 no.2
• /
• pp.105-111
• /
• 2020

In this paper, we propose a scheme that minimizes the energy imbalance problem of solar-powered wireless sensor network (SP-WSN) using both a mobile sink capable of wireless power transfer and an efficient clustering scheme (including cluster head election). The proposed scheme charges the cluster head using wireless power transfer from a mobile sink and mitigates the energy hotspot of the nodes nearby the head. SP-WSNs can continuously harvest energy, alleviating the energy constraints of battery-based WSN. However, if a fixed sink is used, the energy imbalance problem, which is energy consumption rate of nodes located near the sink is relatively increased, cannot be solved. Thus, recent research approaches the energy imbalance problem by using a mobile sink in SP-WSN. Meanwhile, with the development of wireless power transmission technology, a mobile sink may play a role of energy charging through wireless power transmission as well as data gathering in a WSN. Simulation results demonstrate that increase the amount of collected data by the sink using the proposed scheme.

• 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

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.2
• /
• pp.165-172
• /
• 2011

Wireless sensor networks consist of small battery powered devices with limited energy resources. Once deployed, the small sensor nodes are usually inaccessible to the user, and thus replacement of the energy source is not feasible. Hence, energy efficiency is a key design issue that needs to be enhanced in order to improve the life span of the network. Directed Diffusion is a well known routing protocol. In this paper we adopt the clustering mechanism to improve the efficiency of Directed Diffusion. We introduce C-Directed Diffusion which make clusters, select the CH(Cluster Head) and CHs do the same process as in Directed Diffusion. C-Directed Diffusion is pretty simple and show better performance than Directed Diffusion.

• 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.

• Journal of the Institute of Convergence Signal Processing
• /
• v.12 no.1
• /
• pp.38-43
• /
• 2011

Cluster-based routing is high energy consumption of cluster head nodes. A recent approach to resolving the problem is the dynamic cluster technique that periodically re-selects cluster head nodes to distribute energy consumption of the sensor nodes. However, the dynamic clustering technique has a problem that repetitive construction of clustering consumes the more energies. This paper proposes a solution to the problems described above from the energy efficiency perspective. The round-robin cluster header(RRCH) technique, which fixes the initially structured cluster and sequentially selects cluster head nodes, is suggested for solving the energy consumption problem regarding repetitive cluster construction. A simulation result were compared with the performances of two of the most widely used conventional techniques, the LEACH(Low Energy Adaptive Clustering Hierarchy) and HEED(Hybrid, Energy Efficient, Distributed Clustering) algorithms, based on energy consumption, remaining energy for each node and uniform distribution. The evaluation confirmed that in terms of energy consumption, the technique proposed in this paper was 26.5% and 20% more efficient than LEACH and HEED, respectively.

• The KIPS Transactions:PartC
• /
• v.10C no.2
• /
• pp.163-170
• /
• 2003

In this paper we propose a robust clustered croup Multicast in Ad-hoc network. The proposed scheme applies to weighted clustered Algorithm. Ad-hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any centralized administration or reliable support services such as wired network and base station. In ad hoc network routing protocol because of limited bandwidth and high mobility robust, simple and energy consume minimal. WCGM method uses a base structure founded on combination weighted value and applies combination weight value to cluster header keeping data transmission by scoped flooding, which is the advantage of the exiting FGMP method. Because this method has safe and reliable data transmission, it shows the effect to decrease both overhead to preserve transmission structure and overhead for data transmission.

• The Journal of the Acoustical Society of Korea
• /
• v.33 no.5
• /
• pp.341-350
• /
• 2014

In this paper, an energy efficient clustering scheme using self organization method is proposed. The proposed scheme selects a cluster head considering not only the number of neighbor nodes but also the residual battery amount. In addition, the network life time is extended by re-selecting the cluster heads only in case the current cluster head's residual energy falls down below a certain threshold level. Accordingly, the energy consumption is evenly distributed over the entire network nodes. The cluster head delivers the collected data from member nodes to a Sink node in a way of multi-hop relaying. In order to evaluate the proposed scheme, we run computer simulation in terms of the total residual amount of battery, the number of alive nodes after a certain amount of time, the accumulated energy cost for network configuration, and the deviation of energy consumption of all nodes, comparing with LEACH which is one of the most popular network clustering schemes. Numerical results show that the proposed scheme has twice network life-time of LEACH scheme and has much more evenly distributed energy consumption over the entire network.

• The Journal of the Korea Contents Association
• /
• v.22 no.5
• /
• pp.26-36
• /
• 2022

Recently, studies have been conducted to cluster vehicles and disseminate safety messages in a VANET environment for driver safety and smoothy traffic. This paper proposes cluster management scheme for safety message dissemination through V2V communication and V2I communication in a VANET environment with high vehicle density and mobility. The proposed scheme reduces packet loss by selecting CH considering reception quality, total data owned by vehicles, moving speed, and connected vehicles, and maintaining cluster head candidates, which are the main agents of message dissemination, considering frequent cluster departures and subscriptions. In addition, the proposed scheme reduces duplicate messages by utilizing clusters by collaborating with a Road side unit(RSU). To prove the excellence of the proposed scheme, various performance evaluations are performed in terms of message packet loss and the number of RSU processing requests. As a result of performance evaluation, the cluster management scheme proposed in this paper shows better performance than the existing scheme.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.44 no.3
• /
• pp.14-22
• /
• 2007

Wireless sensor networks are composed of numerous sensor nodes and exchange or recharging of the battery is impossible after deployment. Thus, sonsor nodes must be very energy-efficient. As neighboring sensor nodes generally have the data of similar information, duplicate transmission of similar information is usual. To prevent energy wastes by duplicate transmissions, it is advantageous to organize sensors into clusters. The performance of clustering scheme is influenced by the cluster-head election method and the size or the number of clusters. Thus, we should optimize these factors to maximize the energy efficiency of the clustering scheme. In this paper, we propose a new energy consumption model for LEACH which is a well-known clustering protocol and determine the optimal number of clusters based on our model. Our model has accuracy over 80% compared with the simulation and is considerably superior to the existing model of LEACH.

• The KIPS Transactions:PartC
• /
• v.16C no.6
• /
• pp.783-790
• /
• 2009

The necessity of wireless sensor networks is increasing in the recent years. So many researches are studied in wireless sensor networks. The clustering algorithm provides an effective way to prolong the lifetime of the wireless sensor networks. The one-hop routing of LEACH algorithm is an inefficient way in the energy consumption of cluster-head, because it transmits a data to the BS(Base Station) with one-hop. On the other hand, other clustering algorithms transmit data to the BS with multi-hop, because the multi-hop transmission is an effective way. But the multi-hop routing of other clustering algorithms which transmits data to BS with multi-hop have a data bottleneck state problem. The unequal clustering algorithm solved a data bottleneck state problem by increasing the routing path. Most of the unequal clustering algorithms partition the nodes into clusters of unequal size, and clusters closer to the BS have small-size the those farther away from the BS. However, the energy consumption of cluster-head in unequal clustering algorithm is more increased than other clustering algorithms. In the thesis, I propose an energy efficient unequal clustering algorithm which decreases the energy consumption of cluster-head and solves the data bottleneck state problem. The basic idea is divided a three part. First of all I provide that the election of appropriate cluster-head. Next, I offer that the decision of cluster-size which consider the distance from the BS, the energy state of node and the number of neighborhood node. Finally, I provide that the election of assistant node which the transmit function substituted for cluster-head. As a result, the energy consumption of cluster-head is minimized, and the energy consumption of total network is minimized.