• Proceedings of the Korea Information Processing Society Conference
• /
• 2015.04a
• /
• pp.210-211
• /
• 2015

Proxy Mobile IPv6 (PMIPv6) is a network based IP mobility management protocol. PMIPv6 make sure that the IP address of the mobile node remains the same as long as the mobile node roams with in the PMIPv6 domain. A mobile node roams with in a PMIPv6 domain. PMIPv6 protocol doesn't provide the mobility support once the mobile node moves from one PMIPv6 domain to another PMIPv6 domain. This paper proposes a Software Defined Networking (SDN) based PMIPv6 scheme which provides the mobility support for inter PMIPv6 domain movement of mobile node. In the proposed architecture each PMIPv6 domain has a SDN controller and SDN controllers from different domains communicate with each other to share the mobility information.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.12
• /
• pp.2261-2269
• /
• 2017

The current LTE network system provides service by locally allocating eNodeB to the EPC(Evolved Packet Core). However, it is not suitable for inter-node communication based on the distributed network environment. In this paper, we propose an integrated system by configuring E-UTRAN and EPC as All-In-One type to enable service in each distributed node. M2M UE is mounted on a each node for wireless In-band backhaul link. The integrated node provides inter-node communication over the wireless in-band backhaul link. If a normal UE moves and an access node changes in the system all entities of LTE integrated into one, it is necessary to change the P-GW which is IP anchor. In order to support the inter-node mobility even if P-GW is changed, We defined UPFE(User Packet Forwarding Extension) scheme and implemented the handover procedure of EPC. Also, we analyze the cell range of the integrated LTE system with the addition of the node and compare the handover delay with the current system.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.9
• /
• pp.407-415
• /
• 2007

In parallel cluster computing systems, the efficiency of communication between computing nodes is one of important factors that decide overall system performance. Accordingly, many researchers have studied on high-performance inter-node communication. The recently launched multi-core processor, however. increases the importance of intra-node communication as well because the more the number of cores in a node, the more the number of parallel processes running in the same node. Though there have been studies on intra-node communications, these have limited considerations on the state-of-the-art systems. In this paper, we propose a Linux kernel module that minimizes the number of data copy by exploiting the memory mapping mechanism for high-performance intra-node communication. The proposed kernel module supports the Linux kernel version 2.6. The performance measurements over a multi-core system present that the proposed kernel module can achieve lower latency up to 62% and higher throughput up to 144% than an existing kernel module approach. In addition, the measurements reveal that the performance of intra-node communication can vary significantly based on whether the cores that run the communication processes are belong to the same processor package (i.e., sharing the L2 cache).

• The KIPS Transactions:PartC
• /
• v.14C no.7
• /
• pp.571-582
• /
• 2007

Vehicular ad-hoc networks is temporarily established through inter-vehicle communication without any additional infrastructure aids. It requires a immediate message propagation because it mainly deals with critical traffic information such as traffic accidents. The distance-based broadcast scheme is one of the representative broadcast schemes for vehicular ad-hoc network. In this scheme, a node to disseminate messages is selected based on a distance from a source node. However, a message propagation delay will be increased if the relay nodes are not placed at the border of transmission range of the source node. In particular, when the node density is low, the message propagation delay is getting longer. In this paper, we propose a time-window reservation based relay node selection scheme. A node receiving the alert message from the source node has its time-window and randomly selects its waiting time within the given time-window range. A proportional time period of the given time-window is reserved in order to reduce the message propagation delay. The experimental results show that the proposed scheme has shorter message propagation delay than the distance-based broadcast scheme irrespective of node density in VANET. In particular, when the node density is low, the proposed scheme shows about 26% shorter delay and about 46% better performance in terms of compound metric, which is a function of propagation latency and network traffic.

• Journal of Communications and Networks
• /
• v.15 no.5
• /
• pp.504-513
• /
• 2013

Communication in delay tolerant networks (DTNs) relies on message transport by mobile nodes, and a correct understanding of the node mobility characteristics is therefore crucial to the design of an efficient DTN routing protocol. However, previous work has mainly focused on uncovering all behaviors of node movement, which is not conducive to accurately detecting the specific movement characteristics of a different node. In this paper, we seek to address this problem based on a consideration of social relationships. We first consider social ties from both static and dynamic perspectives. For a static perspective, in addition to certain accidental events, social relations are considered for a long time granularity and tend to be stable over time. For a dynamic perspective, social relations are analyzed in a relatively short time granularity and are likely to change over time. Based on these perspectives, we adopted different efficient approaches to dividing node pairs into two classes, i.e., familiar and unfamiliar pairs. A threshold approach is used for static social ties whereas a density-based aggregation method is used for dynamic social relationships. Extensive experimental results show that both familiar and unfamiliar node pairs have the same inter-contact time distribution, which closely follows a power-law decay up to a certain point, beyond which it begins to exponentially decay. The results also demonstrate that the inter-contact time distribution of familiar pairs decays faster than that of unfamiliar pairs, whether from a static or dynamic perspective. In addition, we also analyze the reason for the difference between the inter-contact time distributions of both unfamiliar and familiar pairs.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.1
• /
• pp.33-39
• /
• 1998

A queueing model for performance evaluation of finite buffered inter-node communication system is proposed in this paper. Each components are modeled as M/M/I/B queues to obtain the steady state probabilities and ar-rival rate and to analyze finite buffer behavior, The overall sysrem is integrated as series queues with blocking. Average delay and throughput are the performance measures studied in this analysis. The analytical results are first validated through simulation. Next, the effect of buffer length is discussed using the proposed model.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.65 no.6
• /
• pp.1080-1082
• /
• 2016

In a multi-hop CR (Cognitive Radio) network, each node find a path to destination node through several links. If links have the same frequency channel, there can be a serious interference among the links and it can reduce the network capacity. In multi-channel CR networks, each channel has different capacity according to the inter-link interference, and each channel has different traffic properties of primary users. In this paper, we propose channel scheduling scheme to minimize channel interferences and collision with primary users. Simulation results show the improvement of channel capacity and collision rate with primary users.

• Journal of Korea Society of Industrial Information Systems
• /
• v.14 no.2
• /
• pp.81-85
• /
• 2009

In VANET, it is required one-way broadcast transmission because vehicles move at high speed and warning messages need to broadcast. our protocol employs digital signatures to authenticate nodes along the path. this prevents impersonation attacks and message modification attacks. our protocol also employs the node list to recognize intermediate nodes of the path. The node list, the time, and the nonce can prevent replay attacks.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.6
• /
• pp.1201-1206
• /
• 2007

In this paper, we propose an algorithm that improve network lifetime by adjusting cluster size according to location information of sensor node in wireless sensor network (WSN) using clustering algorithm. The collected sensing information by sensor nodes in each cluster are transferred to sink node using inter-cluster communications method. Cluster head (CH) that located nearby sink node spend much more energy than those of far from sink node, because nearer CH forwards more data, so network lifetime has a tendency to decrease. Proposed algorithm minimizes energy consumption in adjacent cluster to sink node by decreasing cluster size, and improve CH lifetime by distributing transmission paths. As a result of mathematical analysis, the proposed algorithm shows longer network lifetime in WSN.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.9 s.351
• /
• pp.88-98
• /
• 2006

VANET has several different characteristics from MANET such as high mobility of nodes and frequent change of node density and network topology. Due to these characteristics, the network topology based protocol, often used in MANET, can not be applied to VANET. In this paper, we propose an emergency warning message broadcast protocol using range based relay node selecting algorithm which determines the minimal waiting time spent by a given node before rebroadcasting the received warning message. Because the time is randomly calculated based on the distance between sender node and receiver node, a node chosen as a relay node is assured to have a minimal waiting time, even though it is not located at the border of radio transmission range. The proposed emergency warning message broadcast protocol has low network traffic because it does not need to exchange control messages for message broadcasting. In addition, it can reduce End-to-End delay under circumstances of low node density and short transmission range in VANET.