• Title/Summary/Keyword: 무선 캐싱

Search Result 54, Processing Time 0.018 seconds

A Handover Protocol for the IEEE WAVE-based Wireless Networks (IEEE WAVE 기반의 무선 네트워크를 위한 핸드오버 프로토콜)

  • Choi, Jung-Wook;Lee, Hyuk-Joon;Choi, Yong-Hoon;Chung, Young-Uk
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.10 no.1
    • /
    • pp.76-83
    • /
    • 2011
  • The IEEE WAVE-based communication systems do not provide handover services since most of the application layer messages of a small amount containing text data that are related to safe driving. Multimedia data service such as web pages and CCTV video clips, however, require a seamless handover for continuation of a session via multiple RSUs. In this paper, we propose a new proactive handover protocol based on IEEE WAVE. According to the proposed handover protocol, the OBU notifies the old RSU of its departure from the coverage such that the old RSU forwards to the new RSU the data heading towards the OBU to be cached for the further delivery upon its entry into the new RSU's coverage. The simulation results are presented which shows the performance of the proposed protocol in terms of throughput, delivery ratio and handover delay.

A Multicast-Based Handover Scheme for the IEEE WAVE Networks (IEEE WAVE 네트워크를 위한 멀티캐스트 기반 핸드오버 기법)

  • Lee, Hyuk-Joon;Yoon, Seok-Young;Lee, Sang-Joon
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.10 no.2
    • /
    • pp.112-121
    • /
    • 2011
  • The IEEE WAVE standard specification does not support handover operation since it is designed to transmit mainly the ITS-related messages that are limited in length. More advanced multimedia applications such as Internet browsing and streaming of video clips produced by CCTVs, however, require handover support such that a sequence of data packets can be received seamlessly while an OBU's association with the RSUs changes. This paper presents a new handover scheme that can operate without performance degradation in the cases where there are multiple RSUs in the areas of handover by making use of the IEEE 802.11f IAPP Move-notify messages, based on the fast handover scheme with proactive caching by disassociation messages introduced previously. Experimental results from the simulation shows that the proposed handover scheme outperforms the scheme based solely on multicast.

Fault Tolerant Data Aggregation for Reliable Data Gathering in Wireless Sensor Networks (무선센서네트워크에서 신뢰성있는 데이터수집을 위한 고장감내형 데이터 병합 기법)

  • Baek, Jang-Woon;Nam, Young-Jin;Jung, Seung-Wan;Seo, Dae-Wha
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.9B
    • /
    • pp.1295-1304
    • /
    • 2010
  • This paper proposes a fault-tolerant data aggregation which provides energy efficient and reliable data collection in wireless sensor networks. The traditional aggregation scheme does not provide the countermeasure to packet loss or the countermeasure scheme requires a large amount of energy. The proposed scheme applies caching and re-transmission based on the track topology to the adaptive timeout scheduling. The proposed scheme uses a single-path routing based on the traditional tree topology at normal, which reduces the dissipated energy in sensor nodes without any countermeasure against packet loss. The proposed scheme, however, retransmits the lost packet using track topology under event occurrences in order to fulfill more accurate data aggregation. Extensive simulation work under various workloads has revealed that the proposed scheme decrease by 8% in terms of the dissipated energy and enhances data accuracy 41% when the potential of event occurrence exists as compared with TAG data aggregation. And the proposed scheme decrease by 53% in terms of the dissipated energy and shows a similar performance in data accuracy when the potential of event occurrence exists as compared with PERLA data aggregation.

Transmission Performance Analysis of VCCN with SUMO depending on Packet Size and Participating Number of Clients (SUMO를 이용한 VCCN에서 패킷의 크기와 참여한 클라이언트 수에 따른 전송 성능에 대한 연구)

  • Yeon, Seunguk;Chae, Ye-Eun;Kang, Seung-Seok
    • The Journal of the Convergence on Culture Technology
    • /
    • v.4 no.1
    • /
    • pp.285-290
    • /
    • 2018
  • Vehicular ad hoc network (VANET) is one of the future communication technologies in which it offers safe-driving information and Internet access for both drivers and passengers by communicating among cars on the road. In case of applying Content Centric Network (CCN) rather than TCP/IP over VANET, called VCCN, it can provide efficient multicast communication of shared information among participating cars as well as offer corresponding one-to-one communications. This paper introduces SUMO for simulating traffic flows, VANET for car-to-car ad hoc communications, and CCN for a future Internet architecture. In addition, it compares and analyses the transmission performance of moving cars over VCCN. According to the simulation results using SUMO and VCCN, the larger the packet size, the better the transmission performance. In addition, VCCN provides higher packet transmission rate than that of TCP/IP when the clients shares the same contents. Furthermore, the overall data reception rate exceeds the physical transmission channel rate.