• KIPS Transactions on Computer and Communication Systems
• /
• v.5 no.3
• /
• pp.47-54
• /
• 2016

In this paper, we propose a new opportunistic routing scheme based on timed bargaining game. The proposed algorithm effectively formulates the opportunistic routing mechanism as an repeated bargaining model using timed learning method. Additionally, we formulate a new contention window adjusting scheme for reduce collision rate. Simulation results indicate that the proposed scheme has excellent performance than other existing schemes under widely diverse VANET environments.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.05a
• /
• pp.87-90
• /
• 2009

Wireless Mesh Network(WMN) is wireless backbone networks technique which has ease of network configuration and cost of advantage. Recently, WNM released a new product, but most of existing research and technology analysis the performance through the simulation. This paper build the wireless mesh network testbed for actual situation. Testbed supports multi-channel multi-interface using bridge, the Wireless Distribution System and dynamic location-based routing protocol. This routing protocol strongly design against wireless interference using metric for link channel change and real distance. Then, the address of mesh clients assigned by the centralized address management server. Mesh clients is designed and implemented to manage network through Simple Network Management Protocol.

• Journal of KIISE:Databases
• /
• v.33 no.3
• /
• pp.327-341
• /
• 2006

As we are getting to deal with more applications that generate streaming data such as sensor network, monitoring, and SDI (selective dissemination of information), active research is being conducted to support efficient processing of queries over streaming data. The applications on the Web environment like SDI, among others, require query processing over streaming XML data, and its investigation is very important because XML has been established as the standard for data exchange on the Web. One of the major problems with the previous systems that support query processing over streaming XML data is that they cannot deal adaptively with dynamically changing stream because they rely on static query plans. On the other hand, the stream query processing systems based on relational data model have achieved adaptiveness in query processing due to query operator routing. In this paper, we propose a system of adaptive query processing over streaming XML data in which the model of adaptive query processing over streaming relational data is applied. We compare our system with YFiiter, one of the representative systems that provide XML stream query processing capability, to show efficiency of our system.

• Journal of the Institute of Convergence Signal Processing
• /
• v.8 no.4
• /
• pp.279-284
• /
• 2007

There ate various studies being conducted regarding efficient routing schemes to reduce energy consumption in the wireless sensor network, for which energy transformation is difficult. In terms of routing, many believe that the dynamic clustering technique is most efficient. The dynamic clustering technique consists of cluster construction and data transmission. Energy consumption for data transmission is proportional to $d^2$ and $d^4$ around the crossover area. This paper proposed algorithms for reducing energy consumption by improving efficiency of the cluster construction process that in the dynamic cluster mechanism and minimizing long-distance data transmission outside the crossover area. The proposed algorithms reduced energy consumption by implementing bridge clusters in the crossover area and decreasing the data transmission distance. The benefits of the proposed algorithms were confirmed through simulation experiments.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.8A
• /
• pp.937-941
• /
• 2004

In this paper, we propose a efficient multicast routing algorithm in the wire/wireless integrated environment. Through simulations and comparing to another multicast algorithm, we reach a conclusion is that the routing algorithm can simply and dynamically adjusts the construction of multicast tree with little delay and the most reducible bandwidth resources.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06d
• /
• pp.94-96
• /
• 2006

센서네트워크에서 라이프타임에 관한 기존 연구는 다음 노드까지 데이터를 전송하는데 필요한 에너지 혹은 데이터의 생성 속도 등 미리 정해진 몇몇 값에 의존하는 경향이 있어 동적인 네트워크의 상황을 제대로 반영하지 못한다. 본 논문에서 제시하는 라우팅 알고리즘은 주기적으로 배터리의 전압값을 읽고 시간당 전압 감소율을 계산하여 각 노드의 작동 가능한 시간을 계산한다. 또 하드웨어에 따른 배터리 소비 특성을 데이터베이스화하여 참고하기 때문에 보다 정확한 라이프타임의 예측이 가능하다. 이렇게 계산된 결과를 바탕으로 라이프타임이 큰 노드만 선택하여 데이터를 전송하기 때문에 전체 네트워크가 동작하는 시간을 연장시킬 수 있다.

• Annual Conference of KIPS
• /
• 2006.05a
• /
• pp.853-856
• /
• 2006

MANET 에서 노드들은 스스로 네트워크를 관리 해야하기 때문에 노드간의 협동과 신뢰관계가 필수적이다. 여기서 보안은 MANET 에서의 중요한 이슈중 하나이고 키인증는 보안에 핵심요소 이다. 하지만 동적인 토폴로지, 자원의 제약, 고정된 인프라의 부재는 MANET 에서의 키인증를 어렵게 하는 요인이 된다. 이러한 MANET 에 PKI 를 적용하기 위하여 클러스터 라우팅 기반의 자율분배 키인증 모델을 제안한다. 이 모델은 공개키 링 테이블에 형성된 노드와는 CA 없이 언제든지 신뢰된 통신을 할 수 있어 다른 노드에 적게 의존함으로 해서 DoS 공격과 같은 특정 노드를 무력화 시키는 공격에 효율적으로 동작한다.

• Journal of Broadcast Engineering
• /
• v.18 no.3
• /
• pp.491-494
• /
• 2013

This paper proposes a stochastic/dynamic routing protocol which aims the minimization of the summation of time average expected power expenditure with buffer stability in mobile ad-hoc 60 GHz wireless networks. By using 60 GHz RF, the wireless devices can transmit/receive 1080p HD video signals without compression. In addition, our algorithm works without centralized controller, so that the distributed operation is available. The novelty of the proposed algorithm was also verified by simulations.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.6
• /
• pp.1083-1088
• /
• 2001

In this paper, we propose a new CBT(core-based tree)multicast routing Mechanism by load balancing mechanism. CBT may result in traffic concentration and bottlenecks near the core routers since traffic from all sources nodes the same set of links as approaches the core. So the router have to load packet to new core router for such congestion. Congestion information is given by rtt(round trip time) between designed core router and the other router.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10c
• /
• pp.286-288
• /
• 2004

소스 호스트와 목적지 호스트간 경유 경로를 패킷 헤더에 모두 포함하는 DSR(Dynamic Source Routing)은 경유 호스트 수 증가에 비례 칠서 패킷 헤더와 개별 호스트들이 유지하는 라우트 캐쉬의 크기가 커져야 한다. 따라서 경로 크기와 선형적 관계로 유발되는 확장성 문제로 DSR을 수천 개 이상의 호스트로 구성 되는 대규모 애드-혹 망에 적용하기 어렵다. IETF(Internet Engineering Task Force)는 이러한 단점의 회피 방법으로 Flow State 메카니즘을 제안 하고 있다. 그러나 이 방법은 Route Discovery를 위한 Route Request 와 Route Response 패킷에 전체 경로를 포함 해야 하는 것은 물론 Route Cache에도 전체 경로를 저장 해야 하기 때문에 DSR 확장성 문제를 해결 할 수 없다. 본 논문에서는 경로 크기에 비례해 증가하는 DSR의 오버헤드를 패킷 헤더는 6-hoP, 라우트 캐쉬는 12-hoP 크기로 한정 하는 경로 분할 라우팅 방법을 제안한다.