• Journal of Korea Multimedia Society
• /
• v.11 no.7
• /
• pp.986-996
• /
• 2008

The home network environment based on the power line communication has some unexpected events. The noise source from the home appliances makes the network impedance increased, and the transmission packets distorted. Therefore the packet transmission from the source node may not be delivered to the destination node directly. In this paper we propose a new self-healing mechanism which relays the packet to the directly unreachable destination automatically with the help of intermediate nodes. In order to choose the minimum required intermediate nodes our mechanism makes a spanning tree with both the directly reachable nodes and indirectly reachable nodes via the intermedia nodes. We developed the network simulator in order to compare its performance to the Echelon's repeater selecting mechanism. Though it required more packet relations than Echelon's but the reachable probability to the destination was highly increased about two times.

• Journal of Korea Multimedia Society
• /
• v.12 no.2
• /
• pp.257-271
• /
• 2009

In this paper, we propose a protocol compression scheme for enhancing the performance of call processing of PTT(Push-to-Talk) which is one of the important services in IMS(IP Multimedia Subsystem), a next generation integrated wired/wireless packet communication network. To service the PTT on an IMS network, it should use the same call setup procedure as legacy Mobile and TRS(Trunked Radio System) networks and have a fast call setup time and enough communication bandwidth because a number of terminals should be able to exchange same data in real time. The proposed A+SigComp scheme reduces the initial call setup delay of SIP by about 10%, which is used by PTT service for call setup. In addition, the A+ROHC scheme is proposed to compress the header of RTP packets transferred during PTT voice transmission and, as a result, about 5% of increase in communication efficiency is observed.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.3
• /
• pp.68-74
• /
• 2008

Ethernet is the very successful technology in private local area network. Therefore, we can obtain the advantage to reduce network overhead due to such as protocol translation when to apply Ethernet to the public backbone network. However, in order to do that, it is required to restore the network within 50msec when link failure occurs, in order to provide seamless connections to end users. Currently, ITU-T standardized the automatic protection switching (APS) based Ethernet protection switching system. In this paper, we propose the improved Ethernet protection switching system to minimize the number of Ethernet frames lost when the network is restored from the failure. The proposed mechanism is analyzed by using simulation based on ns-2 and numerical results show that the proposed one provides superior performance.

• Journal of Internet Computing and Services
• /
• v.10 no.5
• /
• pp.27-32
• /
• 2009

Colored thread algorithm, suggested to be used for the label switching network, needs to be modified for the packet switching network. In this paper, it is recommended to add a merged state, besides the 3 states - null, colored and transparent - which are resulted from the behaviors of extend, rewind, stall, withdraw and merge events. The original colored thread algorithm is designed to generate a new thread and extend it to the downstream direction with unknown hop count when the thread has revisited the node that was visited. It also suggested rewinding the thread to the downstream direction by the source node, instead of rewinding it upstream direction by the revisited node. If a node received multiple threads which had a same forward equivalent class, then it checks first whether the hop counts are ascending or not. If it is in ascending order, then threads are merged. Otherwise the later thread is stalled until the former thread's color is to be changed to transparent or it is removed. This idea removes the effort of generating a new thread with unknown hop count.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.16 no.11
• /
• pp.1037-1053
• /
• 1991

Flooding is known to be an effective routing mechanism not only in circuit switched networks but also packet switched networks since it minimizes the time required for up calls and does not have to maintain routing tables or distance tables by periodically intercommunicating among all the network nodes. However, one main drawback of it is the overhead on the control message signaling channels, In the paper, we propose an overlaying scheme on the existing mechanism that retains the desired properties of flooding, yet provides congestion control to the network. This is done by utilizing the wasted search messages to inform the network of the conditions of each path from one node to another. The overhead is to maintain a path table in each node. However, this overhead is not so critical. Also, this scheme can take advantages further by limiting the extent of message propagation through the network and by incorporating trunk reservation schemes additionally.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.7
• /
• pp.1-8
• /
• 1999

In this paper, we have proposed and evaluated the performance of the routiong protocols servicing the mobile and fixed subscribers in a large e scale circuit switched telecommunication network, connected by gateways. The large scale network consists of several subnetworks, and a subnetwork is composed of $M{\times}N$ nodes in grid topology. When a call for mobile subscriber occurs, the current routing protocols search the whole large scale network to find a mobile subscriber. Therefore, it causes many redundant packets and long call setup delay. So, we have proposed a new routing protocol, in which the destination subscriber is first searched at the subnetwork where the call is proposed protocol is better than that of the current protocol.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.3A
• /
• pp.304-310
• /
• 2006

This paper evaluates the performance of three types of data delivery mechanisms in clustered sensor networks, as a basic research to develop an energy efficient topology management scheme. In the first mechanism, one node per cluster(clusterhead) turns on its radio(or wakes up) to transmit and receive RTS/CTS/DATA/ACK messages, but in the second one, k nodes per cluster wake up and participate in the message exchange. In the last mechanism, clusterheads turn on the radio to exchange RTS/CTS messages, and if a clusterhead receives RTS containing its cluster m as a destination, it makes k nodes in the cluster hun on the radio to receive DATA and transmit ACK. Through simulation, we show the energy consumption of the three types of data delivery mechanisms as functions of the number of active nodes per cluster, offered load, and packet loss probability.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.1 no.2
• /
• pp.81-89
• /
• 2008

Improved EKF suggests variable path prediction to reduce the event traffic caused by the information sharing among multi-users in networked virtual environment. The three dimensional virtual space is maintained consistently by endless status information exchange among dispersed users, and periodic status transmission brings traffic overhead in network. By using the error between the measured movement trace of dynamic information and the EKF predicted, we propose the method applied to predict the mobile packet of dynamic data which is simultaneously changing. And, the simulation results of DIS dead reckoning algorithms and EKF path prediction is compared here. It followed the specific path and while moving, the proposed method which it proposes predicting with DIS dead reckoning algorithm and to compare to the mobile path of the actual object and it got near it predicts the possibility of knowing it was.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.14 no.5
• /
• pp.49-56
• /
• 2004

An Internet draft, named RR(Return Routability) protocol, proposed to IETF mobileip WG, in order to establish an optimal path to MN(Mobile Node) by securely sending the BU(Binding Update) message to CN(Correspondent Node). However, it has some problems with initiating the protocol by the MN: it causes to increases in communication load in the home network, to increases communication delay between MN and CN, and increases in communication load due to unnecessary message exchanges. To resolve the problems, this paper proposes an alternative scheme for the RR protocol in MIPv6. The proposed scheme is devised to start the protocol by HA on receiving the first packet from CN. It decreases the route optimization overhead by reducing the number of BU messages as well as the communication time. Beside these advantages, this scheme provides the same security grade as the original RR protocol.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.18 no.2
• /
• pp.65-73
• /
• 2008

Security layer of the Cdma2000 1x EV-DO is currently completing standard (C.S0024-A v2.0). Accordingly, a hardware security devices, that allows to implementation requirement of the security layer described in standard document, is required to apply security function about data transferred between AT and AN of then Cdma2000 1x EV-DO environment. This paper represents design of hardware device providing EV-DO security with simulation of the security layer protocol via the FPGA platform. The SHA-1 hash algorithm for certification and service of packet data, and the AES, SEED, ARIA algorithms for data encryption are equip in this device. And paper represents implementation of hardware that applies optionally certification and encryption function after executing key-switch using key-switching algorithm.