• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06d
• /
• pp.449-454
• /
• 2008

최근의 개인 휴대 장치들의 급속한 발전에 힘입어 pervasive computing 환경은 인프라 시스템의 제약에서 벗어나 개인 장치들의 협력에 의해서 상황에 맞는 서비스를 제공 받을 수 있도록 변하고 있다. 하지만 이러한 ad hoc pervasive 환경은 기존의 스마트 스페이스에서 보다 동적인 변화가 더욱 많은 환경이기 때문에 pervasive computing을 위한 기능들 중에서도 자원 관리가 가장 중요한 역할을 해야 한다. Pervasive computing 환경에서 자원 관리는 자원 모니터링(Resource Monitoring), 자원 발견(Resource Discovery), 자원 할당(Resource Allocation), 자원 적응(Resource Adaptation)의 4가지의 주요 기능으로 구분 될 수 있고, 동적인 변화가 많은 환경에서는 무엇보다도 자원 모니터링이 가장 중요시 되어야 한다. 자원 모니터링에서 정보의 수집은 pull이나 push 방식으로 이루어질 수 있는데, pull 방식은 사용자 요구에 맞춰 요구 했을 때의 가장 최신의 정보를 모아 줄 수 있다. 따라서 이는 자원 발견에 가장 적합하지만 언제 정보 수집을 요청할지는 정보 소비자의 입장에서는 알 수 없기 때문에 push 방식이 다른 여러 기능들을 지원하기 위해서 보다 적절하다. 하지만 대부분의 push 방식은 주기적으로 자신의 정보를 광고하는 방식으로 이루어 진다. 하지만 상황 적응(adaptation)입장에서 봤을 때 특정 수준의 민첩성을 요구하기 위해서는 광고주기를 조절 해야 하고, 이때 필요 이상으로 네트워크의 사용량을 늘릴 수 있다. 뿐만 아니라 변화가 많은지 적은지 등의 각 단말의 상황은 무시된 채 모든 단말들이 동일한 주기로 정보를 광고한다. 이러한 문제점을 해결 하기 위해서 본 논문은 자원 정보 제공자의 상황을 고려한 자원 정보 광고 기법을 제안한다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.4
• /
• pp.239-243
• /
• 2011

In wireless ad-hoc network, the detection of link breakage and re-establishing the route path causes lots of network overhead and results in communication delay. In the LBN method, the node causing a link breakage actively sends a message to neighbors so that they can instantly start re-establishing process of new path. In this paper we describe the result of network simulation we performed using NS2 to show the effectiveness of LBN method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38C no.11
• /
• pp.1060-1073
• /
• 2013

In this paper, we present a cluster-based routing scheme for efficiently delivering data to group mobile users by extracting and clustering mobile user group simply from beacon message information in wireless ad-hoc networks. First, we propose an online-clustering mechanism that uses a local neighbor table on each node by recursively transmitting to neighbor nodes, and forms a group table where a set of listed nodes are classified as group members, without incurring much overhead. A node that appears the most frequently from neighbor tables throughout the network is selected as the cluster-head node, serving as a data gateway for the intra-cluster. Second, we design an inter-cluster routing that delivers data from stationary data sources to the selected cluster-head node, and a intra-cluster routing to deliver from the cluster-head node to users. Simulation results based on ns-2 in the ad-hoc networks consisting of 518 stationary nodes and 20 mobile nodes show that our proposed clustering mechanism achieves high clustering accuracy of 96 % on average. Regarding routing performance, our cluster-based routing scheme outperforms a naive one-to-one routing scheme without any clustering by reducing routing cost up to 1/20. Also, our intra-cluster routing utilizing a selected cluster-head node reduces routing cost in half as opposed to a counterpart of the intra-cluster routing through a randomly-selected internal group member.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.10
• /
• pp.2309-2315
• /
• 2013

VANET(Vehicular Ad-hoc Network) is getting attention as an application to improve driver safety through inter-vehicle communication. For activation of VANET, privacy-preserving mutual authentication has to be guaranteed. In previous works, authors proposed various group-based authentication protocols. However, risks on ID exposure due to repeated use of group key and RSU(Road Side Unit) DoS attack were not considered. In this paper, we propose a probabilistic approach for robust anonymous authentication protocol. We evaluated our proposed method in a sets of criteria in VANET and verified it is an efficient solution for enhancing privacy.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.10
• /
• pp.2237-2246
• /
• 2010

In this paper, the performance of a RCO-MAC protocol is evaluated using a different traffic model. Data frames are assumed to generate based on an exponential distribution from one source node and then directly to be stored into the input buffer in the source node. System throughput, average access delay and average system delay are used as a performance measure. Performance evaluation is carried out by the computer simulation. Numerical results show that the RCO-MAC scheme offers 18% higher system throughput than the rDCF scheme. In addition, the numerical results show that the RCO-MAC protocol also offers the better average system delay under any traffic load than that by the rDCF scheme, which was not obtained in the previous research due to the saturated traffic model.

• The KIPS Transactions:PartC
• /
• v.14C no.2
• /
• pp.191-198
• /
• 2007

A mobile ad-hoc network (MANET) is an autonomous, infrastructure-less system that consists of mobile nodes. In MANET, on demand routing protocols are usually used because network topology changes frequently. AODV, which is a representative on demand routing protocol, operates using the routing table of each node that includes next hop of a route for forwarding packets. It maintains the established route if there is not an expiration of route or any link break. In the paper, we propose a partially adaptive route maintenance scheme (AODV-PA) based on AODV, which provides dynamic route modification of initial route for selecting the effective route using not only next hop but also next-hop of next-hop (i.e. 2-hop next node) acquired through route discovery process. In addition, the proposed scheme additionally manages the routing table for preventing exceptional link breaks by route modification using HELLO messages. We use NS 2 for the computer simulation and validate that the proposed scheme is better than general AODV in terms of packet delivery ratio, latency, routing overhead.

• Journal of Korea Society of Industrial Information Systems
• /
• v.17 no.7
• /
• pp.51-57
• /
• 2012

This paper proposes a group key design based on ECDH(Elliptic Curve Diffie Hellman) which guarantees secure V2V and V2I communication. The group key based on ECDH generates the VGK(Vehicular Group key) which is a group key between vehicles, the GGK(Global Group Key) which is a group key between vehicle groups, and the VRGK(Vehicular and RSU Group key) which is a group key between vehicle and RSUs with ECDH algorithm without an AAA server being used. As the VRGK encrypted with RGK(RSU Group Key) is transferred from the current RSU to the next RSU through a secure channel, a perfect forward secret security is provided. In addition, a Sybil attack is detected by checking whether the vehicular that transferred a message is a member of the group with a group key. And the transmission time of messages and the overhead of a server can be reduced because an unnecessary network traffic doesn't happen by means of the secure communication between groups.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.12B
• /
• pp.1483-1490
• /
• 2009

Orthogonal frequency division multiplexing (OFDM) has been investigated as an enabling technology for future wireless communications such as ad hoc, mesh and sensor networks. However, prior works on bit-loading lack consideration of the constraints on energy and computing facility in sensor networks. In this paper, we suggest an adaptive bit allocation algorithm for a frequency selective fading channel environment which exploits channel state information obtained through a feedback channel. The proposed algorithm significantly reduces computational complexity and satisfies the power budget. Also, its throughput is comparable to the optimum solution. Simulation results support the claim stated.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.10B
• /
• pp.865-875
• /
• 2008

In this paper, we propose a reliable multicast scheme for the tactical wireless ad hoc network where the members share the situation and operation data. Our scheme consists of two phases to guarantee the reliability. During the dissemination phase, we utilizes an epidemic approach similar to gossip-based ad hoc routing. Then the group members interchange the message reception state information periodically so that they are able to recover missing packets from the other members. We evaluate the performance of our scheme through extensive simulations using the network simulator in comparison with other existing reliable multicast schemes in mobile ad hoc network. Our scheme shows higher packet delivery ratio regardless of the mobility and imposes much lower control overhead to the non-group members compared with the existing schemes.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.5
• /
• pp.40-52
• /
• 2010

A mobile ad hoc network is instant and heuristic, and it is also vulnerable and volatile. Since topology and route changes are frequent, no single routing protocol designed for a conventional network performs well. Some protocols suffer from significant performance degradation when the number of nodes increases, or when nodes become highly mobile. In this paper we investigate a way to adaptively select a routing protocol that fits to the real-time network conditions. The first phase of our study is to analyze the performances of two classes of routing protocols under various network scenarios. The second phase consists of constructing a routing protocol selection reference. All nodes continue to monitor the status of neighbor nodes and control packets exchanged. Then, the aggregated information is periodically compared against the protocol selection reference. The selected routing protocol is maintained throughout the network until the network property changes substantially. The performance of the proposed algorithm is verified by a set of computer simulations using the OPNET modeler. The experimental results show that selectively changing routing protocol adaptive to the network conditions greatly improves the efficacy of bandwidth utilization.