• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.1
• /
• pp.198-204
• /
• 2012

Generally, the clustering of sensor nodes in WSN is a useful mechanism that helps to cope with scalability problem and, if combined with network data aggregation, may increase the energy efficiency of the network. The Hierarchical clustering routing algorithm is a typical algorithm for enhancing overall energy efficiency of network, which selects cluster-head in order to send the aggregated data arriving from the node in cluster to a base station. In this paper, we propose the improved-LEACH that uses comparably simple and light-weighted policy to select cluster-head nodes, which results in reduction of the clustering overhead and overall power consumption of network. By using fine-grained power model, the simulation results show that i-LEACH can reduce clustering overhead compared with the well-known previous works such as LEACH. As result, i-LEACH algorithm and LEACH algorithm was compared, network power-consumption of i-LEACH algorithm was improved than LEACH algorithm with 25%, and network-traffic was improved 16%.

• Journal of Advanced Navigation Technology
• /
• v.14 no.4
• /
• pp.495-503
• /
• 2010

The clustering is an important mechanism thai provides information for mobile nodes efficiently and improves the processing capacity for routing and the allocation of bandwidth. This paper proposes a clustering scheme based on the fuzzy relevance degree to solve problems such as node distribution found in the dynamic property due to mobility and flat structure and to enhance the routing performance. The proposed scheme uses the fuzzy relevance degree, ${\alpha}$, to select the cluster head for clustering in FSV (Fuzzy State Viewing) structure. The fuzzy relevance ${\alpha}$ plays the role in CH selection that processes the clustering in FSV. The proposed clustering scheme is used to solve problems found in existing 1-hop and 2-hop clustering schemes. NS-2 simulator is used to verify the performance of the proposed scheme by simulation. In the simulation the proposed scheme is compared with schemes such as Lowest-ID, MOBIC, and SCA. The simulation result showed that the proposed scheme has better performance than the other existing compared schemes.

• Fashion & Textile Research Journal
• /
• v.12 no.6
• /
• pp.812-820
• /
• 2010

The objectives of this study were to classify the head shapes of Korean men and to suggest computer tomography as a new body measurement method. The 23 head measurement items of 760 men, aged more than 18 in Sizekorea 2004 database were used to analyze, measured by using statistical methods. Factor analysis, cluster analysis and duncan test were performed using these data. Through factor analysis, 5 factors were extracted upon factor scores and those factors comprised 70.91% for the total variances. The head and face shapes were categorized as 5 types-triangle, round, oval, long, rectangle. We decided for the type 1(triangle) to standard head shape since this type was the most observed. 21 participants were measured using computed tomography(CT). The measured data of skin and skeleton and the standard head shapes were illustrated.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.10
• /
• pp.3302-3320
• /
• 2014

An allocation of sensing and reporting times is proposed to improve the sensing performance by scheduling them in an efficient way for cognitive radio networks with cluster-based cooperative spectrum sensing. In the conventional cooperative sensing scheme, all secondary users (SUs) detect the primary user (PU) signal to check the availability of the spectrum during a fixed sensing time slot. The sensing results from the SUs are reported to cluster heads (CHs) during the reporting time slots of the SUs and the CHs forward them to a fusion center (FC) during the reporting time slots of the CHs through the common control channels for the global decision, respectively. However, the delivery of the local decision from SUs and CHs to a CH and FC requires a time which does not contribute to the performance of spectrum sensing and system throughput. In this paper, a super-allocation technique, which merges reporting time slots of SUs and CHs to sensing time slots of SUs by re-scheduling the reporting time slots, has been proposed to sense the spectrum more accurately. In this regard, SUs in each cluster can obtain a longer sensing duration depending on their reporting order and their clusters except for the first SU belonged to the first cluster. The proposed scheme, therefore, can achieve better sensing performance under -28 dB to -10 dB environments and will thus reduce reporting overhead.

• The Research Journal of the Costume Culture
• /
• v.12 no.6 s.53
• /
• pp.933-944
• /
• 2004

This study was aimed to provide the fundamental and various measurement data of the head and face for male children. Two hundred forty one male children, aged nine to twelve years, participated for this study. The 31 regions on the head and face of the subjects were directly measured by the expert experimenters. Through factor analysis, the six factors were extracted upon factor scores and those factors comprised $67.47\%$ for the total variances. The first factor was described the general height elements for the mouth and the environs of the mouth. The second factor was described the general height around the nose, forehead and eyes. The third factor was described the height of the ear environs. The forth factor contained the length around the sinciput to the occiput, the head thick and the head circumstance. The fifth factor was described the general width of the outer head and the corner of the eyes. The last factor contained the depth of the mouth and nose. Four clusters as their head and face shape were categorized using six factor scores by cluster analysis. Type 1 was characterized by the shortest head and face width, surface length and girth, and the shorter length of head, but the highest position of chin, philtrum, upper lip. Type 2 was characterized by the shortest head and face length and thickness, and the lowest position of the forehead, eye, nose, mouth, ear environs, but that had wider width of head and face. Type 3 was characterized by the longest and the widest head and face type, and the highest position of the mouth. Type 4 was characterized by longer length of head and face, and the widest head girth and largest head thickness, and the highest position of the forehead, eye, nose environs. And this type had the widest width of nose and mouth, and the longest head surface length.

• Journal of the Korean Society of Clothing and Textiles
• /
• v.42 no.6
• /
• pp.988-1001
• /
• 2018

The head and face are the most complicated structures of the human body. However, unlike apparel products, many of the head and face related products are produced in unisex or one-size-fits-all. Therefore, it is necessary to provide a practical analysis that reflects these size structures. This study analyzed head and face measurements of men, women, and both men and women; its purpose lying in clarifying the differences and commonalities between the measurements of men and women and discovering the possibility of integrating analysis on measurements of men and women. 3D face and head measurement data of men and women from 20 to 29 years-old from Size Korea's 6th human body size data were analyzed for this study. The mutual 9 factors were extracted as the results of the three factor analyses (both men and women) separately and men and women integrated. However in the cluster analysis based on the 9 factors, men and women showed mutual characteristics and different landscape in group types and distribution. The commonalities and differences between men and women observed in this study should be applied to the sizes of head and face products.

• Journal of Korea Multimedia Society
• /
• v.12 no.9
• /
• pp.1297-1308
• /
• 2009

The life time of a wireless sensor network composed of numerous sensor nodes depend on ones of its sensor nodes. The energy efficiency operation of nodes, therefore, is one of the crucial factors to design the network. Researches based on the hierarchical network topology have been proposed and evolved in terms of energy efficiency. However, in existing researches, application layer data obtained from sensor nodes are not considered properly to compose cluster, including issue that nodes communicate with their cluster heads in TDMA scheduling. In this paper, we suggest an energy-efficient topology control scheme based on application layer data in wireless sensor networks. By using application layer data, sensor nodes form a section which is defined as the area of adjacent nodes that retain similar characteristics of application environments. These sections are further organized into clusters. We suggest an algorithm for selecting a cluster head as well as a way of scheduling to reduce the number of unnecessary transmissions from each node to its cluster head, which based on the degree and the duration of similarity between the node's data and its head's data in each cluster without seriously damaging the integrity of application data. The results show that the suggested scheme can save the energy of nodes and increase the life time of the entire network.

• Journal of the Korea Society for Simulation
• /
• v.18 no.3
• /
• pp.13-21
• /
• 2009

The sensor nodes that form a wireless sensor network must perform both routing and sensing roles, since each sensor node always has a regular energy drain. The majority of sensors being used in wireless sensor networks are either unmanned or operated in environments that make them difficult for humans to approach. Furthermore, since many wireless sensor networks contain large numbers of sensors, thus requiring the sensor nodes to be small in size and cheap in price, the amount of power that can be supplied to the nodes and their data processing capacity are both limited. In this paper, we proposes the WSN(Wireless Sensor Network) algorithm which is applied sensor node that has low power consumption and efficiency measurement. Moreover, the efficiency routing protocol is proposed in this paper. The proposed algorithm reduces power consumption of sensor node data communication. It has not researched in LEACH(Low-Energy Adaptive Clustering Hierarchy) routing protocol. As controlling the active/sleep mode based on the measured data by sensor node, the energy consumption is able to be managed. In the event, the data is transferred to the local cluster head already set. The other side, this algorithm send the data as dependent on the information such as initial and present energy, and the number of rounds that are transformed into cluster header and then transferred. In this situation, the assignment of each node to cluster head evenly is very important. We selected cluster head efficiently and uniformly distributed the energy to each cluster node through the proposed algorithm. Consequently, this caused the extension of the WSN life time.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.3
• /
• pp.213-220
• /
• 2015

Wireless sensor network(WSN) is made up of a lot of battery operated inexpensive sensors that, once deployed, can not be replaced. Therefore, energy efficiency of WSN is essential. Among the methods for energy efficiency of the network, clustering algorithms, which divide a WSN into multiple smaller clusters and separate all sensors into cluster heads and their associated member nodes, are very energy efficient routing technique. The first cluster-based routing protocol, LEACH, randomly elects the cluster heads in accordance with the probability. However, if the distribution of selected cluster heads is not good, uniform energy consumption of cluster heads is not guaranteed and it is possible to decrease the number of active nodes. Here we propose a new routing scheme that, by comparing the remaining energy of all nodes in a cluster, selects the maximum remaining energy node as a cluster head. Because of decrease in energy gap of nodes, the node that was a cluster head operates as a member node much over. As a result, the network lifespan is increased and more data arrives at base station.

• Journal of Korea Multimedia Society
• /
• v.10 no.2
• /
• pp.269-277
• /
• 2007

Network clustering has been proposed to provide that sensor nodes minimize energy and maximize a network lifetime by configuring clusters, Although dynamic clustering brings extra overhead like as head changing, head advertisement, it may diminish the gain in energy consumption to report attribute tasks by using cluster heads. Therefore, this paper proposes a new routing algorithm which configures cluster to reduce the number of messages when establishing paths and reports to the sink by way of cluster heads when responding sens ing tasks. All sensor nodes only broadcast bitmap once and maintain a bitmap table expressed by bits, allowing them to reduce node energy and to prolong the network lifetime. After broadcasting, each node only updates the bitmap without propagation when the adjacent nodes broad cast same query messages, This mechanism makes nodes to have abundant paths. By modifying the query which requests sensing tasks, the size of cluster is designed dynamically, We try to divide cluster by considering the number of nodes. Then, all nodes in a certain cluster must report to the sub- sink node, The proposed routing protocol finds easily an appropriate path to report tasks and reduces the number of required messages for the routing establishment, which sensor nodes minimize energy and maximize a network lifetime.