• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.7 s.349
• /
• pp.150-155
• /
• 2006

A hybrid Ad-hoc network connected to the Internet needs an IP address configuration to communicate with the Internet. Most of proposed address autoconfiguration algorithms are node based. The node based address autoconfiguration algorithms waste bandwidth and consume much battery in mobile ad-hoc networks. In this paper, we propose the address allocation algorithm in hybrid Mobile ad-hoc network (MANET). The proposed algorithm reduces network traffic by transferring address configuration packet to the internet gateway by unicast method. Moreover, our IP address configuration algorithm also reduces battery consumption and address configuration time by decreasing number of configuration packets on internet gateway.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.12
• /
• pp.71-76
• /
• 2005

The 070-VOIP service were began to support system of E.164 and an IP address service. The address system was proposed how an convergence of E.164 address system was worked with an EPC and an IP address to the multimedia convergence service within the integration of wireless and wireline. In future, it was presented the way that the end user could use an integrated address system to be based on E.164 in BcN networks. An expansibility will be easy to all things are put into in knowledge that u- address system use an integrated address system to the basis of E.164 system.

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

• Proceedings of the IEEK Conference
• /
• 2004.08c
• /
• pp.544-548
• /
• 2004

DHCP(Dynamic Host Configuration Protocol) is a protocol which dynamically allocates an IP address and/or host configuration parameters to a host. The DHCP client's address can be changed dynamically any time. For the possible communication with other system, the DHCP client has to inform its address to the DNS system with dynamic update facility. But the DNS dynamic update has a problem related to the security. So we proposed the efficient mechanism for the secure integration of DHCP and DNS by using DNS security extensions. The system also uses the DNS server as the certificate repository for the storing & retrieval of each other's certificate.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.8
• /
• pp.1510-1518
• /
• 2006

As a promising technology that enables ubiquitous computing and leads IT(information Technology) industries of next generation, the exciting new field of sensor networks is attracting so much attention and considered to be the one of the hottest research topics these days. From now on, all the each node, forming a network, and even the sensor network itself will interact with the generic network and evolve dynamically according to the change of environment with the perpetual creation and extinction. In this paper, we purpose the dynamic address interworking scheme for interactive networking between sensor network and Internet(IPv6). Proposed scheme is enable to interworking dynamically between sensor network address scheme based on Zigbee and Internet address scheme based on IP. Additionally, we implement the proposed address interworking scheme using Berkeley TinyOS, mica motes, and IP protocol. And, we verify the proposed scheme by the interconnection experimental between wireless sensor networks and Internet based on IPv4/IPv6.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.21 no.2
• /
• pp.212-217
• /
• 2011

In this paper, we developed an intelligent minimized integrated digital public address which can provide context awareness of various events occurring in future intelligent buildings. It is able to recognize both voices and sounds, such as a fire bell and a disaster bell, which signal to escape in emergence situations and it can sense information which is sent from various sensors, for example, the inner temperature, humidity, and environment status in an intelligent building. Also, the intelligent digital integrated public address can broadcast information to individual places, according to context awareness that is from sensing information, by using network with an ID. And we are developing a minimized integrated digital public address system that has facilities such as external input, Mic., CD, MP3 and Radio. Developing an integrated digital public address system with operational MICOM will make it possible to control the facilities of digital devices centrally. The operational MICOM is composed of 3 layers which are a control layer, a processing layer and a user interface layer.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.5B
• /
• pp.285-295
• /
• 2008

Internet routers perform packet forwarding which determines a next hop for each incoming packet using the packet's destination IP address. IP address lookup becomes one of the major challenges because it should be performed in wire-speed for every incoming packet under the circumstance of the advancement in link technologies and the growth of the number of the Internet users. Many binary search algorithms have been proposed for fast IP address lookup. However, tree-based binary search algorithms are usually unbalanced, and they do not provide very good search performance. Even for binary search algorithms providing balanced search, they have drawbacks requiring prefix duplication. In this paper, a new binary search algorithm which provides the balanced binary search and the number of its entries is much less than the number of original prefixes. This is possible because of composing the binary search tree only with disjoint prefixes of the prefix set. Each node has a prefix vector that has the prefix nesting information. The number of memory accesses of the proposed algorithm becomes much less than that of prior binary search algorithms, and hence its performance for IP address lookup is considerably improved.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.9
• /
• pp.37-46
• /
• 2009

The movement of the MR loaded on the train is confined to the bidirectional movement along the rail. Therefore, the AR connected to the MR can use the address information of the neighboring ARs and configure CoA in advance before performing L2 and L3 handoff. The MR can acquire new CoA immediately from the present AR after the movement detection procedure. The performance analysis shows that the proposed scheme can provide CoA to the MR about 1.8(s) at minimum and 4.98(s) at maximum faster than the Stateless scheme because the proposed scheme does not carry out any additional CoA and DAD procedure unlike the Stateless scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.10
• /
• pp.1537-1545
• /
• 1993

In this paper, we design a pattern generator and a fault position detector to implement the proposed fault test algorithms which are Column Weight Sensitive Fault (CWSF) test algorithm and bit line decoder fault test algorithm for performing the Built-In Self Test(BIST) in RAM. A pattern generator consists of an address generator and a data generator. An address generator is divided into a row address generator for effective address and a column address generator for sequential and parallel addresses. A fault position detector is designed to determine whether full occurred or not and to find the position of the fault. We verify the implemented circuits by the simulation.

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