• Journal of Korea Society of Digital Industry and Information Management
• /
• v.9 no.4
• /
• pp.95-101
• /
• 2013

MANET has an advantage that can build a network quickly and easily in difficult environment to build network. In particular, routing protocol that uses in existing mobile environment cannot be applied literally because it consists of only mobile node. Thus, routing protocol considering this characteristic is necessary. Malicious nodes do extensive damage to the whole network because each mobile node has to act as a router. In this paper, we propose technique that can detect accurately the suspected node which causes severely damage to the performance of the network. The proposed technique divides the whole network to zone of constant size and is performed simultaneously detection technique based zone and detection technique by collaboration between nodes. Detection based zone translates the information when member node finishes packet reception or transmission to master node managing zone and detects using this. The collaborative detection technique uses the information of zone table managing in master node which manages each zone. The proposed technique can reduce errors by performing detection which is a reflection of whole traffic of network.

• Journal of KIISE:Information Networking
• /
• v.32 no.1
• /
• pp.29-33
• /
• 2005

It is not future story that host mobility in wireless network. We already have many devices which can access network among moving our locations. Internet protocol is extended to support not only host mobility but also network mobility. But nesting mobile networks and mobile hosts, there is a problem that routing path of packet becomes complex. By sequential tunneling on outgoing packet at mobile router and toward mobile network at correspondent node, it can be setting up direct path in nested mobile network environment. In this paper, we propose a method for delivering packet through optimized path by sequential tunneling. And evaluate this method by equations and simulations.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04a
• /
• pp.205-207
• /
• 2004

MIPv6(Mobile IPv6)를 확장한 새로운 이동통신 기술인 이동 네트워크 (NEtwork Mobility, NEMO)는 여러 개의 노드와 하나 이상의 이동 라우터(Mobile Router, MR)로 구성되어 네트워크 단위로 이동성을 지원한다. NEMO의 경우 여러 네트워크들이 계층적으로 이루어진 형태를 가지고 있기 때문에, 상위 네트워크와 하위 네트워크의 긴밀한 관계가 유지되어야 한다. 따라서 이동 네트워크와 자신에게 서비스를 제공해 줄 방문 네트워크상에서 상위 네트워크와의 상호인중이 보안상 무엇보다 중요하다. 본 논문은 PKI와 challenge-response를 사용한 상호인중을 제안한다. 또한, 이러한 인중에 필요한 인증서를 받기 위해서는 기존의 중앙 집중화된 인중기관의 인중서 서비스는 이동 환경에 적합하지 않으므로, secret-share 기법을 이용하여 분산화 된 환경에서 인중서 서비스를 제공하는 안전한 보안 구조를 제안한다.

• Journal of KIISE:Information Networking
• /
• v.34 no.1
• /
• pp.41-47
• /
• 2007

The Hierarchical Mobile IPv6 (HMIPv6) has been proposed to accommodate frequent mobility of the Mobile Node and to reduce the signaling load. A Mobility Anchor Point is a router located in a network visited by the Mobile Node. The Mobile Node uses the Mobile Anchor Point as a local Home Agent. The absence of any protections between Mobile Node and Mobile Anchor Point may lead to malicious Mobile Nodes impersonating other legitimate ones or impersonating a Mobile Anchor Point. In this paper, we propose a mechanism of the secure Mobile Anther Point discovery in HMIPv6. The performance analysis and the numerical results presented in this paper show that our proposal has superior performance to other methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.2
• /
• pp.637-658
• /
• 2015

The development of multimedia applications has followed the development of high-speed networks. By improving the performance of mobile devices, it is possible to provide high-transfer-speed broadband and seamless mobile multicasting services between indoor and outdoor environments. Multicasting services support efficient group communications. However, mobile multicasting services have two constraints: tunnel convergence and handoff latency. In order to solve these problems, many protocols and handoff methods have been studied. In this paper, we propose inter local mobility anchor (inter-LMA) optimized handoff model for mobile multicasting services in proxy mobility IPv6 based (PMIPv6-based) networks. The proposed model removes the tunnel convergence issue and reduces the router processing costs. Further, it the proposed model allows for the execution of fast handoff operations with adaptive transmission mechanisms. In addition, the proposed scheme exhibits low packet delivery costs and handoff latency in comparison with existing schemes and ensures fast handoff when moving the inter-LMA domain.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.12C
• /
• pp.208-217
• /
• 2001

In mobile Internet environment, providing multicast requires much more complex mechanism comparing with the unicast Mobile IP routing protocol. This is because multicast datagrams are sent to a group address that do not belong to a specific network. The IETF Mobile IP suggested two approaches for mobile multicasting, namely remote subscription and hi-directional tunneling. In remote subscription, a mobile node may join a group via a local multicast router on the visited subnet. Therefore remote subscription may cause much datagram loss while reconstructing the delivery tee. In bi-directional tunneling, a mobile node may join a group via a hi-directional tunnel to its home agent. Bi-directional tunneling may suffer from inefficient routing. In this paper, we proposed a new mobile multicasting protocol, Mobile If Multicast using Local Broadcast(MIMLB) which can receive multicast datagrams as fast as possible and optimize routing path for multicast delivery. The MIMLB protocol uses hi-directional tunneling to receive multicast datagrams. And the MIMLB protocol can resolve datagram duplicated problem and optimize routing path by using local broadcast. Simulation results show that MIMLB reduces delivery path length and optimizes multicast routing path when a mobile nod? moves into a foreign network.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.3
• /
• pp.93-99
• /
• 2009

The Internet Engineering Task Force (lETF)proposed the Mobile IPv6 protocol to provide host mobility in IPv6-based network and to offer a standardized technology. However, Mobile IPv6 (MIPv6) is not applied in actual network because of long handover latency and packet loss problems. Therefore, to compensate these drawbacks, many studies are in progress and FMIPv6 (Fast handover for Mobile IPv6) is one of the studies that has been proposed to supplement the shortcomings of MIPv6. But there are problems occurred in using router tunneling which causes packet loss and out of sequence problems. In this paper, we propose an Advanced Mobile IPv6 (AMIPv6) protocol to minimize the handover latency when Mobile Node frequently moves in each subnet. We compared the performance analysis of AMIPv6 handover latency with MIPv6 handover latency in the same network environment to prove that AMIPv6 is more efficient.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.12 s.354
• /
• pp.89-94
• /
• 2006

In the Mobile IP, the movement of Mobile Host(MH) causes packets to be transmitted through a long route. A Correspond Node(CN) first communicate with a Home Agent(HA) when a Mobile Host moved from one subnet to another subnet. The HH-MIP algorithm reduces an inefficient transmission of packets by regarding a Foreign Agent(FA) near a mobile host as a Temporary Home Agent(THA). However, The algorithm costs the unnecessary signaling by measuring the distance of route between a FA and a THA for handover in the case that a Mobile host comes from a THA which a current FA never communicated. To solve this problem, we propose a scheme called Hierarchical Home Agent Handover in Mobile IP(HHH-MIP) algorithm. Our HHH-MIP algorithm only searches tables in a router by using the hierarchical structure between a FA and a THA. The simulation results show that the HHH-MIP algorithm reduces the additional signaling cost.

• ETRI Journal
• /
• v.35 no.1
• /
• pp.41-50
• /
• 2013

Network Mobility (NEMO) handles mobility of multiple nodes in an aggregate manner as a mobile network. The standard NEMO suffers from a number of limitations, such as inefficient routing and increased handoff latency. Most previous studies attempting to solve such problems have imposed an extra signaling load and/or modified the functionalities of the main entities. In this paper, we propose a more secure and lightweight route optimization (RO) mechanism based on exploiting the firewall in performing the RO services on behalf of the correspondent nodes (CNs). The proposed mechanism provides secure communications by making an authorized decision about the mobile router (MR) home of address, MR care of address, and the complete mobile network prefixes underneath the MR. In addition, it reduces the total signaling required for NEMO handoffs, especially when the number of mobile network nodes and/or CNs is increased. Moreover, our proposed mechanism can be easily deployed without modifying the mobility protocol stack of CNs. A thorough analytical model and network simulator (Ns-2) are used for evaluating the performance of the proposed mechanism compared with NEMO basic support protocol and state-of-the-art RO schemes. Numerical and simulation results demonstrate that our proposed mechanism outperforms other RO schemes in terms of handoff latency and total signaling load on wired and wireless links.

• Proceedings of the Korea Contents Association Conference
• /
• 2003.05a
• /
• pp.383-389
• /
• 2003

In this paper, we propose a solution, called M_DQDMR, for generating delay-constrained boundwidth-appropriated multicast routing trees to reduce the delay and conserved boundwidth resources of nodes in mobile computing environment. At the current router installation, we according the routing table and the information of link which neighboring rude to guarantee QoS(Quality of Service). When we construct multicast tree, M_DQDMR algorithm dynamically adjusts its appropriate tree construction policy based on how far the destination node from the delay bound and boundwidth our QoS requirement. Through simulations and comparing to another multicast algorithm, we reach a conclusion is that M_DQDMR can simply and dynamically adjusts the construction of multicast tree in hight-speed and conserve boundwidth resources.