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

• Spatial Information Research
• /
• v.14 no.4 s.39
• /
• pp.403-419
• /
• 2006

The well-blown address matching technology developed by the U.S. Census Bureau was applicable only for street addresses. However, many other addressing systems on the basis of a hierarchy of areas (hierarchical areal addressing system), such as Korean or Japanese addressing system, cannot be suitable for the existing address matching method. This paper, therefore, develops an areal address matching method, especially for Korean addressing system, in order to geocode 2D and 3D locational data of human activities. Thus, this study explains a new approach to dealing with 3D positioning method composed of two geocoding methods, which are a '2D Korean Address Matching' technique and a '3D Address Matching' technique.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.4B
• /
• pp.403-418
• /
• 2009

IP version 6 (IPv6) is a new If addressing scheme that has 128-bit address space. IPv6 is proposed to solve the address space problem of IP version 4 (IPv4) which has 32-bit address space. For a given IPv6 routing set, if a forwarding table is built using a trio structure, the trio has a lot more levels than that for IPv4. Hence, for IPv6 address lookup, the binary search on trio levels would be more appropriate and give better search performance than linear search on trio levels. This paper proposes a new IPv6 address lookup algorithm performing binary search on trio levels. The proposed algorithm uses a Bloom filter in pre-filtering levels which do not have matching nodes, and hence it reduces the number of off-chip memory accesses. Simulation has been performed using actual IPv6 routing sets, and the result shows that an IPv6 address lookup can be performed with 1-3 memory accesses in average for a routing data set with 1096 prefixes.

• Journal of Korean Society for Geospatial Information Science
• /
• v.20 no.3
• /
• pp.101-108
• /
• 2012

The construction of data connection is required due to the digital map do not have the new address data which is implemented by the Korea government and it cannot use between government and other agency. The manually matching of digital map and new address data is time and money consuming process due to the huge amount of data. In this research, new system is developed for data generation of attribute data by the data connection method of digital map and new address data using spatial matching and matching rate of data connection is analyses. The results of data matching rate in the research area are 84% in building case and 67% in road case in 1:1000 digital map at Suwon and 18% in building case and 21% in road at Seogwipo.

• The KIPS Transactions:PartC
• /
• v.16C no.6
• /
• pp.753-760
• /
• 2009

As it becomes increasingly important that Internet access is available anywhere at any time, providing MANET (Mobile Ad-Hoc Network) with the Internet access attracts more attention. The existing DHCP (Dynamic Host Configuration Protocol) address configuration schemes require message exchanges between MANET nodes and the DHCP server through multi-hop routes. Messages can be easily dropped in the wireless multi-hop communication environment and the address configuration may be instable and need long delay. In this paper, we propose a new address configuration scheme using the concept of address pool allocation. In the proposed scheme, the DHCP server assigns a part of its address pool to a node instead of a single address and the node can assign a part of its own address pool to its neighbor nodes. Through simulation studies, we show that our scheme yields about 77% of the address configuration delay and 61% of the control message overhead of the existing DHCP based mechanism.

• Journal of Internet Computing and Services
• /
• v.17 no.4
• /
• pp.27-34
• /
• 2016

The referents of internet addresses are no longer limited to web sites. A new address service by the international organization for the internet address (ICANN) introduces an open space for the TLD (Top Level Domain) strings so that each service, content, product, and other linguistic expressions may be allowed. The open TLD addresses are more suitable for representing the address of service units, contents, or products. In this paper, as an alternative to static Internet address service to return a consistent mapping result regardless of a user-specific different requirements, we design a dynamic internet address mapping model that returns mapping result to suit user particular requirements. In addition, we propose a method for implementing a internet address service without any changes in the existing domain protocols. It may implement a dynamic internet address by attaching to a encoded user's metadata and environment data within a internet address representation, and adding the module for dynamic mapping to the name servers. Through this proposal, trying to expand the functions of internet address, it is expected to be able to provide customized informaiton retrieval services for each user by using just internet address.

• Proceedings of the IEEK Conference
• /
• 2004.08c
• /
• pp.571-575
• /
• 2004

Having age of ubiquitous ahead, existing IPv4's address space insufficiency phenomenon appears because of increasing network usage as well as multimedia data transmission becomes much, necessity of new IP address system that guarantee QoS are needed. IPv6 was made to solve these problem. IPv6 solves address space insufficiency phenomenon offering by 128bit address space, and also offers hierarchical address layer that support improved QoS. IPv6 defines relation between surrounding node using Neighbor Discovery protocol. Used Neighbor Discovery messages, grasp surrounding node, include important informations about network. These network information outcrops can give rise in network attack and also service that use network will paralysis. Various kinds of security limitation was found in Present Neighbor Discovery protocol therefore security function to supplement tris problem was required. In this thesis, Secure Neighbor Discovery protocol that add with security function was design and embody by CGA module and SEND module.

• Journal of the Korean Institute of Electrical and Electronic Material Engineers
• /
• v.18 no.2
• /
• pp.180-186
• /
• 2005

As a driving method of AC-PDP, Address-Display Separated(ADS) driving has been widely adopted for its simple architecture and low discharge failure rate. However, a high definition like a HDTV has defect of long addressing time by reason of a number of pixels. Priming effect isn't fully sustained because of long addressing time during the address period. Therefore, it has different wall charge and luminance of each addressing time in the sustain period. In this study, we suggest a new driving waveform on the address period to improve these defects. We applied a ramp waveform, instead of a square waveform, to an address period in ADS, for operating on the AC-PDP, which used the conventional gas [He-Ne-Xe]. When the ramp waveform is applied to the address period, we experimented for uniform wall charge and the improved luminance by sustained Priming effect at each addressing time in the sustain period.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.11
• /
• pp.2004-2009
• /
• 2007

A new high-speed drive method for the plasma display panel is proposed. In this method, the address period is inserted for the rest period of the sustain pulses and the priming pulse is applied on the entire panel at the same time overlapping with the sustain period. The ramp shaped priming pulse can be made with a simple drive circuit in this technology and the stable sustain discharge can be induced even by a narrow scan pulse in help of the space charge generated from the address discharge. From the experiments, it is ascertained that the priming pulse hardly influences the sustain discharge. Moreover, the voltage margin of the sustain discharge is almost constant though that of the address discharge broadens with narrowing the scan pulse width. And, if the time interval between the scan pulse and the sustain pulse is within $6{\mu}s$, the voltage margin of the address and the sustain discharges are unaffected though the applied position of the scan pulse is changed. High-speed driving with the address pulse of $0.7{\mu}s$ width was achieved and the address voltage margin of 20V and the sustain voltage margin of 10V were obtained.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.799-802
• /
• 1998

As we know, gigabit ethernet is a new technology to be substituted for current fast ethernet used widely in local area network. The switch used in gigabit ethernet should deal with frames in giga-bps. To do such a fast switching, we need that serveral processes meet the budgets, such as MAC address table lookup, several giga speed path setup, fast scheduling, and etc. Especially MAC address table lookup has to be processed in the same speed with speed of incoming packets, thus the bottleneck in the process can cause packet loss by the overflow in the input buffer. We devise new practical hardware hashing method to perform fast table lookup by minimizing the number of external memory access and accelerating with hardware.