• The Journal of the Korea Contents Association
• /
• v.11 no.1
• /
• pp.65-71
• /
• 2011

In this paper, the RFID / USN-based ad-hoc network structure is presented for efficient operation of a container terminal yard. Communication between fixed or mobile devices in the container terminal yard is accomplished through the ad-hoc node, to collect the status information of a container in real time. Any outside shipper of the container as well as central server allows to share the status information of a container through ad-hoc communication. In addition, to predict the maximum wireless transmission range of nodes by RFID tag position in the yard, LAODV (Location based AODV) routing protocol is proposed. The validity is proved by performance evaluation via computer simulation.

• Proceedings of the KIEE Conference
• /
• 2003.07b
• /
• pp.1338-1340
• /
• 2003

현재의 공장 자동화, 국방, 항공, 철도, 금융 등을 포함하는 실시간 시스템은 여러 개의 컴퓨터가 다수의 장소에서 서로의 데이터 교환을 통한 협동 작업으로 여러 가지 기능 및 업무를 수행한다. 이는 마치 멀티프로세서를 가진 컴퓨터같이 생각할 수 있으며 이와같은 시스템에 있어서 업무 수행의 효율은 각 프로세서의 계산 능력에 비례함과 동시에 각 노드간의 데이터 전송 능력에 비례한다고 할 수 있다. 이와 같은 실시간 시스템이 올바르게 동작하기 위해서는 한정된 시간 내에 일정한 양의 데이터의 전달을 확정적으로 보장해 줄 수 있는 네트워크를 필요로 하는데 이를 실시간 네트워크(Real time network)라고 한다. 현대의 분산제어 시스템에 있어서 확정적인 시간 내의 데이터 전달은 전체 제어 시스템의 응동 특성에 중요한 요인이 된다. 본 논문은 한국형 고속 전철의 시제차(Prototype train)에 적용된 국제 표준 실시간 네트워크인 열차 통신 네트워크(Train Communication Network)에 관련한 내용이다. 실시간 네트워크는 실시간성을 보장하기 위해서 상호 교환될 데이터가 필요에 따라(온라인 상에서) 변경되는 것이 아니라 오프라인 디자인의 결과로 미리 결정되어진다. 즉 통신장치 사이에 전달되는 네트워크 데이터는 미리 설계된 네트워크 테이블을 기초로 정해진 시간에, 정해진 데이터가, 정해진 방식으로 전달되어 진다. 본 논문에서는 실시간 네트워크의 오프라인 설계를 하기 위한 도구로서 개발되어진 네트워크 데이터 테이블 작성 프로그램에 대해서 설명한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.11B
• /
• pp.979-986
• /
• 2006

DSTM is one of the 1Pv6/IPv4 transition mechanisms using IPv4-in-IPv6 tunneling for communication between IPv6 node with dual stack and Ipv4-only node. In DSTM, the DSTM server using the DHCPv6 is vulnerable to DoS attacks which can exhaust the IPv4 address pool. In this paper, an authentication model using a HRAA (Human Recognition Address Allocation) scheme was proposed to protect DHCP server against DoS attacks. The proposed authentication model in DSTM that uses an image file for verification is effective because only human can respond to the challenge for authenticated address allocation. The proposed model can be used anytime and anywhere in a DSTM domain, and is secure against DoS attacks.

• The KIPS Transactions:PartC
• /
• v.13C no.5 s.108
• /
• pp.621-626
• /
• 2006

A mobile ad hoc network (MANET) is an infrastructureless network that supports multi-hop communication. For the MANET nodes wishing to communicate with nodes in the wired Internet, the global Internet connectivity is required and this functionality can be achieved with the help of the Internet gateway. For the support of reliability and flexibility, multiple Internet gateways can be provisioned for a MANET. In this case, load-balancing becomes one of the important issues since the network performance such as the network throughput can be improved if the loads of the gateways are well-balanced. In this paper, we categorize the load-balancing mechanisms and propose a new metric for load-balancing. Simulation results show that our proposed mechanism using the hop distance and the number of routing table entries as a load-balancing metric enhances the overall network throughput.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.1B
• /
• pp.39-49
• /
• 2012

With group mobility, minimizing routing overhead among intra-group nodes can be achieved by making longer the routing update period, which may lead to degradation of inter-group's routing performance and consequently the inter-group packet delivery success ratio will be decreased. To reduce the inter-group routing overhead without lowering the inter-group packet delivery success ratio, a mobility-adaptive routing update(MARU) scheme is proposed in this paper. Main idea of the proposed scheme is group-based mobility prediction and updating routing paths by selecting intermediate common relay groups.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.11
• /
• pp.2665-2670
• /
• 2015

VANET is ad-hoc network in which vehicles are treated as node and these nodes are communicating with each other as well as RSUs on the road. In VANET, scheduling is a very important issue as the request data are to be delivered to the recipient vehicle properly and accurately. It is also critical that any request data which is sent to the vehicle is received by it in the time period for which the vehicle will be in range of RSU. RSU picks the one with the highest priority to serve based on the scheduling scheme. In this paper, we propose a scheduling algorithm to select the one with the highest priority in RSU, in which an RSU can transfer the overload requests to other RSUs. We use the modified DBP scheme to calculate the priority of request data. Simulation results show that our scheme outperforms other scheduling schemes under various conditions.

• Journal of KIISE:Databases
• /
• v.33 no.6
• /
• pp.620-630
• /
• 2006

Event-detection is an important application of sensor networks. Join operations can facilitate event-detection with a condition table predefined by a user. When join operations are used for event-detection, it is desirable, if possible, to do in-network join processing to reduce communication costs. In this paper, we propose an energy-efficient in-network join algorithm, called PBA. In PBA, each partition of a condition table is stored along the path from each node to the base station, and then in-network joins are performed on the path. Since each node can identify the parts to store in its storage by its level, PBA reduces the cost of disseminating a condition table considerably Moreover, while the existing method does not work well when the ratio of the size of the condition table to the density of the network is a little bit large, our proposed method PBA does not have such a restriction and works efficiently in most cases. The results of experiments show that PBA is efficient usually and especially provides significant cost reduction over existing one when a condition table is relatively large in comparison with the density of the network, or the routing tree of the network is high.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.2 no.4
• /
• pp.215-221
• /
• 2007

IPv6 is a protocol to solve the address space limitation of IPv4 by IETF. Many transition mechanism to communicate between IPv4 and IPv6 in mixed IPv4/IPv6 network are proposed. DSTM tunneling is a mechanism that dual stack in IPv6 network is able to communicate with node in IPv4 network by dynamic allocating the IPv4 address. This mechanism supports the execution of IPv4 dependent application without modification at IPv6 network. In this paper, we explain the security vulnerability at DSTM network for DHCP attack, TEP attack, and source spoofing attack then describe the result of attacks.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.9
• /
• pp.1679-1686
• /
• 2007

Clustering is a topology control approach often used in wireless ad hoc networks to improve scalability and prolong network lifetime. Furthermore, it is also employed to provide semi-management functionalities and capacity enhancement. The usage of clustering topology control technique can also be applied to multi-radio wireless mesh network. This would utilize the advantages of the multi-radio implementation in the network. The aggregation would result to a more stable, connected, scalable and energy-efficient network. On this paper, we design a clustering algorithm for multi-radio wireless mesh network that would use these advantages and would take into consideration both mobility and heterogeneity of the network entities. We also show that the algorithm terminates at a definite time t and the message control overhead complexity is of constant order of O(1) per node.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.2
• /
• pp.103-112
• /
• 2010

In sensor networks, because sensors are deployed in an unprotected environment, they are prone to be targets of compromise attack, If the number of compromised nodes increases considerably, the key management in the network is paralyzed. In particular, compromise of Cluster Heads (CHs) in clustered sensor networks is much more threatening than that of normalsensors. Recently, rekeying schemes which update the exposed keys using the keys unknown to the compromised nodes are emerging. However, they cause some security and efficiency problems such as single group key employment in a cluster, passive eviction of compromised nodes, and excessive communication and computation overhead. In this paper, we present a proactive rekeying scheme using renewals of duster organization for clustered sensor networks. In the proposed scheme, each sensor establishes individual keys with neighbors at network boot-up time, and these keys are employed for later transmissions between sensors and their CH. By the periodic cluster reorganization, the compromised nodes are expelled from network and the individual keys employed in a cluster are changed continuously. Besides, newly elected CHs securely agree a key with sink by informing their members to sink, without exchangingany keying materials. The simulation results shows that the proposed scheme remarkably improves the confidentiality and integrity of data in spite of the increase of compromised nodes. Also, they show that the proposed scheme exploits the precious energy resource more efficiently than SHELL.