• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.3A
• /
• pp.297-309
• /
• 2007

We introduce two distributed IP address auto-configuration mechanisms for mobile ad hoc networks. RADA (Random ADdress Allocation) is based on random IP address selection, while LiA (Linear Address Allocation) assigns new addresses sequentially, using the current maximum IP address. An improved version of LiA, hewn as LiACR (Linear Address Allocation with Collision Resolution) further reduces the control overhead. Simulation results show that, when many nodes join a network during a short period, RADA assigns addresses more quickly than LiA and LiACR. However, RADA uses the address space less efficiently, due to its random allocation of IP addresses. Hence, RADA is particularly useful in battlefield scenarios or rescue operations where fast setup is needed, while LiA and LiACR are more suitable for ad hoc networks that are moderate, confined and subject to some form of governance control, such as that orchestrated by a wireless service provider.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.10a
• /
• pp.1051-1054
• /
• 2013

Because of the limitations of traditional IPv4 address, the adoption of IPv6 has been accelerated. In IPv6 system, each host can obtain the IP address automatically using auto-configuration functionality, which is one of the features of IPv6. However, the auto-configuration functionality can allow a malicious user to get its IPv6 address and access the network without permission, the IP address management functionality becomes more important than IPv4. In this paper, we propose an IPv6 address management system based on IP agents, which protects the unauthorised users from accessing the network and redirects the web access of those users to a specific web page to induce them to access the network after installing the IP agents.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.1545-1549
• /
• 2005

According as computer is supplied in a lot of homes and offices and Internet use increases, various service based on the Internet. Including wireless PDA in the future, many devices such as Internet telephone, TV, refrigerator and oven will be connected on the Internet and Internet address exhaustion will be raised to serious problem gradually. Today, the IPv4 address exhaustion problem has been solved partially using NAT (Network Address Translation) however, the transition to next Generation Internet will be accelerated because of advantages such as mobility, security service, QoS, and abundant IP addresses. In IPv6, all hosts are designed to create and set their address automatically without manager's intervention using Neighbor Discovery Protocol. But, when an IPv6 host sets its address automatically, there are serious security vulnerabilities. In this paper, we analysis security vulnerabilities in auto-configuration and provide security requirements for secure auto-configuration.

• ETRI Journal
• /
• v.38 no.5
• /
• pp.922-933
• /
• 2016

IP header compression schemes offer a valuable measure for bandwidth preservation. Such schemes have been practically implemented in infrastructure-based IP networks for point-to-point links. However, minimal research and practical implementation efforts have been conducted in the direction of an IP header compression strategy that can meet the peculiar requirements of multi-hop ad hoc wireless networks. In this paper, we present a practically implemented multi-hop IP header compression scheme using the Robust Header Compression (ROHC) protocol suite. The scheme runs on a novel identifier (ID) based networking architecture, known as an ID-based ad hoc network (IDHOCNET). IDHOCNET additionally solves a number of bottlenecks of pure IP-based ad hoc networks that have emerged owing to IP address auto-configuration service, distributed naming and name resolution, and the role of an IP address as an identifier at the application layer. The proposed scheme was tested on a multi-hop test bed. The results show that the implemented scheme has better gain and requires only O (1) ROHC contexts.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.16 no.2
• /
• pp.95-103
• /
• 2006

IPv6 is a new version of the Internet protocol, designed as the successor to IPv4. Among the changes from IPv4 to IPv6, we focused on the stateless address auto-configuration mechanism. The address auto-configuration mechanism is used by nodes in an IPv6 network to learn the local topology. The current specifications suggest that IPsec AH may be used to secure the mechanism, but there is no security association during address auto-configuration process because it has no initial IP address. As there are so many suity threats, SEND protocol was designed to counter these threats. In this paper we analyzed the security problems in NDP and SEND protocol. So we proposed the Modified NDP mechanism using PKC and AC in order to solve these problems.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.05a
• /
• pp.489-491
• /
• 2009

Recently, a range of diverse networks are undergoing speedy evolution and inspiring variety applications. Among many networks, mobile Ad-Hoc networks (MANETs) are active working with a part of routing protocols. But, the majority of routing protocols have required a unique identifier, such as an IP address. At this while, IP address assignment scheme in MANET remains unsolved. When a centralized agent server is not exist, IP address is an critical issue such as a single MANET. This paper look over previous work about basic principles, also we suggest simple solution to overcome the power of two ($2^m$).

• Proceedings of the IEEK Conference
• /
• 2000.11a
• /
• pp.481-484
• /
• 2000

In this paper, we describe the design and implementation of IPv6 LAN. The legacy protocol for Internet is IPv4(IP version 4). The ability of IPv4 is not enough for modern real time multimedia communication services. So IPv6(IP version 6) protocol was suggested to resolve the problems of IPv4. We implemented IPv6 LAN using sTLA(sub Top Level Aggregation identifier) address and KOREN(KOrea Research and Experimental Network). Our IPv6 LAN is connected with 6TAP(Chicago), WIDE(Tokyo), and SingAREN(Singapore). We used a dedicated router, Windows 2000 PC host FreeBSD PC host, Solaris 7 workstation and Solaris 8 workstation for IPv6 NDP(Neighbor Discovery Protocol) protocol test. To support all data services including voice and video, IP protocol should be enhanced because the characteristics of modern network services are requiring QoS(Quality of Service) functions, auto-configuration, security, mobility and so on. So a new IP protocol, IPv6, has been developing to meet the requirements. In this paper, we introduce the implementation method and configuration information of IPv6 LAN.

• Journal of Korea Multimedia Society
• /
• v.12 no.8
• /
• pp.1099-1108
• /
• 2009

The study of IP address allocation in MANET can be categories into Stateful and Stateless. The one, special node monitors other nodes' IP address and allocates IF address. And the other, node generates IP address by itself. Nodes in MANET have mobility and restricted resource, so Stateless is more suitable than Stateful. But, in Stateless, node requires DAD process because of unique IP address allocation. And Dos attack can be happened in DAD precess. In this paper, we propose a security method on preventing DoS attack against DAD in MANET using one-way hash function. Since, Computation of one-way hash function is suitable for nodes' restricted resource character in MANET. And we evaluate performance using NS2 and compare with other security method which is CGA using signature.

• Journal of KIISE:Information Networking
• /
• v.36 no.5
• /
• pp.405-412
• /
• 2009

Mobile ad hoc networks (MANETs) allow mobile nodes to communicate among themselves via wireless multiple hops without the help of the wired infrastructure. In the MANET, it is required not only a route setup mechanism that makes nodes not within each other's transmission range communicate but also mechanism in order for a node to auto-configure a unique address. In this paper, we propose an address auto-configuration mechanism when MANET is connected to the Internet via several Internet Gateways and all gateways advertise the same network prefix. By using the proposed mechanism, once a node configures an Internet topologically correct and globally unique IP address, then the node can utilize the configured address even though the node moves within the MANET. Through the simulations, we analyze the performance of our proposed mechanism and, from the simulation results, we show that out proposed mechanism outperforms the existing mechanism.

• Journal of Communications and Networks
• /
• v.11 no.3
• /
• pp.248-260
• /
• 2009

To connect a mobile ad hoc network (MANET) with an IP network and to carryout communication, ad hoc network node needs to be configured with unique IP adress. Dynamic host configuration protocol (DHCP) server autoconfigure nodes in wired networks. However, this cannot be applied to ad hoc network without introducing some changes in auto configuration mechanism, due to intrinsic properties (i.e., multi-hop, dynamic, and distributed nature) of the network. In this paper, we propose a scalable autoconfiguration scheme for MANETs with hierarchical topology consisting of leader and member nodes, by considering the global Internet connectivity with minimum overhead. In our proposed scheme, a joining node selects one of the pre-configured nodes for its duplicate address detection (DAD) operation. We reduce overhead and make our scheme scalable by eliminating the broadcast of DAD messages in the network. We also propose the group leader election algorithm, which takes into account the resources, density, and position information of a node to select a new leader. Our simulation results show that our proposed scheme is effective to reduce the overhead and is scalable. Also, it is shown that the proposed scheme provides an efficient method to heal the network after partitioning and merging by enhancing the role of bordering nodes in the group.