• The KIPS Transactions:PartC
• /
• v.15C no.6
• /
• pp.573-586
• /
• 2008

The improved performance and miniaturization of computer and the improvement of wireless communication technology have enabled the emergence of many high quality services. Among them multicast services are receiving much attention and their usage is increasing due to the increase of Internet multimedia services such as video conference, multimedia stream, internet TV, etc. Security plays an important role in mobile multicast services. In this paper, we proposed a secure multicast protocol for a hierarchical micro-mobility environment. The proposed secure multicast protocol provides security services such as authentication, access control, confidentiality and integrity using mechanisms including symmetric/asymmetric key crypto-algorithms and capabilities. To provide forward/backward secrecy and scalability, we used sub-group keys based on the hierarchical micro-mobility environment. With this security services, it is possible to guard against all kinds of security attacks performed by illegal mobile nodes. Attacks executed by internal nodes can be thwarted except those attacks which delete packet or cause network resources to be wasted. We used simulator to measure the performance of proposed protocol. As a result, the simulation showed that effect of these security mechanisms on the multicast protocol was not too high.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.9
• /
• pp.381-392
• /
• 2013

During the last decade, the multitude of advances attained in terminal computers, along with the introduction of mobile hand-held devices, and the deployment of high speed networks have led to a recent surge of interest in Quality of Service (QoS) for video applications. The main difficulty is that mobile devices experience disparate channel conditions, which results in different rates and patterns of packet loss. One way of making more efficient use of network resources in video services over wireless channels with heterogeneous characteristics to heterogeneous types of mobile device is to use a scalable video coding (SVC). An SVC divides a video stream into a base layer and a single or multiple enhancement layers. We have to ensure that the base layer of the video stream is successfully received and decoded by the subscribers, because it provides the basis for the subsequent decoding of the enhancement layer(s). At the same time, a system should be designed so that the enhancement layer(s) can be successfully decoded by as many users as possible, so that the average QoS is as high as possible. To accommodate these characteristics, we propose an efficient transmission scheme which incorporates SVC-aware dual-channel repetition to improve the perceived quality of services. We repeat the base-layer data over two channels, with different characteristics, to exploit transmission diversity. On the other hand, those channels are utilized to increase the data rate of enhancement layer data. This arrangement reduces service disruption under poor channel conditions by protecting the data that is more important to video decoding. Simulations show that our scheme safeguards the important packets and improves perceived video quality at a mobile device.

• Journal of KIISE
• /
• v.43 no.11
• /
• pp.1233-1244
• /
• 2016

In the IoT network environments for LLNs(Low power and Lossy networks), IPv6 Routing Protocol for Low Power and Lossy networks(RPL) has been proposed by IETF(Internet Engineering Task Force). The goal of RPL is to create a directed acyclic graph, without loops. As recommended by the IETF standard, RPL route recovery mechanisms in the event of a failure of a node should avoid loop, loop detection, DIO Poisoning. In this process, route recovery time and control message might be increased in the sub-tree because of the repeated route search. In this paper, we suggested RPL route recovery method to solve the routing overhead problem in the sub-tree during a loss of a link in the RPL routing protocol based on IoT wireless networks. The proposed method improved local repair process by utilizing a route that could not be selected as the preferred existing parents. This reduced the traffic control packet, especially in the disconnected node's sub tree. It also resulted in a quick recovery. Our simulation results showed that the proposed RPL local repair reduced the recovery time and the traffic of control packets of RPL. According to our experiment results, the proposed method improved the recovery performance of RPL.

• Journal of KIISE:Computing Practices and Letters
• /
• v.13 no.3
• /
• pp.153-164
• /
• 2007

The Access Grid (AG) provides collaboration environments over the IP multicast networks by enabling efficient exchange of multimedia contents among remote users; however, since lots of current networks are still multicast-disabled, it is not easy to deploy this multicast-based multi-party AG. For this problem, the AG provides multicast bridges as a solution by putting a relay server into the multicast networks. Multicast-disabled clients make UDP connections with this relay server and receive forwarded multicast traffics in unicast UDP packets. This solution is facing several limitations since it requires duplicate forwarding of the same packet for each unicast peer. Thus, in this paper, we propose an alternate solution for the multicast connectivity problem of the AG based on the UMTP (UDP multicast tunneling protocol). By taking advantage of flexibilities of UMTP, the proposed solution is designed to improve the efficiency of network and system utilization, to allow reuse of multicast-based AG applications without modification, and to partially address the NAT/firewall traversal issues. To verify the feasibility of proposed solution, we have implemented a prototype AG connectivity tool based on the UMTP, named as the AG Connector.

• Journal of Korea Multimedia Society
• /
• v.10 no.11
• /
• pp.1483-1495
• /
• 2007

Thanks to IEEE 802.11 technique, accessing Internet through a wireless LAN(Local Area Network) is possible in the most of the places including university campuses, shopping malls, offices, hospitals, stations, and so on. Most of the APs(access points) for wireless LAN are supporting 2.4 GHz band 802.11b and 802.11g protocols. This paper is introducing a C# library function which can be used to read RSSIs(Received Signal Strength Indicator) from APs. An LBS(Location Based Service) estimates the current location of the user and provides useful user's location-based services such as navigation, points of interest, and so on. Therefore, indoor, LBS is very desirable. However, an indoor LBS cannot be realized unless indoor position ing is possible. For indoor positioning, techniques of using infrared, ultrasound, signal strength of UDP packet have been proposed. One of the disadvantages of these techniques is that they require special equipments dedicated for positioning. On the other hand, wireless LAN-based indoor positioning does not require any special equipments and more economical. A wireless LAN-based positioning cannot be realized without reading RSSIs from APs. Therefore, our C# library function will be widely used in the field of indoor positioning. In addition to providing a C# library function of reading RSSI, this paper introduces implementation of indoor positioning modules making use of the library function. The methods used in the implementation are K-NN(K Nearest Neighbors), Bayesian and trilateration. K-NN and Bayesian are kind of fingerprinting method. A fingerprint method consists of off-line phase and realtime phase. The process time of realtime phase must be fast. This paper proposes a decision tree method in order to improve the process time of realtime phase. Experimental results of comparing performances of these methods are also discussed.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.3
• /
• pp.48-58
• /
• 2009

Geo-graphical routing protocols as GPSR are known to be very suitable and useful for vehicular ad-hoc networks. However, a corresponding node can include some stale neighbor nodes being out of a transmission range, and the stale nodes are pone to get a high priority to be a next relay node in the greedy mode. In addition, some useful redundant information can be eliminated during planarization in the recovery mode. This paper deals with a new recovery mode, the Greedy Border Superiority Routing(GBSR), along with an Adaptive Neighbor list Management(ANM) scheme. Each node can easily treat stale nodes on its neighbor list by means of comparing previous and current Position of a neighbor. When a node meets the local maximum, it makes use of a border superior graph to recover from it. This approach improve the packet delivery ratio while it decreases the time to recover from the local maximum. We evaluate the performance of the proposed methods using a network simulator. The results shown that the proposed protocol reveals much better performance than GPSR protocol. Please Put the of paper here.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.8 no.4
• /
• pp.53-64
• /
• 2009

Inter-vehicular communication that propagates information without infrastructures has drawn a lot of interest. However, it is difficult to apply conventional ad-hoc routing protocols directly in inter-vehicular communication due to frequent changes in the network topology caused by high mobility of the vehicles. MMFP(Multi-hop MAC Forwarding) is a unicast forwarding protocol that transport packets based on the reachability information instead of path selection or position information. However, delivering public safety messages informing road conditions such as collision, obstacles and fog through inter-vehicular communication requires broadcast rather than unicast since these messages contain information valuable to most drivers within a close proximity. Flooding is one of the simplest methods for multi-hop broadcast, but it suffers from reduced packet delivery-ratio and high transmission delay due to an excessive number of duplicated packets. This paper presents two multi-hop broadcast protocols for inter-vehicular communication that extend the MMFP. UMHB(Unreliable Multi-Hop Broadcast) mitigates the duplicated packets of MMFP by limiting the number of nodes to rebroadcast packets. UMHB, however, still suffers from low delivery ratio. RMHB(Reliable Multi-Hop Broadcast) uses acknowledgement and retransmission in order to improve the reliability of UMHB at the cost of increase in transmission delay, which we show through simulation is within an acceptable range for collision avoidance application.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.10A
• /
• pp.912-921
• /
• 2005

Optical burst switching(OBS) is a promising solution for building terabit optical routers and realizing If over WDM. Channel scheduling Algorithm for reduce contention is one of the major challenges in OBS. We address the issue of how to provide basic burst channel scheduling in optical burst switched WDM networks with fiber delay lines(FDLs). In OBS networks the control and payload components or a burst are sent separately with a time gap. If CHP arrives to burst switch node, because using scheduling algorithm for data burst, reservation resources such as wavelength and transmit data burst without O/E/O conversion, because contention and void between burst are happened at channel scheduling process for data burst that happened the link utilization and bust drop probability Existent proposed methods are become much research to solve these problems. Propose channel scheduling algorithm that use Release Time of bust to emphasize clearance between data and data dissipation that is happened in data assignment in this treatise and maximize bust drop probability and the resources use rate (RTUC : Release Time Unscheduled Channel). As simulation results, Confirmed that is more superior in terms of data drop and link utilization than scheduling algorithm that is proposed existing. As simulation results, confirmed improved performance than scheduling algorithm that is proposed existing in terms of survival of burst, efficiency resource and delay. However, In case load were less, degradation confirmed than existent scheduling algorithm relatively, and confirmed that is superior in data drop aspect in case of load increased.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.10
• /
• pp.2181-2190
• /
• 1997

The synchronous stream cipher has the problem of synchronization loss by cycle slip. Synchronization loss make the state which sender and receiver can't communicate and it may make the receiving system disordered. To lessen the risk, we usually use a continuous resynchronization which achieve resynchronization at fixed timesteps by inserting synchronization pattern and session key. While we can get effectively resynchronizationby continuous resynchronization, there are some problems. In this paper, we proposed an adaptive resynchronization algorithm for cipher system using LAPB protocol. It is able to solve the problem of the continunous resynchronization.The proposed adaptive algorithm make resynchronization only in the case that the resynchronization is occurred by analyzing the address field of LAPB. It measure the receiving rate of the address field in the decesion duration. If the receiving rate is smaller than threshold value, it make resynchronization or not. By using adaptively resynchronization, it solves the problems of continunous resynchronization. When the proposed adaptive algorithm is applied to the synchronous stream cipher system which is used in X.25 packet network, it reduced the time for resynchronization by ten times. It means that 11.3% of total data for transmit is compressed.

• The Journal of Information Technology
• /
• v.4 no.3
• /
• pp.87-100
• /
• 2001

IETF has proposed integrated services model(Int-Serv) and differentiated service(Diff-Serv) to supply IP QoS in Internet[1][2]. Int-Serv model uses state information of each IP flow, so satisfies QoS according to traffic characteristics, but increases the amount of flow state information with increasing flow number. Diff-Serv uses PHP(Per Hop Behaviour) and there are well-defined classes to provide differentiated traffics with different services according to delay and loss sensitivity. Diff-Serv model can provide diverse services in Internet because of having no the state and signal information of each flow. As MPLS uses the packet forwarding technology based on label, it implements the forwarding engine of high performance easily. The MPLS can set up the path having different and variable bandwidth and assign each path to particular CoS (Class of Service). Therefore it is possible to support the Diff-Serv model of well- defined classes that can provide the differentiated traffic with different services according to delay and loss sensitivity in IP QoS models of IETF. In this paper we propose a scheme that can accommodate Diff-Serv model to provide QoS. The system performance has been estimated by scheduling plan according to traffic classes.