• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.11
• /
• pp.2091-2098
• /
• 2006

In this paper, it proposes a protocol of resource adaptive data dissemination for sensor nodes in a wireless sensor network. In general, each sensor node used in a wireless sensor network delivers the required information to the final destination by conducting cooperative works such as sensing, processing, and communicating each other using the battery power of a independent sensor node. So, a protocol used for transferring the acquired information to users through the wireless sensor network can minimize the power consumption of energy resource given to a sensor node. Especially, it is very important to minimize the total amount of power consumption with a method for handling the problems on implosion. data delivery overlapping, and excessive message transfer caused by message broadcasting. In this paper, for the maintaining of the shortest path between sensor nodes, maximizing of the life time of a sensor node and minimizing of communication cost, it presents a method for selecting the representative transfer node for an event arising area based on the negotiation scheme and maintaining optimal transfer path using hop and energy information. Finally, for the performance evaluation, we compare the proposed protocol to existing directed diffusion and SPIN protocol. And, with the simulation results, we show that the proposed protocol enhances the performance on the power consumption rate when the number of overall sensor nodes in a sensor network or neighbor sensor nodes in an event area are increased and on the number of messages disseminated from a sensor node.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.5
• /
• pp.211-217
• /
• 2019

The three major inventions of Jeju include the field wall of Kim Koo Pan Gwan in 1234, Jeongnang in the custom of grazing the people of Jeju, and Olleh in the tomb of Munbang-gui in 1406. Field wall, Oedam from the stone and the stone of numerical play, made Koendang, a friendship society. Even with a typhoon that is more than 30m/s, the Koendang which is about 1.5m high, will not collapse. Similarly, the main family networks of Jeju society do not collapse under any difficulties situation. When building a field wall, two stones, which are under the ground, are placed side by side, and the upper left stone is placed on top and the upper right stone is attached regularly. One stone or two stone is attached from the bottom to the top, and when a stone is small or large, a flat field is formed in one space. The Family networks is close to the grandfather, grandmother, father, mother, and me, and the distant kin represents a horizontal relationship. The field wall is a vertical relationship that builds up from bottom to top of the vertical relation, while the Koendang is a horizontal relationship where blood is distributed to the grandson of his upper grandparents. This paper proves by a non-orthogonal symmetric weighted Hadamard matrix of whether the stone in the middle of a field wall has large stones (small).

• Journal of KIISE:Information Networking
• /
• v.35 no.5
• /
• pp.409-414
• /
• 2008

In mobile ad hoc networks, most of on demand routing protocols such as DSR and AODV do not deal with traffic load during the route discovery procedure. To solve the congestion and achieve load balancing, many protocols have been proposed. However, the existing load balancing schemes has only considered avoiding the congested route in the route discovery procedure or finding an alternative route path during a communication session. To mitigate this problem, we have proposed a new scheme which considers the packet bursting mechanism in congested nodes. The proposed packet bursting scheme, which is originally introduced in IEEE 802.11e QoS specification, is to transmit multiple packets right after channel acquisition. Thus, congested nodes can forward buffered packets promptly and minimize bottleneck situation. Each node begins to transmit packets in normal mode whenever its congested status is dissolved. We also propose two threshold values to define exact overloaded status adaptively; one is interface queue length and the other is buffer occupancy time. Through an experimental simulation study, we have compared and contrasted our protocol with normal on demand routing protocols and showed that the proposed scheme is more efficient and effective especially when network traffic is heavily loaded.

• The KIPS Transactions:PartC
• /
• v.10C no.3
• /
• pp.377-386
• /
• 2003

This study suggested a technique to maintain an efficient core-based multicast tree using weighted clustering factors in mobile Ad-hoc networks. The biggest problem with the core-based multicast tree routing is to decide the position of core node. The distance of data transmission varies depending on the position of core node. The overhead's effect on the entire network is great according to the recomposition of the multicast tree due to the movement of core node, clustering is used. A core node from cluster head nodes on the multicast tree within core area whose weighted factor is the least is chosen as the head core node. Way that compose multicast tree by weighted clustering factors thus and propose keeping could know that transmission distance and control overhead according to position andmobility of core node improve than existent multicast way, and when select core node, mobility is less, and is near in center of network multicast tree could verification by simulation stabilizing that transmission distance is short.

• The Journal of the Convergence on Culture Technology
• /
• v.3 no.4
• /
• pp.1-19
• /
• 2017

Death culture continues to lead human history with complementarity in the sense that it is half of life culture. The three sacred gates and the two tombs are connected to the olegil space. In this space, the principle of complementarity in which coexistence exist between life and death is hidden in Jeju culture. It is a question and wait. Contrarily, the opposite is complementary. (Contraria Sunt Complementa Latin) This refers to the relationship of each other in relation to one another and in a mutually dependent relationship. The Jong Nang is used as basic logic in DNA codon of human body as well as communication principle. In addition, there is a pattern of similarity of the linkage between the square oval ear of the grave, the Korean Taegeukguk and 卦, the genome (DNA) 卦. The Jong Nang 'Batdam' and 'Sandam' are conneted like 'black dragon ten thousand', and stone walls are connected to each other as the stone network, which is called as the 'Goendam' (and conventionally is told as the 'Goendang') and is related to the Family networks. The relationship between the Tomb of the ancestors and their offspring is believed to be "Soul Synchronizing the Ancestor to Offspring" and becomes "Change in Future", and Genetic factors in the physical blood are transmitted directly to the children. The DNA RNA was represented by the determinant.

• The KIPS Transactions:PartC
• /
• v.13C no.5 s.108
• /
• pp.541-548
• /
• 2006

Sensor network is a network for realizing the ubiquitous computing circumstances, which aggregates data by means of observation or detection deployed at the inaccessible places with the capacities of sensing and communication. To realize this circumstance, data which sensor nodes gathered from sensor networks are delivered to users, in which it is required to encrypt the data for the guarantee of secure communications. Therefore, it is needed to design key management scheme for encoding appropriate to the sensor nodes which feature continual data transfer, limited capacity of computation and storage and battery usage. We propose a key management scheme which is appropriate to sensor networks organizing hierarchical architecture. Because sensor nodes send data to their parent node, we can reduce routing energy. We assume that sensor nodes have different security levels by their levels in hierarchy. Our key management scheme provides different key establishment protocols according to the security levels of the sensor nodes. We reduce the number of sensor nodes which share the same key for encryption so that we reduce the damage by key exposure. Also, we propose key update protocols which take different terms for each level to update established keys efficiently for secure data encoding.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 1999.12a
• /
• pp.121-129
• /
• 1999

When continuous media are transmitted over the communication networks, asynchrony which can not maintain temporal relationships among packets may occur due to a random transit delay. There exist two types of synchronization schemes ; for guaranteed or non-guaranteed resource networks. The former which applies a resource reservation technique maintains delay characteristics, however, the latter supply a best-effort service. In this paper, I propose a intra-media synchronization scheme to transmit continuous media on general networks not guaranteeing a bounded delay tome. The scheme controls transmission times of the packets by estimating next delay time with the delay distribution. So, the arriving packets may be maintained within a limited delay boundary, and playout will be performed after buffering to smoothen small delay variations. The continually increasing delay due to network overload causes buffer underflow at the receiver. To solve it, the transmitter is required to speed up instantaneously. Too much increase of transmission-rate may cause network congestion. At that time, the transmitter drops the current packet when informed excessive delay from the receiver.

• The KIPS Transactions:PartC
• /
• v.12C no.4 s.100
• /
• pp.473-480
• /
• 2005

We can obtain useful information by deploying large scale sensor networks in various situations. Security is also a major concern in sensor networks, and we need to establish pairwise keys between sensor nodes for secure communication. In this paper, we propose new pairwise key establishment mechanism based on clustering and polynomial sharing. In the mechanism, we divide the network field into clusters, and based on the polynomial-based key distribution mechanism we create bivariate Polynomials and assign unique polynomial to each cluster. Each pair of sensor nodes located in the same cluster can compute their own pairwise keys through assigned polynomial shares from the same polynomial. Also, in our proposed scheme, sensors, which are in each other's transmission range and located in different clusters, can establish path key through their clusterheads. However, path key establishment can increase the network overhead. The number of the path keys and tine for path key establishment of our scheme depend on the number of sensors, cluster size, sensor density and sensor transmission range. The simulation result indicates that these schemes can achieve better performance if suitable conditions are met.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.5
• /
• pp.191-198
• /
• 2013

It is required to transmit data through shorter path between sensor and base node for real time intrusion detection in wireless sensor networks (WSN) with a mobile base node. Because minimum Wiener index spanning tree (MWST) based routing approach guarantees lower average hop count than that of minimum spanning tree (MST) based routing method in WSN, it is known that MWST based routing is appropriate for real time intrusion detection. However, the minimum Wiener index spanning tree problem which aims to find a spanning tree which has the minimum Wiener index from a given weighted graph was proved to be a NP-hard. And owing to its high dependency on certain nodes, minimum Wiener index tree based routing method has a shorter network lifetime than that of minimum spanning tree based routing method. In this paper, we propose a multi-objective ant colony optimization algorithm to tackle these problems, so that it can be used to detect intrusion in real time in wireless sensor networks with a mobile base node. And we compare the results of our proposed method with MST based routing and MWST based routing in respect to average hop count, network energy consumption and network lifetime by simulation.

• Journal of KIISE:Information Networking
• /
• v.36 no.6
• /
• pp.514-527
• /
• 2009

Wireless sensor networks (WSNs) can be used in various applications for military or environmental purpose. Recently, there are lots of on-going researches for detecting and tracking the spread of continuous objects or phenomena such as poisonous gas, wildfires, earthquakes, and so on. Some previous work has proposed techniques to detect edge nodes of such a continuous object based on the information of all the 1-hop neighbor nodes. In those techniques, however, a number of nodes are redundantly selected as edge nodes, and thus, the boundary of the continuous object cannot be presented accurately. In this paper, we propose a new edge detection method in which edge nodes of the continuous object are detected based on the information of the neighbor nodes obtained via the Localized Delaunay Triangulation so that a minimum number of nodes are selected as edge nodes. We also define the sensor behavior rule for tracking continuous objects energy-efficiently. Our simulation results show that the proposed edge detection method provides enhanced performance compared with previous 1-hop neighbor node based methods. On the average, the accuracy is improved by 29.95% while the number of edge nodes, the amount of communication messages and energy consumption are reduced by 54.43%, 79.36% and 72.34%, respectively. Moreover, the number of edge nodes decreases by 48.38% on the average in our field test with MICAz motes.