• Journal of KIISE:Computing Practices and Letters
• /
• v.13 no.1
• /
• pp.1-10
• /
• 2007

An advantage of the mobile ad hoc network (MANET) is that mobile nodes can self-organize the network topology without the help of network infrastructure. However, for the perfect self-organization of the MANET, each mobile node needs to self-configure its address. Even though a mobile node configures a unique address during the booting time, its address may conflict with nodes in other MANETs since MANETs containing the same address can be merged. The address autoconfiguration protocol implemented in this work consists of the strong DAD (Duplicate Address Detection) and the weak DAD. A unique address of a node is assigned by the strong DAD during the booting time and the weak DAD is used to detect address conflict and resolve address conflict during the ad hoc routing. In this work, we have implemented address autoconfiguration in the IPv6-based MANET using AODV as the routing protocol. We describe how the IPv6 address autoconfiguration is implemented and verify our implementation by showing the test scenarios on our testbed.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.9A
• /
• pp.898-904
• /
• 2007

I must receive node discernment address for communication between node that participate to network in MANETs(Mobile Ad-hoc Networks). Address is created by node confidence or different node. I achieve address redundancy check (Duplicate Address Detection) to examine whether this address is available unique address. However, this method happens problem that MANETs' extensity drops. This paper can manage by group unit binding transfer nodes to group in MANETs. I suggest method that apply special quality of cluster that exchange subordinate decrease and mobility government official of control message are easy in address assignment protocol minimize time required in redundancy check and solves extensity problem. Method that propose in this paper shows excellent performance according to node number increase than wave and MANETConf [2] through simulation.

• Journal of Korea Society of Industrial Information Systems
• /
• v.15 no.3
• /
• pp.11-21
• /
• 2010

Increase in the number of sensor nodes in sensor networks and sensor node to automatically assign addresses are needed. The method developed to address existing severe wasting, coordinators have all address information, each sensor node when addressing the shortcomings are a lot of traffic. In this paper, 6LoWPAN automatically from the sensor nodes capable of efficiently addressing Hop-Count based hierarchical address allocation algorithm is proposed. How to propose a hop-count of divided areas are separated, with no overlap and can be assigned a unique address, DAD(Duplicate Address Detection) reduced area. Perform DAD to reduce traffic, packet transmission in the IP header destination address, respectively, with a minimum 32-bit compression and packet transmission over a non-compression method to reduce the number of 11.1%.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.79-82
• /
• 2007

Recently the diffusion of the advancement of mobile communication technique and mobile terminal increased, The users were demanded seamless services when carrying and moving. It proposed the FMIPv6 (Fast Handoff for Mobile IPv6) from the IETF like this meeting this requirement. The handover procedure of the FMIPv6 causes to defecate with movement detection, new CoA configuration and binding update. But, the delay occurs from each process, when the DAD(Duplicate Address Detection) of the CoA executing, the big delay occurs. This paper proposes a scheme of delay reduction, it omits DAD process and stores in the AR(Access Router) relates in the CoA of the mobile terminal information.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.11
• /
• pp.2027-2031
• /
• 2007

Recently the diffusion of the advancement of mobile communication technique and mobile terminal increased, The users were demanded seamless services when carrying and moving. It proposed the FMIPv6(Fast Handoff for Mobile IPv6) from the IETF like this meeting this requirement. The handover procedure of the FMIPv6 causes to defecate with movement detection, new CoA configuration and binding update. But, the delay occurs from each process, when the DAD(Duplicate Address Detection) of the CoA executing, the big delay occurs. This paper proposes a scheme of delay reduction, it omits DAD process and stores in the AR(Access Router) relates in the CoA of the mobile terminal information.

• 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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.3 no.3
• /
• pp.266-284
• /
• 2009

The challenges of rapidly growing numbers of mobile nodes in IPv6-based networks are being faced by mobile computing researchers worldwide. Recently, IETF has standardized Mobile IPv6 and Fast Handover for Mobile IPv6(FMIPv6) for supporting IPv6 mobility. Even though existing literatures have asserted that FMIPv6 generally improves MIPv6 in terms of handover speed, they did not carefully consider the details of the whole handover procedures. Therefore, in conventional protocols, the handover process reveals numerous problems manifested by a time-consuming network layer based movement detection and latency in configuring a new care of address with confirmation. In this article, we study the impact of the address configuration and confirmation procedure on the IP handover latency. To mitigate such effects, we propose a new scheme which can reduce the latency taken by the movement detection, address configuration and confirmation from the whole handover latency. Furthermore, a mathematical analysis is provided to show the benefits of our scheme. In the analysis, various parameters are used to compare our scheme with the current procedures, while our approach is focused on the reduction of handover latency. Finally, we demonstrate total handover scenarios for the proposed techniques and discussed the major factors which contribute to the handover latency.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.17 no.1
• /
• pp.115-119
• /
• 2007

The IPv6 protocol provides the method to automatically generate an address of a node without additional operations of administrators, Before the generated address is used, the duplicate address detection (DAD) mechanism is required in order to verify the address. However, during the process of verification of the address, it is possible for a malicious node to send a message with the address which is identical with the generated address, so the address can be considered as previously used one; although the node properly generates an address, the address cannot be used. In this paper, we present a strong scheme to perform the DAD mechanism based on hash functions in IPv6 networks. Using this scheme, many nodes, which frequently join or separate from wireless networks in public domains like airports, terminals, and conference rooms, can effectively generate and verify an address more than the secure neighbor discovery (SEND) mechanism.

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

All IP,NGN(Next Generation Network)으로 대변되는 차세대 네트워크의 특징 중 하나는 이동성이며 노드의 이동뿐만 아니라 네트워크 전체가 이동하는 모바일 네트워크로 진화하고 있다. 차세대 네트워크의 하위 구조를 이루게 될 MANET에 IPv6를 적용하기 위해, 보다 확장성 있고, 유연하며. 빠르고 가벼운 IPv6의 자동 주소 지정 및 중복 주소 탐지에 관해 논의한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.5B
• /
• pp.257-269
• /
• 2007

This paper proposes a novel method to perform a quantitative analysis of message complexity and applies this method in comparing the message complexity among the mobile ad hoc network (MANET) address autoconfiguration protocols (AAPs). To obtain the upper bound of the message complexity of the protocols, the O-notation of a MANET group of N nodes has been applied. The message complexity of the single node joining case in Strong DAD, Weak DAD with proactive routing protocols (WDP), Weak DAD with on-demand routing protocols (WDO), and MANETconf has been derived as n(mO(N)+O(t)), n(O(N)+O(t)), n(O(N)+2O(t)), and nO((t+1)N)+O(N)+O(2) respectively. In order to verify the bounds, analytical simulations that quantify the message complexity of the address autoconfiguration process based on the different coflict probabilities are conducted.