• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.8
• /
• pp.1789-1798
• /
• 2012

IEEE 802.15.4a standard can provide a variety of location-based services for ZigBee or wireless network applications by adapting the time-of-arrival (TOA) ranging technique. The non-line-of-sight (NLOS) condition is the critical problem in the IEEE 802.15.4a networks, and it can significantly degrade the performance of the TOA-based localization. To enhance the location accuracy due to the NLOS problem, this paper proposes an energy-efficient low complexity localization algorithm. The proposed approach performs the ranging with the multicast method, which can reduce the message overhead due to packet exchanges. By limiting the search region for the location of the node, the proposed approach can enhance the location accuracy. Experimental results show that the proposed algorithm outperforms previous algorithms in terms of the energy consumption and the localization accuracy.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.22 no.8
• /
• pp.797-804
• /
• 2011

Network coding has recently emerged as an effective solution for multicast and broadcast communications in wireless ad hoc networks. In this paper, we propose a throughput performance model for IEEE 802.11 wireless networks with network coding. Specifically, we consider IEEE 802.11 DCF protocol and linear topology in which traffic sources are located at both ends and intermediate nodes act as relays performing network coding. The proposed analytic model has the form of nonlinear equations in terms of throughput of each node. The solution of the nonliear equations thus correspond to the end-to-end throughput. Extensive simulation experiments have been performed to validate accuracy of the proposed model. Numerical results show that the results of the proposed analytic model agree fairly well with the corresponding simulation results.

• Journal of Internet Computing and Services
• /
• v.11 no.4
• /
• pp.143-158
• /
• 2010

The illegal leakage of enterprise digital confidential information will threaten the enterprise with bankruptcy. Today since most small-and-medium companies have no capability to fight against illegally compromising their critically confidential documents in spite of knowing the leakage of them, strongly safe distribution system of the digital confidential documents should be designed so in secure as to prevent any malicious intent of embezzlement from accessing the critical information. Current DRM-based protection system is not always perfect to protect the digital secrets, even seems to leave the secrets open. Therefore our study has analyzed the illegal leakage paths that hackers attack against and the vulnerability of the current protection systems. As result, we study the group communication based system architecture satisfying the security conditions to make even legitimate working employee keep out of the confidential documents, without performance degradation. The main idea of this architecture is to stay every secrets in encrypted form; to isolate the encrypted documents from the crypto-key; to associate every entity with one activity and to authenticate every entity with DSA-based public key system; multiple authentication method make hackers too busy to get a privilege to access the secrets with too many puzzle pieces. This paper deal with the basic architectural structure for the above issues.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.8
• /
• pp.1847-1854
• /
• 2005

This paper proposes a approach to configure efficient video-on-demand system by introducing Multicast and Cache Video-on-Demand (MCVoD) system. As a key element or the MCVoD system, interchange agent provides this system with multicasting and switching functions. With the multicasting, the MCVoD system is able to reduce the load on the network as well as VoD servers by transmitting only one video request instead of sending multiple requests on a same video stream. The switching enables clients to receive the lust stream of requested video streams instantly without waiting time and also allows avoiding undesirable duplication of video streams in the system. With various experiment results through simulation about waiting tine and cache hit ratio, we show that the MCVoD system employing the interchange agent provides better performance than current uni-proxy based system.

• Journal of Broadcast Engineering
• /
• v.17 no.1
• /
• pp.95-107
• /
• 2012

Network coding was proposed to increase the achievable throughput of multicast in a network. Recently, combining network coding into user cooperation has attracted research attention. For cooperative transmission schemes with network coding, users combine their own and their partners messages by network coding. In previous works, it was shown that adaptive DF with network coding can achieve diversity gain and additional throughput gain. In this paper, to improve performance of conventional protocols and maximize advantage of using network coding, we propose a new network coding based user cooperation scheme which uses adaptively amplify-and-forward and decode-and-forward according to interuser channel status. We derive outage probability bound of proposed scheme and prove that it has full diversity order in the high SNR regime. Moreover, based on the outage bound, we compute optimal power allocation for the proposed scheme.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.2
• /
• pp.331-338
• /
• 2011

Objectives of shipboard integration networks are to exchange and manage integrated information. Shipboard integration networks use UDP(User Datagram Protocol) multicast for the exchange of information. However, such information can be missed or damaged because UDP can't guarantee reliability. The standard of shipboard integration networks defines error log functions for the missed or damaged information. In this paper, we analyze internal and external log functions. The internal log function records errors internally, and the external log function sends error messages to a log server and records them in a database. We also develop a log processing module and log server for the external log function.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.6
• /
• pp.1026-1031
• /
• 2008

Nowdays, homes and small businesses rely more and more PON(Passive Optical Networks) for financial transactions, private communications and even telemedicine. Thus, encryption for these data transactions is very essential due to the multicast nature of the PON In this parer, we presented our implementation of a counter mode AES based on Virtex4 FPGA. Our design exploits three advanced features; 1) Composite field arithmetic SubByte, 2) efficient MixColumn transformation 3) and on-the-fly key-scheduling for fully pipelined architecture. By pipeling the composite field implementation of the S-box, the area cost is reduced to average 17 percent. By designing the on-the-fly key-scheduling, we implemented an efficient key-expander module which is specialized for a pipelined architecture.

• The Journal of the Convergence on Culture Technology
• /
• v.5 no.1
• /
• pp.429-434
• /
• 2019

There are several high technologies applied to the driving cars such as self-driving car and connected car for safe and convenient driving. VANET provides useful information such as route selection and gas price by communicating nearby cars and RSUs. VANET prefers CCN rather than traditional TCP/IP stack because CCN offers inherent multicast communication for sharing traffic information as well as traditional unicast. When all participating node rebroadcasts the Interest packets in a Vehicular CCN, the network may suffer from Broadcast Storm Problem. In order to mitigate the effect of the problem and to improve the Data packet transmission, not all but some selected nodes have to rebroadcast the packet. This paper simulates car movements using SUMO and evaluates data transmission performance using ns-3. According to the simulation results, when some selected nodes rebroadcast the Interest packets, the transmission performance improves 10% to 25% depending on the number of requesting nodes.

• The Journal of Korean Institute of Next Generation Computing
• /
• v.14 no.6
• /
• pp.75-86
• /
• 2018

The DDS (Data Distribution Service) specification defines a discovery method for finding participants and endpoints in a DDS network. The standard discovery mechanism uses the multicast protocol and finds all the endpoints in the network. Because of using multicasting, discovery may fail in a network with different segments. Other problems include that memory space wastes due to storing information of all the endpoints. The Topic Name Service (TNS) solves these problems by unicasting only the endpoints, which are required for communication. However, an extra delay time is inevitable in components of TNS, i.e, a front-end server, topic name servers, and a terminal server. In this paper, we analyze the performance of TNS. Delay times in the servers of TNS and time required to receive endpoint information are measured. Time to finish discovery and number of receiving endpoints compare with the standard discovery method.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.11
• /
• pp.589-598
• /
• 2007

In the group communication which has multiple data streams and various access privileges, it is necessary to provide group access control. The group members having the same access privilege are classified into one class, and the classes form a hierarchy based on the access relations. Then each class is assigned to a secret key. In the previous schemes, a single logical key graph is constructed from the hierarchy and each member always holds all secret keys of the classes he can access in the proactive manner. Thus, higher-privileged members hold more keys then lower-privileged members. However, if the hierarchy is large, each member manages too many keys and the size of multicast message in rekeying increases in proportion to the size of the hierarchy. Moreover, most of the members access a small portion of multiple data streams simultaneously. Therefore, it is redundant to receive rekeying message and update the keys in which he is not currently interested. In this paper, we present a new key management scheme that takes a reactive approach in which each member obtains the key of a data stream only when he wants to access the stream. Each member holds and updates only the key of the class he belongs. If he wants to get the key of other class, he derives it from his key and the public parameter. Proposed scheme considerable reduces the costs for rekeying, especially in the group where access relations are very complex and the hierarchy is large. Moreover, the scheme has another advantage that it easily reflects the change of access relations.