• 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 Korea Institute of Information and Communication Engineering
• /
• v.16 no.12
• /
• pp.2800-2807
• /
• 2012

An ad-hoc wireless network provides self-organizing data networking while they are routing of packets among themselves. Typically multi-hop and control packets overhead affects the change of route of transmission. There are numerous routing protocols have been developed for ad hoc wireless networks as the size of the network scale. Hence the scalable routing protocol would be needed for energy efficient various network routing environment conditions. The number of depth or layer of hierarchical clustering nodes are analyzed the different clustering structure with topology in this paper. To estimate the energy efficient number of cluster layer and energy dissipation are studied based on distributed homogeneous spatial Poisson process with context-awareness nodes condition. The simulation results show that CACHE-R could be conserved the energy of node under the setting the optimal layer given parameters.

• Journal of Internet Computing and Services
• /
• v.15 no.5
• /
• pp.95-105
• /
• 2014

In this paper, we present a novel ant-based hierarchical clustering algorithm, where ants repeatedly hop from one node to another over a weighted directed graph of k-nearest neighborhood obtained from a given dataset. We introduce a notion of node pheromone, which is the summation of amount of pheromone on incoming arcs to a node. The node pheromone can be regarded as a relative density measure in a local region. After a finite number of ants' hopping, we remove nodes with a small amount of node pheromone from the directed graph, and obtain a group of strongly connected components as clusters. We iteratively do this removing process from a low value of threshold to a high value, yielding a hierarchy of clusters. We demonstrate the performance of the proposed algorithm with synthetic and real data sets, comparing with traditional clustering methods. Experimental results show the superiority of the proposed method to the traditional methods.

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

• Journal of Korean Society of Transportation
• /
• v.21 no.5
• /
• pp.7-18
• /
• 2003

Due to the changes of shipping and logistic environment, Asian ports today face severe competition. To be a mega-hub port, Asian ports have achieved a big scale development. For these reasons, it has been widely recognized as an important study to analyze and evaluate characteristics of Asian ports, from the standpoint of Korea where Busan Port is located. Although some previous studies have been reported, most of them have been beyond the scope of Asian ports and analyzed the world's major ports; moreover, the studied ports have been about the ports which are well known from the previous research and reports. So, most studies is unlikely to be used as substantial indicators from the perspective of Busan Port. In addition. most of the existing studies have used hierarchical evaluation algorithm for port ranking, such as AHP (analytical hierarchy process) and clustering analysis. However, these two methods have fundamental weaknesses from the algorithm perspective. The aim of this study is to classify major Asian ports based on competitiveness level. Especially. in order to overcome serious problem of the existing studies, major Asian ports were analyzed by using objective indicators. and Fuzzy C-Means algorithm, which alleviates the weakness of the clustering method. It was found that 10 ports of 16 major Asian ports have their own phases and were classified into 4 port groups. This result implies that some ports have higher potential as ports to lead some zones in Asia. Based on those results. present status and future direction of Busan port were discussed as well.

• Journal of KIISE:Software and Applications
• /
• v.37 no.5
• /
• pp.378-385
• /
• 2010

The explosive increase in the use of email has made to need email classification efficiently and accurately. Current work on the email classification method have mainly been focused on a binary classification that filters out spam-mails. This methods are based on Support Vector Machines, Bayesian classifiers, rule-based classifiers. Such supervised methods, in the sense that the user is required to manually describe the rules and keyword list that is used to recognize the relevant email. Other unsupervised method using clustering techniques for the multi-category classification is created a category labels from a set of incoming messages. In this paper, we propose a new automatic email multi-category classification method using NMF for automatic category label construction method and dynamic category hierarchy method for the reorganization of email messages in the category labels. The proposed method in this paper, a large number of emails are managed efficiently by classifying multi-category email automatically, email messages in their category are reorganized for enhancing accuracy whenever users want to classify all their email messages.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.8
• /
• pp.2298-2309
• /
• 2000

This paper proposes the multidimensioa! nested attribute indexing techniques (MD- NAI) in object-oriented databases using a multidimensional index structure. Since most conventional indexing techniques for object oriented databases use a one-dimensional index stnlcture such as the B-tree, they do not often handle complex qUlTies involving both nested attributes and class hierarchies. We extend a tunable two dimensional class hierachy indexing technique(2D-CHI) for nested attributes. The 2D-CHI is an indexing scheme that deals with the problem of clustering ohjects in a two dimensional domain space that consists of a kev attribute dOI11'lin and a class idmtifier domain for a simple attribute in a class hierachy. In our extended scheme, we construct indexes using multidimensional file organizations that include one class identifier domain per class hierarchy on a path expression that defines the indexed nested attribute. This scheme efficiently suppoI1s queries that involve search conditions on the nested attribute represcnted by an extcnded path expression. An extended path expression is a one in which a class hierarchy can be substituted by an indivisual class or a subclass hierarchy in the class hierarchy.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.11 no.10
• /
• pp.941-948
• /
• 2016

In this paper, we efficiently simulated for collecting the data from the fixed sensor and mobile sensor of patients using the LEACH-Mobile method. The LEACH-Mobile method is the protocol to increase the mobility by adding the mobile node to the existed LEACH(:Low Energy Adaptive Clustering Hierarchy) protocol. It improves the mobility of The LEACH-Mobile in the LEACH, however it consumes more energy than the existed LEACH. There is reason why we use the LEACH-Mobile that the monitoring system is generally done by the CCTV and an periodic checkup by nurses. However the number of nurse is a few in the most of hospital. It can happen the accidents of the patients in out of the CCTV when the nurse can not see the monitoring system in the hospital. Therefore it is simulated to continuously gather the data of the position and sensors in the five situation of moving the patients in the hospital, it gets the result that the management of the mobile patients is more efficient.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.2
• /
• pp.504-521
• /
• 2016

Recently, energy harvesting technology has been integrated into wireless sensor networks to ameliorate the nodes' energy limitation problem. In theory, the wireless sensor node equipped with an energy harvesting module can work permanently until hardware failures happen. However, due to the change of power supply, the traditional hierarchical network routing protocol can not be effectively adopted in energy harvesting wireless sensor networks. In this paper, we improve the Low-Energy Adaptive Clustering Hierarchy (LEACH) protocol to make it suitable for the energy harvesting wireless sensor networks. Specifically, the cluster heads are selected according to the estimation of nodes' harvested energy and consumed energy. Preference is given to the nodes with high harvested energy while taking the energy consumption rate into account. The utilization of harvested energy is mathematically formulated as a max-min optimization problem which maximizes the minimum energy conservation of each node. We have proved that maximizing the minimum energy conservation is an NP-hard problem theoretically. Thus, a polynomial time algorithm has been proposed to derive the near-optimal performance. Extensive simulation results show that our proposed routing scheme outperforms previous works in terms of energy conservation and balanced distribution.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.2B
• /
• pp.76-81
• /
• 2008

LEACH (Low Energy Adaptive Clustering Hierarchy) has been proposed as a routing protocol with a hierarchical structure, in order to achieve the energy efficiency that is of primary importance in the wireless sensor networks. A wireless sensor network adopting LEACH is composed of a few clusters, each of which consists of member nodes that sense the data, and head nodes that deliver the collected data from member nodes to a sink node that is connected to a backbone network. A head node in a cluster allocates TDMA slots to its member nodes without taking into account whether they have data to transmit or not, thus resulting in inefficiency of energy usage of head node that remains in active mode during the entire round time. This motivates us to propose a scheme to improve the energy efficiency of LEACH, by assigning TDMA slots only to those member nodes who have data to send. As a result, the head node can remain sleep during the period of no data transmission from member nodes, leading to the substantial energy saving. By using the ns-2 simulator, we evaluate the performance of the proposed scheme in comparison with the original LEACH. Experimental results validate our scheme, showing a better performance than original LEACH in terms of the number of outliving nodes and the quantity of energy consumption as time evolves.