• Journal of KIISE:Information Networking
• /
• v.28 no.3
• /
• pp.321-335
• /
• 2001

The explosive growth in wireless networking increasingly urges the demand to support mobility within the Internet which is what Mobile-IP aims to provide. Because the transmission of signals through open-air s easy to be attacked, it is important to provide secure transmission for mobile users and make them responsible for what they have done in networks. Although IETF provides a secret-key based security mechanism, those mechanisms suffer from scalability, efficiency and non-repudiation service problem. The proposed mechanism uses public-key based authentication optimizing the performance. It includes non-repudiation service on the side of mobile for airtight security in wireless network. The simulation results show that the proposed authentication reduces the total registration time. It especially minimizes the computation cost on the side of the mobile node and solves the power problem. In practice, the proposed authentication is feasible with reasonable performance and security service in macro mobility that Mobile-IP is intended to solve.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.8 no.3
• /
• pp.91-99
• /
• 2009

Development of high-speed Internet services and the increased supply of mobile devices have become the key factor for the acceleration of ubiquitous technology. WiBro system, formed with lP backbone network, is a MBWA technology which provides high-speed multimedia service in a possibly broader coverage than Wireless LAN can offer. Wireless telecommunication environment needs not only mobility support in Layer 2 but also mobility management protocol in Layer 3 and has to minimize handover latency to provide seamless mobile services. In this paper, we propose a fast cross-layer handover scheme based on signal strength prediction in WiBro environment. The signal strength is measured at regular intervals and future value of the strength is predicted by Exponential Smoothing Method. With the help of the prediction, layer-3 handover activities are able to occur prior to layer-2 handover, and therefore, total handover latency is reduced. Simulation results demonstrate that the proposed scheme predicts that future signal level accurately and reduces the total handover latency.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.9 s.339
• /
• pp.29-40
• /
• 2005

In this paper, we propose a Cluster-based Multicast Routing (CMR) suitable for mobile ad-hoc networks. The main features that our proposed method introduces are the following: a) mobility-based clustering and group based hierarchical structure in order to effectively support stability and scalability, b) group based mesh structure and forwarding tree concepts in order to support the robustness of the mesh topologies which provides limited redundancy and the efficiency of tree forwarding simultaneously, and c) combination of proactive and reactive concepts which provide low route acquisition delay and low overhead. The performance evaluation of the proposed protocol is achieved via modeling and simulation. The corresponding results demonstrate the Proposed multicast protocol's efficiency in terms of packet delivery ratio, scalability, control overhead, end-to-end delay, as a function of mobility, multicast group size, and number of senders.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.19 no.10
• /
• pp.1075-1085
• /
• 2008

Recently, it is studied actively that DVB-S2 for mobility standard(DVB-S2M) is combined with DVB-H, DVB-T and conventional DVB-S2 standard for continuous satellite broadcasting and internet service. Especially, overcoming deep fading by tunnel is main subject. For overcoming deep fading, DVB-S2M proposed cross layer system is consist of upper layer and physical layer. Thus, this paper proposed optimal upper layer coding system fixing the physical layer coding under the simulation results by coding methods, train speed, data rate, interleaver size and IP packet size.

• Journal of IKEEE
• /
• v.5 no.1 s.8
• /
• pp.59-66
• /
• 2001

In this paper, we propose a dynamic source routing protocol supporting asymmetric paths for mobile Ad Hoc networks that contain unidirectional links. At present, the existing dynamic source routing protocol supports only symmetric paths that consist of bidirectional links for routing. However, in fact, there can exist unidirectional links due to asymmetric property of mobile terminals or current wireless environment. Thus, we implement a mobile Ad Hoc routing protocol supporting unidirectional links, which is fit for more general wireless environment. Especially, the proposed protocol uses an improved multipath maintenance method in order to perform rapid route reconfiguration when route error due to mobility is detected. For performance evaluation, we consider the following factors: average route discovery time and average data reception rate. In order to obtain the factors of the performance evaluation, we did simulation for 900 seconds in the step of 100 seconds with the following scenarios: usage of route cache in intermediate nodes on route path, and different mobility/connection patterns.

• The KIPS Transactions:PartC
• /
• v.13C no.3 s.106
• /
• pp.345-352
• /
• 2006

In the integrated wired/wireless network which consists of the Internet and moving networks, multiple wireless links are used to connect a fixed host(FH) in the Internet to a mobile host(MH) in the moving network. For use in such an environment, we propose a scheme to overcome the TCP performance degradation due to the packet losses over the wireless links without losing the end-to-end TCP semantics. The proposed scheme in each mobile router(MR) allows to obtain the information regarding packet losses over the upstream wireless links based on the received packet sequence number and the ACK number. This information is delivered to the upstream router, which enables the upstream access router(AR) or MR to quickly retransmit the lost packets. The proposed scheme has the feature to quickly recover the packet losses incurred over the upstream wireless links and the performance of the proposed scheme is evaluated through simulation. It is shown that the significant performance gain can be obtained using the proposed scheme compared with the snoop mechanism which maintains end-to-end TCP semantics and does not require any additional features at the source and/or destination nodes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.8B
• /
• pp.839-845
• /
• 2009

The Vehicular Ad-hoc Network (VANET) has two main problems to be overcome due to high mobility and frequently changing density: one is short link duration time and the other is high packet loss ratio. To solve the problems, there have been many studies to predict vehicular mobility. Most of the studies try to enhance link expire time and link reliability, however the distance between two relay nodes becomes too short to have high network throughput. In this paper, we propose a new routing algorithm that considers both link expire time and network throughput in the VANET. The proposed algorithm aims to find path with long link expire time and high throughput. Our simulation results show that the proposed algorithm outperforms the legacy greedy algorithm and its variants.

• Journal of Digital Contents Society
• /
• v.14 no.1
• /
• pp.89-95
• /
• 2013

Many peer-to-peer (p2p) systems have been studied in distributed, ubiquitous computing environments. Distributed hash table (DHT)-based p2p systems can improve load-balancing even though locality utilization and user mobility are not guaranteed. We propose a mobile locality-based hierarchical p2p overlay network (MLH-Net) to address locality problems without any other services. MLH-Net utilizes mobility features in a mobile environment. MLH-Net is constructed as two layers, an upper layer formed with super-nodes and a lower layer formed with normal-nodes. The simulation results demonstrate that MLH-Net can decrease discovery routing hops by 13% compared with JXTA and 69% compared with Chord. It can decrease the discovery routing distance by 17% compared with JXTA and 83% compared with Chord depending on the environment.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.4
• /
• pp.9-16
• /
• 2011

This paper represents an interworking architecture for keeping the VLC audio quality between Worldwide Interoperability for Microwave Access (WiMAX) and IEEE 802.11 Mobile Ad hoc Network (MANET) where both mobile routers and mobile nodes are moving dynamically. Systematic performance analysis on the interworking architecture has been conducted by using OPNET simulator to show the results such as Packet Delivery Ratio (PDR) and throughput. Based on simulation results, when the number of MANET nodes is small, PDR remains relatively stable even though data packets increase. However, with the many MANET nodes, PDR decreases as data traffic increases. Throughput is affected by the number of MANET nodes. Especially when the MANET node density has increased further, throughput is much higher, but it is not affected by the mobility speed. However, FTP download and upload response time is not affected much by both the number of MANET nodes and the mobility speed.

• The Journal of Korean Association of Computer Education
• /
• v.10 no.5
• /
• pp.81-88
• /
• 2007

To support the movement of a mobile network consisting of several mobile nodes, the IETF NEMO working group proposed NEMO basic support protocol using bi-directional tunneling between the home agent and the mobile router. Since NEMO basic support protocol is based on bi-directional tunneling, all communications to and from mobile nodes are suffer from inefficient routing all the cases. To solve the routing inefficiency problem, several proposals are proposed. However, those proposals results in new problems, such as binding update storm and changes in existing protocol. Especially, binding update storm problem may cause the delay in binding update, this subsequently causes the difficulty for a real time service and the handoff delay on the movement of mobile network. In this paper, we propose a new binding update scheme which reduces binding update latency and the handoff delay through the distribution of the transmission time of binding update messages. The performance of the proposed scheme is also evaluated to demonstrate its efficiency. Simulation results show that the proposed scheme can efficiently reduce the binding update latency.