• The KIPS Transactions:PartC
• /
• v.16C no.4
• /
• pp.505-510
• /
• 2009

Sensor networks are composed of a great number of sensor nodes. Since all sensor nodes are energy-restricted and hard to recharge, it is very important.However, the energy consumption may significantly increase if mobile sources or sinks exist in sensor networks. The reason is that the routing information for mobile sources and sinks needs to be update frequently for efficientdata delivery. The routing algorithm supporting mobile sinks should consider not only continuous data delivery but also the energy consumption of sensor nodes. However, most of the existing research focuses on even energy consumption while the mobility of sinks and sources is rarely consider. In this paper, we propose an efficient routing protocol with multiple virtual grids to reduce energy consumption and improve packets delivery efficiency. Then this paper considers the mobility. Simulation results show that our algorithm can guarantee high data delivery ratio and lower average delivery delay, while consuming lower energy than existing routing protocols in sensor networks.

• Journal of KIISE:Information Networking
• /
• v.29 no.3
• /
• pp.314-323
• /
• 2002

The routing protocols designed for wired networks can hardly be used for mobile ad-hoc networks due to limited bandwidth of wireless transmission and unpredictable topological change. Recently, several routing protocols for mobile ad-hoc networks have been Proposed. However, when theme protocols are applied to support real time services like multimedia transmission, they still have problems in ad-hoc networks, where the topology changes drastically. In this paper, we propose a new route selection algorithm which selects the most reliable route that is impervious to route failures by topological changes by mobile hoots. For reliable route selection, the concept of virtual zone (stable zone and caution zone) is proposed. The zone is located in a mobile node'transmission range and determined by mobile node's mobility information received by Global Positioning System (GPS). The proposed algorithm is applied to the route discovery procedure of the existing on-demand routing protocol, AODV, and evaluated by simulation in various traffic conditions and mobility patterns.

• The KIPS Transactions:PartC
• /
• v.10C no.1
• /
• pp.17-26
• /
• 2003

Mobile agent system comes into the spotlight since it contributes largely to mobile computing on distributed network environment. However, this system has a number of significant security Problems. In this Paper, we analyze suity attacks to mobile agent system Presented by NIST[3]. In order to protect this system from them, we suggest a security protocol for mobile agent system by employing R based key distribution and digital multi-signature scheme. To solve these problems described in NIST, securities for mobile agent and agent platform shouid be accomplished. Comparing with other protocols, our protocol performs both of these securities, while other protocols mentioned only one of them. Proposed Protocol satisfies simplicity of key management, providing security service such as confidentiality, integrity, authentication and preventing reputation, liveness guarantee, protection of excution-result data and preventing replay attack. Furthermore, it is designed to detect message modification immediately by verifying each step of agent execution at a corresponding server.

• The KIPS Transactions:PartA
• /
• v.13A no.5 s.102
• /
• pp.455-464
• /
• 2006

In multi-regional mobile agent computing environments, spatial replication-based approach may be used as a representative mobile agent fault-tolerance technique because it allows agent execution to make progress without blocking even in case of agent failures. However, to apply this approach to real mobile agent-based computing systems, it is essential to minimize the overhead of locating and managing mobile agents replicated on each stage. This paper presents a new mobile agent location management protocol SRLM to solve this problem. The proposed protocol allows only the primary among all the replicated workers of each stage to register with its regional server and then, significantly reduces its location updating and message delivery overheads compared with the previous protocols. Also, the protocol addresses the location management problem incurred by electing the new primary among the remaining workers at a stage in case of the primary worker's failure.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.11
• /
• pp.2533-2540
• /
• 2013

In multihop cellular network environments, the mobility of nodes is a major obstacle to find a reliable routing path between a mobile node (MN) and the access node (AN). Therefore, in this paper, we propose a fast and reliable neighbor discovery protocol that enables the fast and reliable neighbor discovery by considering the node mobility in the multihop cellular network. The proposed neighbor discovery protocol inhibits the transmission of unnecessary control messages to quickly find a suitable neighbor node (NN) and performs a priority-based access control to transmit control messages without collision in the order of NN desirable to be selected. Simulation results show that the proposed neighbor discovery protocol can discover the NNs faster than the conventional scheme and select a more reliable relay node although the number of neighbor nodes increases and the node mobility increases.

• Information and Communications Magazine
• /
• v.27 no.10
• /
• pp.48-54
• /
• 2010

이동성은 미래 인터넷의 필수 요구 사항 중의 하나이다. 그리고 최근에는 단순한 단말기의 이동이 아닌 인간의 이동성 (Human Mobility) 모델링을 통해 인간 사이의 상호작용, 통신 패턴 등을 분석하고자 하는 연구가 활발히 진행되고 있다. 본 고에서는 미래 인터넷에서 이동성 지원 아키텍처 및 프로토콜 개발을 위해 필수적인 인간 이동성 모델링과 관련된 최신 연구결과들을 비교, 분석하고 인간 모델링과 관련된 새로운 연구 주제를 제시한다.

• Annual Conference of KIPS
• /
• 2001.10b
• /
• pp.1347-1350
• /
• 2001

무선 이동 통신의 발달로 인해, 각 이동 단말 장치에 따른 데이터 동기화 방법이 다양해짐에 따라 공통된 동기화 프로토콜 규격의 필요성이 대두되었다. SyncML 은 이기종 시스템 간의 상호 운용성을 보장하는 데이터 동기화 표준으로서 사용자와 벤더들에게 많은 장점을 제공하는 프로토콜로 인식되고 있다. 본 논문에서는 SyncML 프로토콜에 대한 간략한 설명과 함께 SyncML 을 이용하여 개발된 서버의 프레임웍을 제시하고, 데이터 동기화를 처리해 주는 Sync Agent에 대하여 기술하였다.

• Annual Conference of KIPS
• /
• 2005.11a
• /
• pp.1347-1350
• /
• 2005

거의 모든 종류의 이동기기에서 에너지를 절감하는 것은 중요한 연구주제들중의 하나이다. 본 논문에서는 낮은 전원을 소모하는 슬립 모드로의 전환이 가능한 노드들로 구성된 MANET(mobile ad hoc networks)에서 에너지를 절감하는 새로운 프로토콜을 설계한다. 본 논문에서 고려하고 있는 MANET는 예측할 수 없는 호스트의 이동성, 멀티홉에서의 호스트들 간의 통신 그리고 비동기적인 메커니즘을 사용하는 특징을 가지고 있다. 특히 우리는 노드의 동기화가 에너지 절감 프로토콜의 복잡성에 어떤 영향을 미치는지에 대하여 연구한다. 또한 IEEE 802.11기반 multi-hop ad hoc network에 적용할 수 있고 동기적으로 전원을 관리하는 SPFAI(Synchoronous PFAI), ESPFAI(Efficient SPFAI), NSPFAI(Non-MTIM SPFAI)의 세가지 에너지 절감 프로토콜을 제안한다.

• Annual Conference of KIPS
• /
• 2012.04a
• /
• pp.1024-1026
• /
• 2012

본 논문에서는 UWB 기술 기반 WiMedia Distributed Medium Access Control (D-MAC) 프로토콜에서, 디바이스들의 이동성으로 인해 발생하는 Distributed Reservation Protocol (DRP) 예약 충돌 현상을 분석한다. 그리고 DRP 예약 충돌 시 발생하는 성능 저하를 감소시키기 위해 DRP Conflict Resolution 방식과 DRP 릴레이 통신 기술을 제안한다. 본 논문에서 제안하는 DRP 릴레이 통신 프로토콜은 충돌대상 디바이스에게 예약된 자원을 유지할 수 있도록 Direct Link 뿐만 아니라, DRP 예약 충돌 시 릴레이 노드를 경유하여 또 다른 Indirect Link 링크를 빠르게 예약할 수 있는 분산적인 자원 예약 프로토콜을 제안한다.

• Journal of KIISE:Information Networking
• /
• v.37 no.2
• /
• pp.122-134
• /
• 2010

With the rapidly increasing demand of traffic applications, the need to support seamless and robust multimedia services in the Vehicular Ad hoc Network is growing. Fast handover for the MIPv6 (FMIPv6) developed to solve the MIPv6's problem as well as Mobile IPv6 (MIPv6) for basic mobility protocol have been developed to support seamless handover in mobile environment. However, MIPv6 and FMIPv6 are useless for Quality-of-Service (QoS) services such as multimedia applications due to the long handover latency and the packet loss problem. In this paper, we propose a seamless and robust handover scheme that supports multimedia services in Vehicular Ad hoc Network using oCoA and background DAD. Through performance evaluation, we show that the proposed scheme is more proper for Vehicular Ad hoc Network than other schemes.