• Journal of Electrical Engineering and Technology
• /
• v.13 no.2
• /
• pp.998-1007
• /
• 2018

The advent of Wireless Sensor Networks (WSN) has led to their use in numerous applications. Sensors are autonomous in nature and are constrained by limited resources. Designing an autonomous topology with criteria for economic and energy conservation is considered a major goal in WSN. The proposed honey-hive clustering consumes minimum energy and resources with minimal transmission delay compared to the existing approaches. The honey-hive approach consists of two phases. The first phase is an Intra-Cluster Min-Max Discrepancy (ICMMD) analysis, which is based on the local honey-hive data gathering technique and the second phase is Inter-Cluster Frequency Matching (ICFM), which is based on the global optimal data aggregation. The proposed data aggregation mechanism increases the optimal connectivity range of the sensor node to a considerable degree for inter-cluster and intra-cluster coverage with an improved optimal energy conservation.

• Journal of Institute of Control, Robotics and Systems
• /
• v.13 no.9
• /
• pp.920-926
• /
• 2007

Establishing a fixed path for the message delivery through a wireless network is impossible due to the mobility. Among the number of routing protocols that have been proposed for wireless ad-hoc networks, the AODV(Ad-hoc On-demand Distance Vector) algorithm is suitable in the case of highly dynamic topology changes, along with ZigBee Routing(ZBR), with the exception of route maintenance. Accordingly, this paper introduces a routing scheme focusing on the energy efficiency and route discovery time for wireless alarm systems using IEEE 802.15.4-based ZigBee. Essentially, the proposed routing algorithm utilizes a cluster structure and applies ZBR within a cluster and DSR (Dynamic Source Routing) between clusters. The proposed algorithm does not require a routing table for the cluster heads, as the inter-cluster routing is performed using DSR. The performance of the proposed algorithm is evaluated and compared with ZBR using an NS2 simulator. The results confirm that the proposed Cluster-based AODV (CAODV) algorithm is more efficient than ZBR in terms of the route discovery time and energy consumption.

• Journal of the Institute of Convergence Signal Processing
• /
• v.15 no.4
• /
• pp.155-161
• /
• 2014

In this paper, a cluster-based routing protocol in distributed sensor network is proposed, which enable the balanced energy consumption in the sensor nodes densely deployed in the sensor fields. This routing protocol is implemented based on clusters with hierarchical scheme. The clusters are formed by the closely located sensor nodes. A cluster node with maximum residual energy in the cluster, can be selected as cluster head node. In routing, one of the nodes in the intersection area between two clusters is selected as a relay-node and this method can extend the lifetime of all the sensor nodes in view of the balanced consumption of communication energy.

• Journal of Advanced Navigation Technology
• /
• v.15 no.2
• /
• pp.204-212
• /
• 2011

Mobile P2P(Peer-to-Peer) protocols in MANET(mobile ad-hoc networks) have gained much attention recently. Existing P2P protocols can be categorized into structured and unstructured ones. In MANET, structured P2P protocols show large control traffic because they does not consider the locality of P2P data and unstructured P2P protocols have a scalability problem with respect to the number of nodes. Hybrid P2P protocols combine advantages of the structured and unstructured P2P protocols. Cluster-based P2P protocol is one of the hybrid P2P protocols. Our study makes an analysis of the cluster-based P2P protocol and derives the optimal cluster formation in MANET. In the derived optimal cluster formation, the cluster-based P2P protocol shows better performance than Gnutella protocol with respect to control traffic.

• Journal of Information Technology Applications and Management
• /
• v.26 no.1
• /
• pp.53-64
• /
• 2019

The purpose of this study is to find out the fast delivery route that several drones return a truck again after departing from it for delivery locations at each cluster while the truck goes through the cluster composed of several delivery locations. The main issue is to reduce the total delivery time composed of the delivery time by relatively slow trucks via clusters and the sum of maximum delivery times by relatively fast drones in each cluster. To solve this problem, we use a three-step heuristic approach. First, we cluster the nearby delivery locations with minimal number of clusters satisfying a constraint of drone flight distance to set delivery paths for drones in each cluster. Second, we set an optimal delivery route for a truck through centers of the clusters using the TSP model. Finally, we find out the moved centers of clusters while maintaining the delivery paths for the truck and drones and satisfying the constraint of drone flight. distance in the two-dimensional region to reduce the total delivery time. In order to analyze the effect of this study model according to the change of the number of delivery locations, we developed a R-based simulation prototype and compared the relative efficiency, and performed paired t-test between TSP model and the cluster-based models. This study showed its excellence through this experimentation.

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

• Journal of the Korean Institute of Intelligent Systems
• /
• v.27 no.1
• /
• pp.35-41
• /
• 2017

This paper presents the development of a monitoring and control system for a vehicle cluster using a model-based design technique. For MBD(model-based design), MATLAB GUI(Graphic User Interface), M programs, simulink, state flow, and tool boxes are used to monitor a number of data such as warning, interrupts, and etc. connected to a real vehicle cluster. As a monitoring tool, a PC(Personal Computer) station interworks with the real vehicle cluster through the interface commands of tool boxes. Thus, unlike existing text-based designs, the MBD based vehicle cluster system provides very easy algorithm updates and addition, since it offers a number of blocks and state flow programs for each functional actions. Furthermore, the proposed MBD technique reduces the required time and cost for the development and modification of a vehicle cluster, because of verification and validation of the cluster algorithm on the monitor through a PC.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38C no.11
• /
• pp.1060-1073
• /
• 2013

In this paper, we present a cluster-based routing scheme for efficiently delivering data to group mobile users by extracting and clustering mobile user group simply from beacon message information in wireless ad-hoc networks. First, we propose an online-clustering mechanism that uses a local neighbor table on each node by recursively transmitting to neighbor nodes, and forms a group table where a set of listed nodes are classified as group members, without incurring much overhead. A node that appears the most frequently from neighbor tables throughout the network is selected as the cluster-head node, serving as a data gateway for the intra-cluster. Second, we design an inter-cluster routing that delivers data from stationary data sources to the selected cluster-head node, and a intra-cluster routing to deliver from the cluster-head node to users. Simulation results based on ns-2 in the ad-hoc networks consisting of 518 stationary nodes and 20 mobile nodes show that our proposed clustering mechanism achieves high clustering accuracy of 96 % on average. Regarding routing performance, our cluster-based routing scheme outperforms a naive one-to-one routing scheme without any clustering by reducing routing cost up to 1/20. Also, our intra-cluster routing utilizing a selected cluster-head node reduces routing cost in half as opposed to a counterpart of the intra-cluster routing through a randomly-selected internal group member.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.4
• /
• pp.1237-1255
• /
• 2014

In wireless sensor networks (WSNs), hierarchical clustering is an efficient approach for lower energy consumption and extended network lifetime. In cluster-based multi-hop communications, a cluster head (CH) closer to the sink is loaded heavier than those CHs farther away from the sink. In order to balance the energy consumption among CHs, we development a novel cluster-based routing protocol for corona-structured wireless sensor networks. Based on the relaying traffic of each CH conveys, adequate radius for each corona can be determined through nearly balanced energy depletion analysis, which leads to balanced energy consumption among CHs. Simulation results demonstrate that our clustering approach effectively improves the network lifetime, residual energy and reduces the number of CH rotations in comparison with the MLCRA protocols.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.6
• /
• pp.1133-1151
• /
• 2010

Energy balanced consumption routing is based on assumption that the nodes consume energy both in transmitting and receiving. Lopsided energy consumption is an intrinsic problem in low-cost sensor networks characterized by multihop routing and in many traffic overhead pattern networks, and this irregular energy dissipation can significantly reduce network lifetime. In this paper, we study the problem of maximizing network lifetime through balancing energy consumption for uniformly deployed low-cost sensor networks. We formulate the energy consumption balancing problem as an optimal balancing data transmitting problem by combining the ideas of corona cluster based network division and optimized transmitting state routing strategy together with data transmission. We propose a localized cluster based routing scheme that guarantees balanced energy consumption among clusters within each corona. We develop a new energy cluster based routing protocol called "OECR". We design an offline centralized algorithm with time complexity O (log n) (n is the number of clusters) to solve the transmitting data distribution problem aimed at energy balancing consumption among nodes in different cluster. An approach for computing the optimal number of clusters to maximize the network lifetime is also presented. Based on the mathematical model, an optimized energy cluster routing (OECR) is designed and the solution for extending OEDR to low-cost sensor networks is also presented. Simulation results demonstrate that the proposed routing scheme significantly outperforms conventional energy routing schemes in terms of network lifetime.