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

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.21 no.5
• /
• pp.71-82
• /
• 2011

The RFID system provides undeniable advantages so that it is used for various application. However recent RFID system is vulnerable to some attacks as eavesdropping, replay attack, message hijacking, and tag tampering, because the messages are transmitted through the wireless channel and the tags are cheap. Above attacks cause the tag and reader impersonation, denial of service by invalidating tag, and the location tracking concerning bearer of tags, A lot of RFID authentication protocol bas been proposed to solve the vulnerability. Since Weis, Sanna, Rivest, and Engel, proposed the bash-based RFID authentication protocol, many researchers have improved hash-based authentication protocol and recent bash-based authentication protocols provide security and desirable privacy. However, it remains open problem to reduce the tag identification time as long as privacy and security are still guaranteed. Here we propose a new protocol in which the tags generate the message depending on the state of previous communitions between tag and reader. In consequence, our protocol allows a server to identify a tag in a reasonable amount of time while ensuring security and privacy, To be specific, we reduced the time for the server to identify a tag when the last session finished abnormally by at least 50% compared with other bash-based schemes that ensure levels of security and privacy similar to ours.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.9
• /
• pp.1332-1347
• /
• 1993

Existing instruments are composed independently according to their function and user constructed instrumentation system with those instruments. But in the late 1980s VXI bus enables to construct instrumentation system with various modular type instruments. For an VXI bus system with the word serial protocol, an increase of data size can degrade the system performance. In this paper shared memory protocol is proposed to overcome performance degradation. The shared memory protocol is analyzed using the GSPN and compared with that of the word serial protocol. It is shown that the shared memory protocol has a better performance than the word serial protocol. The VXI bus message based-system with the proposed shared memory protocol is constructed and experimented with signal generating device and FFT analyzing device. Up to 80 KHz input signal the result of FFT analysis is accurate and that result is agree with that of conventional FFT analyzer. In signal generating experiment from 100 KHz to 1.1 GHz sine wave is generated.

• Journal of Venture Innovation
• /
• v.2 no.1
• /
• pp.13-21
• /
• 2019

In LTE environment, which is 4th generation mobile communication systems, there is concern about private information exposure by transmitting initial identifier in plain text. This paper suggest mutual authentication protocol, which uses one-time password utilizing challenge-response and AES-based Milenage key generation algorithm, as solution for safe initial identification communication, preventing unique identification information leaking. Milenage key generation algorithm has been used in LTE Security protocol for generating Cipher key, Integrity key, Message Authentication Code. Performance analysis evaluates the suitability of LTE Security protocol and LTE network by comparing LTE Security protocol with proposed protocol about algorithm operation count and Latency.Thus, this paper figures out initial identification communication's weak points of currently used LTE security protocol and complements in accordance with traditional protocol. So, it can be applied for traditional LTE communication on account of providing additional confidentiality to initial identifier.

• Journal of Information Processing Systems
• /
• v.13 no.5
• /
• pp.1229-1242
• /
• 2017

In this paper, an interference aware distributed multi-channel MAC (IDMMAC) protocol is proposed for wireless sensor and actor networks (WSANs). The WSAN consists of a huge number of sensors and ample amount of actors. Hence, in the IDMMAC protocol a lightweight channel selection mechanism is proposed to enhance the sensor's lifetime. The IDMMAC protocol divides the beacon interval into two phases (i.e., the ad-hoc traffic indication message (ATIM) window phase and data transmission phase). When a sensor wants to transmit event information to the actor, it negotiates the maximum packet reception ratio (PRR) and the capacity channel in the ATIM window with its 1-hop sensors. The channel negotiation takes place via a control channel. To improve the packet delivery ratio of the IDMMAC protocol, each actor selects a backup cluster head (BCH) from its cluster members. The BCH is elected based on its residual energy and node degree. The BCH selection phase takes place whenever an actor wants to perform actions in the event area or it leaves the cluster to help a neighbor actor. Furthermore, an interference and throughput aware multi-channel MAC protocol is also proposed for actor-actor coordination. An actor selects a minimum interference and maximum throughput channel among the available channels to communicate with the destination actor. The performance of the proposed IDMMAC protocol is analyzed using standard network parameters, such as packet delivery ratio, end-to-end delay, and energy dissipation, in the network. The obtained simulation results indicate that the IDMMAC protocol performs well compared to the existing MAC protocols.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.18 no.6A
• /
• pp.85-96
• /
• 2008

Neighbor Discovery(ND) protocol is used to exchange an information of the neighboring nodes on the same link in the IPv6 protocol environment. For protecting the ND protocol, firstly utilizing Authentication Header(AH) of the IPsec protocol was proposed. But the method has some problems-uses of key exchange protocol is not available and it is hard to distribute manual keys. And then secondly the SEcure Neighbor Discovery(SEND) protocol which protects all of the ND message with digital signature was proposed. However, the digital signature technology on the basis of public key cryptography system is commonly known as requiring high cost, therefore it is expected that there is performance degradation in terms of the availability. In the paper, to improve performance of the SEND protocol, we proposed a modified CGA(Cryptographically Generated Address) which is made by additionally adding MAC(Media Access Control) address to the input of the hash function. Also, we proposed cache mechanism. We compared performance of the methods by experimentation.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.3
• /
• pp.39-45
• /
• 2013

In this paper, we propose a cooperative relaying protocol using Fountain codes for secondary network under interference constraint. In the proposed protocol, a secondary source uses Fountain codes to transmit its message to a secondary destination with help of a secondary relay. The secondary source and relay operate in the underlay model, in which they must adapt their transmit power so that the interference caused at a primary user is lower than an allowable threshold. To evaluate performance of the proposed protocol, we derive the expressions of average number of transmission times over Rayleigh fading channel. Various Monte-Carlo simulations are presented to verify the derivations.

• Journal of Korea Multimedia Society
• /
• v.19 no.10
• /
• pp.1808-1815
• /
• 2016

TPSN(Timing-sync Protocol for Sensor Networks), the representative of time synchronization protocol, has been already developed to provide time synchronization among nodes in wireless sensor networks. Even though the TPSN's method has been referenced by so many other time synchronization schemes for resource-constrained networks like wireless sensor networks or low power personal area networks, it has some inefficiency in terms of power consumption and network-wide synchronization time (or called convergence time). The main reason is that each node in TPSN needs waiting delay to solve the collision problem due to simultaneous transmission among competing nodes, which causes more power consumption and longer network convergence time for a network-wide synchronization. In this paper an improved scheme is proposed by changing message exchange method among nodes. The proposed scheme not only shortens network-wide synchronization time, but also reduce collision traffic which lead to needless power consumption. The proposed scheme's performance has been evaluated and compared with an original scheme by simulation. The results are shown to be better than the original algorithm used in TPSN.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.4
• /
• pp.926-937
• /
• 1996

A graph traversal technique is a certain pattern of visiting nodes of a graph. Many special traversal techniques have been applied to solve graph related problems. For example, the depth first search technique has been used for finding strongly onnected components of a directed graph or biconnected components of a general graph. The distributed protocol to implement his depth first search technique on the distributed network can be divided into a fixed topology problem where there is no topological change and a dynamic topology problem which has some topological changes. Therefore, in this paper, we present a more efficient distributed depth first search protocol with fixed topology and a resilient distributed depth first search protocol where there are topological changes for the distributed network. Also, we analysed the message and time complexity of the presented protocols and showed the improved results than the complexities of the other distributed depth first search protocols.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.7
• /
• pp.1518-1523
• /
• 2005

With the expansion of service over the internet, the recent network demands the amount of the more bandwidth and fast transfer rate. Optical Burst Switching has considered as a promising solution for supporting high-speed Internet Service. Because of OBS architecture, it has the security threats such as eavesdropping, masquerading, denial of service and so on. In this Paper, We analyze OBS-specific security threats and requirement for supporting security protocol n OBS networks. We propose an authentication and key exchange protocol for supporting the security service. This protocol supports explicit key authentication by using the control messages and protects the control message by using the session key.