• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.2
• /
• pp.370-376
• /
• 2009

Recently, Study for routing protocol is gone vigorously in the Ubiquitous Sensor Network. A hierarchical routing protocol is being practical and received interest among them. Therefore we analyze a weak point of HEED. And I suggest the new protocol that solved a weak point of HEED. The new protocol that we propose puts weight in the energy remainder amount than HEED and elect CH. And elected CH is designed to change by new node when quantity of energy leftover becomes less than 50%. Therefore all nodes come to use energy fairly. The protocol that we proposed can prove the cluster survival rate about 30%. And CH is more effective because when elect CH replace, response time selects small node.

• 전자공학회논문지 IE
• /
• v.46 no.2
• /
• pp.11-17
• /
• 2009

This study speak abut demerit of LEACH, EACHS, and HEED. There are demerits that LEACH, EACHS shall be rest energy of all nodes and HEED can't guarantee the number of cluster head. Proposed energy efficiency of selected cluster head guarantees the number of cluster head which is a demerit of HEED and minimizes the node of DEAD. Energy efficiency of simulation is compared by MA TLAB.

• 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 KIPS Transactions:PartC
• /
• v.16C no.2
• /
• pp.151-164
• /
• 2009

The importance of sensor networks as a base of ubiquitous computing realization is being highlighted, and espicially the security is recognized as an important research isuue, because of their characteristics.Several efforts are underway to provide security services in sensor networks, but most of them are preventive approaches based on cryptography. However, sensor nodes are extremely vulnerable to capture or key compromise. To ensure the security of the network, it is critical to develop security Intrusion Detection System (IDS) that can survive malicious attacks from "insiders" who have access to keying materials or the full control of some nodes, taking their charateristics into consideration. In this perper, we design a distributed and adaptive IDS architecture on sensor networks, respecting both of energy efficiency and IDS efficiency. Utilizing a modified HEED algorithm, a clustering algorithm, distributed IDS nodes (dIDS) are selected according to node's residual energy and degree. Then the monitoring results of dIDSswith detection codes are transferred to dIDSs in next round, in order to perform consecutive and integrated IDS process and urgent report are sent through high priority messages. With the simulation we show that the superiorities of our architecture in the the efficiency, overhead, and detection capability view, in comparison with a recent existent research, adaptive IDS.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.4
• /
• pp.105-113
• /
• 2008

While the wireless sensor network has a strong point which does not have effect on whole activities of network even though neighboring sensor nods fail activities of some sensor nod or make some functions disappear by the characteristic of similar information detection, it has problems which is slowing down of wireless medium, transfer character with severe error, limited power supply, the impossibility of change by optional arrangement of sensor nods etc. This paper proposes PRML techniques which performs the fittest course searching process to reduce power consumption of entire nods while guarantees the scalability of network organizing sensor nods hierarchically. The proposed technique can scatter the load of cluster head by considering the connectivity with surplus energy of nod and reduce the frequency of communication among the nods. As a result of the analysis in comparison with LEACH-C and HEED technique, PRML technique get efficiency of average 6.4% in energy consuming respect of cluster head, efficiency of average 8% in entire energy consuming respect, and more efficiency of average 7.5% in other energy consuming distribution of network scalability than LEACH-C and HEED technique.

• Phonetics and Speech Sciences
• /
• v.1 no.4
• /
• pp.39-46
• /
• 2009

This study compares the perception of English high tense and lax vowels (/i, I, u, $\mho$/) by English speakers and Korean speakers of English. The four vowels were produced in /hVd/ context by a native speaker of English, and each word's vowel duration was manipulated to range from 170ms to 290ms in 30ms increments. Two English speakers and six Korean speakers of English were asked to listen to pairs of tense and lax vowel words with manipulated vowel durations and to identify the pair by choosing either heed-hid or hid-heed for front vowels and either who'd-hood or hood-who'd for back vowels. The results show that English speakers distinguished tense vowels from lax vowels with 100% accuracy regardless of the different durations, compared to 62% accuracy for Korean speakers of English. Most errors occurred for lengthened lax vowels and shortened tense vowels. The results of this study demonstrate that Korean speakers mainly rely on vowel duration as a cue to discriminate the tense and lax vowels. The theoretical and pedagogical implications of this finding are discussed.

• International Journal of Internet, Broadcasting and Communication
• /
• v.7 no.1
• /
• pp.30-35
• /
• 2015

The most important factor within the wireless sensor network is to have effective network usage and increase the lifetime of the individual nodes in order to operate the wireless network more efficiently. Therefore, many routing protocols have been developed. The LEACH protocol presented by Wendi Hein Zelman, especially well known as a simple and efficient clustering based routing protocol. However, because LEACH protocol in an irregular network is the total data throughput efficiency dropped, the stability of the cluster is declined. Therefore, to increase the stability of the cluster head, in this paper, it proposes a stochastic cluster head selection method for improving the LEACH protocol. To this end, it proposes a SH-LEACH (Stochastic Cluster Head Selection Method-LEACH) that it is combined to the HEED and LEACH protocol and the proposed algorithm is verified through the simulation.

• Analytical Science and Technology
• /
• v.29 no.6
• /
• pp.300-304
• /
• 2016

The asphalt antistripping agents were synthesized from ethylenediamine (ED) or N,N'-bis(2-hydroxyethyl)ethylenediamine (HEED) with three different fatty acids. The formation of amide bonds were successfully performed and confirmed by FT-IR and $^1H-NMR$ data. The adhesive properties of antistripping agents were compared in terms of contact angle and BBS test. The reaction product of ED with waste animal fat exhibited the most hydrophobic by the contact angle measurement, and the strongest water resistance of 94 % by BBS test. However, the reaction product of ED with waste vegetable oil showed the strongest absolute bond strength of ca. 3610 and 3227 kPa for before and after water conditioning, respectively. For the bond strength in general, the reaction products of ED were superior to HEED reaction products, and the reaction products of animal fat and waste vegetable oil were superior to those of pure soybean oil.

• 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 Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.1
• /
• pp.125-129
• /
• 2015

The most important factor within the wireless sensor network is to have effective network usage and increase the lifetime of the individual nodes in order to operate the wireless network more efficiently. Therefore, many routing protocols have been developed. The LEACH protocol presented by Wendi Heinzelman, especially well known as a simple and efficient clustering based routing protocol. However, because LEACH protocol in an irregular network is the total data throughput efficiency dropped, the stability of the cluster is declined. Therefore, to increase the stability of the cluster head, in this paper, it proposes a stochastic cluster head selection method for improving the LEACH protocol. To this end, it proposes a SH-LEACH(Stochastic Cluster Head Selection Method-LEACH) that it is combined to the HEED and LEACH protocol and the proposed algorithm is verified through the simulation.