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

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.2B
• /
• pp.240-249
• /
• 2004

For the effective IP-based service implementation in the wireless network environment, involvement of IP-related technologies in wireless networks is inevitable and globally unique IPv6 address allocation to the mobile node has become an important issue. In the 3GPP's address allocation mechanism, IPv6 address allocation procedure is performed by the GGSN, which is normally located far from the mobile nodes. This causes IPv6 address allocation time delay and traffics to be longer and increased in the core network, respectively. In this paper, we propose a new IPv6 address allocation mechanism that is performed by Node B located in RAN. The proposed IPv6 address allocation mechanism can provide IPv6 addresses to mobile nodes within a more reduced time than existing 3GPP's IPv6 address allocation mechanism, and co-operates with existing mechanism as an overlay model to improve reliability of wireless networks. And, for implementation of the proposed address allocation mechanism, it needs not to change the structure of current wireless networks except for the some functional addendum of Node B.

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.118-121
• /
• 1999

Multicast addresses cannot be permanently assigned to particular application or group combination, but need to be available for re-use. So, this requires a dynamic multicast address allocation and release mechanism. For a dynamic multicast address allocation and release mechanism, we must consider low blocking probability, low delay, low control traffic overhead. In this paper, we suggest a efficient dynamic multicast address allocation and release mechanism based on the multicast scope

• Journal of information and communication convergence engineering
• /
• v.7 no.2
• /
• pp.141-147
• /
• 2009

To initialize and maintain self-organizing networks such as mobile ad hoc networks, address allocation protocol is essentially required. However, centralized approaches that pervasively used in traditional networks are not recommended in this kind of networks since they cannot handle with mobility efficiently. In addition, previous distributed approaches suffer from inefficiency with control overhead caused by duplicated address detection and management of available address pool. In this paper, we propose a new dynamic address allocation scheme, which is based on adaptive partition. An available address is managed in distributed way by multiple agents and partitioned adaptively according to current network environments. Finally, simulation results reveal that a proposed scheme is superior to previous approach in term of address acquisition delay under diverse simulation scenarios.

• Journal of Korea Multimedia Society
• /
• v.11 no.8
• /
• pp.1072-1081
• /
• 2008

We can categorize the network address allocation mechanism into two types. One is to assign a unique network address using the address allocation server and the other is to make a random address by itself and process the DAD(Duplicate Address Detection) procedure. In this paper we suggest a new address allocation mechanism based on the signal strength for the PLC-based home network. As the combined mechanism of two types this mechanism allocates a unique address for the new node from one of the existing nodes with the simple equation and with the priority based on the signal strength from the new node to the existing nodes. We can use this mechanism for the self-healing function when the packet from the source node may not be delivered to the destination node directly. We developed the simulator for our mechanism using the C# programming and verified the network address assigned uniquely based on the signal strength.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.10
• /
• pp.20-28
• /
• 2007

Zigbee sensor network base on IEEE802.15.4 has local address of 2 byte on transmit packet data which is pick up the address for each sensor node. Sensor network is requested low power, low cost, many nodes at hues physical area. There for Zigbee is very good solution supporting for next Ubiquitous generation but the Zigbee sensor network has address allocation problem of each sensor node. Is established standard from Zigbee Alliance, to the address allocation method uses Cskip algorithm. The Cskip algorithm use the hazard which allocates an address must blow Hop of the maximum modification and child node number. There is to address allocation and from theoretically it will be able to compose a personal 65536 sensor nodes only actual with concept or space, only 500 degree will be able to compose expansion or the low Zigbee network. We proposed an address allocation method using coordinate value for Zigbee sensor network.

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

A Mobile Ad-Hoc Network (MANET) supports a multi-hop wireless network without any prepared base station (BS). The MANET is capable of building a mobile network automatically without any help from DHCP servers for address allocation or routers to forward or route messages. Many routing protocols have been proposed for the MANET, but these specify the most optimized or shortest path from a source to a destination, and they assume that nodes are pre-configured before communication. To make up for this, address allocation algorithms, such as MANETConf [1] and prophet address allocation algorithm [2], have been proposed. Especially, MANETConf proposes address allocation algorithm with duplication address check. In this paper, we present a dynamic node configuration protocol based on 2-tierd hierarchical network architecture for mobile ad-hoc network, modified from [1]. Especially, it reduces the number of broadcast message exchange between nodes when a new node somes into a network, which lessens network overhead, remarkably. This protocol is based on two-tired structure, and it ensures address allocation with simple duplication address defection mechanism.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.1067-1070
• /
• 2005

In this paper, we propose the address allocation algorithm in hybrid Mobile ad-hoc network (MANET). Most of proposed address autoconfiguration algorithms are node based. Node based address autoconfiguration algorithms are inefficient. Because the node based algorithms waste bandwidth and consume much battery in mobile ad-hoc networks. we present the address allocation algorithm using internet gateway based address autoconfiguration by modifing the IPv6 stateless address autoconfiguration protocol. We use the network simulator NS-2 in our experiments. The simulation result shows reducing network traffic and saving battery.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2001.10a
• /
• pp.57-60
• /
• 2001

In this paper, I will describe the trends of multicast address allocation mechanism. IP Multicast efficiently supports this type of transmission by enabling sources to send a single copy of a message to multiple recipients who explicitly want to receive the information. Generally, MAAs server or MADCAP servers are used to allocate multicast addresses. As the need of home networking and autoconfiguring network mechanism has been increased, not only automatic host IP configuration but also automatic multicast address generation mechanism was demanded. in this paper, I will explain the automatic multicast address mechanism in a host. management techniques and the trends of multicast address generation and allocation mechanism that is bong now discussed In IETF.

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