• Title/Summary/Keyword: Packet Transmission

Search Result 1,333, Processing Time 0.027 seconds

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.

A Packet Scheduling Algorithm for High-speed Portable Internet System (휴대 인터넷 시스템에서의 패킷 스케줄링 알고리즘 연구)

  • Choi, Seong-Hoon
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.30 no.1
    • /
    • pp.59-65
    • /
    • 2007
  • HPI (High-speed Portable Internet) system which provides high speed internet services is going to be commercialized soon. Since HPI provides simultaneously four different service types such as UGS (Unsolicited Grant Service), rtPS (real time Polling Service), nrtPS(non-real time Polling Service), and BE (Best Effort) under different QoS (Quality of Service) requirements and limited wireless channel resources, efficient packet scheduling mechanisms are necessary to increase the utilization of channels as well as to satisfy the various QoS requirements. This study regards the traffic data to be served as time series and proposes a new packet scheduling algorithm based on the nonparametric statistical test. The performance of the newly proposed algorithm is evaluated through the simulation analysis using a simulator that can evaluate the performance of packet scheduling mechanisms under various values of system parameters and measures such as packet delay time, data transmission rate, number of loss packets, and channel utilization.

ARQ Performance Analysis of Adaptive Packet Lenth Allocation Method (적응 패킷 길이 할당 방식의 ARQ 성능분석)

  • 정기호
    • Proceedings of the Acoustical Society of Korea Conference
    • /
    • 1993.06a
    • /
    • pp.273-275
    • /
    • 1993
  • The throughput of conventional ARQ protocols can be improved by dynamically adapting the packet length. This protocol transmits packets with the length to maximize the transmission efficiency, based on the dynamic estimation of time-varying channel condition. A very simple adaptive scheme is presented. The results of a simulation show that the scheme performs well.

  • PDF

Routing Algorithm of VANET for an Efficient Path Management in Urban Intersections (도심 교차로에서 효율적 경로 관리를 위한 자동차 통신용 라우팅 알고리즘)

  • Cho, Sunghyun;Kim, Seokwoo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38A no.12
    • /
    • pp.1054-1060
    • /
    • 2013
  • This paper proposes a vehicle ad-hoc network (VANET) routing algorithm to reduce the probability of routing path discontinuity in urban intersections. In urban intersections, the vehicles may frequently change their moving directions. It can cause the disconnection of routing path and the increase of a packet transmission delay. In order to resolve this problem, the proposed routing algorithm exploits the information of moving directions in urban intersections. In this way, the proposed algorithm can reduce the probability of the local maximum which causes the increase of the number of routing hops and packet transmission delay. Simulation results show that the proposed algorithm can reduce the local maximum probability by 10% and increase the successful packet transmission ratio by 5% compared to the conventional VANET routing algorithms.

Load Sharing in Hierarchical Cell Structure for High Speed Downlink Packet Transmission (하향링크 고속 패킷 전송을 위한 계층적 셀 구조에서의 기지국간 부하 분배)

  • Jeong, Dong-Geun;Jeon, Wha-Sook
    • Journal of KIISE:Information Networking
    • /
    • v.29 no.5
    • /
    • pp.466-472
    • /
    • 2002
  • We investigate the load sharing problem between the umbrella cell and the overlaid tells in hierarchical cell structure. A load sharing strategy is proposed and its performance is evaluated by simulation when it is used for transmission of the mobile Internet traffic using the High Speed Downlink Packet Access scheme. The results show that, with the proposed strategy, the microcell backs well the overlaid picocells up, especially when a specific picocell cluster suffers unusual heavy load condition. By using the strategy, we can reduce the installation cost, otherwise needed for increasing the system capacity of every picocell cluster to cope with the unusual heavy load.

A Packet-Loss Resilient Packetization and Associated Video Coding Methods for the Internet Video Transmission (인터넷 동영상 전송을 위한 패킷손실에 강인한 패킷화 및 동영상부호화 기법)

  • Yoo Kook-yeol
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.11C
    • /
    • pp.1068-1075
    • /
    • 2005
  • In this paper we propose a video coding method and associated packetization and decoding methods for error resilient transmission over the Internet. The proposed method re-organizes the input image into several mutually similar subimages. For this case, if the one of the subimage is lost in the network, the lost one is recovered by the proposed error concealment method which uses the correctly received other subimages. The performance of the proposed method is confirmed by the empirical results. The proposed method is not limited to the Internet communications but is applicable to the other packet-based networks.

p-Persistent MAC Protocol for WDM Ring Networks

  • So, Won-Ho;Kim, Young-Chon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.9B
    • /
    • pp.589-597
    • /
    • 2007
  • In this paper, a WDM metro ring consisting of access nodes with $FT-FR^n$ (Fixed Transmitter - n Fixed Receivers) is considered. A trade-off exists between node throughput and transmission fairness because the access nodes share wavelength channels. In order to eliminate the transmission unfairness and to increase throughput, the p-persistent medium access control (MAC) protocol is proposed: each node uses an empty optical slot to transmit a packet and make it available with the extraction of a transferred packet at the source access node, called source-stripping. The local empty slot can be used to transfer a head-of-line packet in the local buffer with probability p or it is used for the next downstream nodes with 1-p. The proposed MAC protocol provides better node throughput than the non-persistent protocol and exhibits better fairness index than the 1-persistent protocol in WDM ring networks. In addition, numerical analysis shows that the proposed MAC protocol maximizes the node throughput under uniform traffic conditions. For more detailed results, we use the network simulation under Poisson and self-similar traffic. Furthermore, unpredictable traffic constructed by the combination of the former and the latter is also considered. The reasonable probability of the p-persistent protocol for a given architecture can be determined through simulation.

A Study on Packet Transmissions using overhearing and Time-Interval in WMSNs (WMSN에서 엿듣기와 시간 지연을 이용한 패킷 전송에 관한 연구)

  • Ha, IlKyu;Byeon, Seokjin;Ahn, ByoungChul
    • Journal of Korea Multimedia Society
    • /
    • v.16 no.4
    • /
    • pp.464-471
    • /
    • 2013
  • With the advance of wireless sensor networks, WMSN(Wireless Multimedia Sensor Networks) researches to transfers multimedia data have been studied actively. First of all, three basic protocols, End-to-end, Hop-by-hop, and Unreliable transmission method, are compared to transfer multimedia data using simulations. This paper presents an efficient protocol to transfer multimedia data by overhearing messages of nodes and by transmitting next packets during the unused time interval. The proposed method is verified its performance by simulations and experiments. The results shows that the transmission rate of the proposed method 22% higher than that of End-to-end protocol with half of transmission time. Also the performance of the proposed method is compared with that of PIGAB(Packet Interval Gap based on Adaptive Backoff).

Differentiated Packet Transmission Methods for Underwater Sensor Communication Using SON Technique (SON (Self Organizing Network) 기술을 이용한 해양 수중 센서 간 통신에 있어서 데이터 중요도에 따른 패킷 차별화 전송 기법)

  • Park, Kyung-Min;Kim, Young-Yong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.4B
    • /
    • pp.399-404
    • /
    • 2011
  • For the underwater wireless sensor networks, we propose the packet transmission method which distinguishes more important packet than others. Because the ocean underwater transmission environments are extremely unstable, we use SON(Self Organizing Network) techniques to adapt to the constantly varying underwater acoustic communication channels and randomly deployed sensor nodes. Especially we suppose two kinds of packets which have different priorities, and through the simulations we show that high priority packets arrive at the source node faster than lower priority packets with a proposed scheme.

Layer based Cooperative Relaying Algorithm for Scalable Video Transmission over Wireless Video Sensor Networks (무선 비디오 센서 네트워크에서 스케일러블 비디오 전송을 위한 계층 기반 협업 중계 알고리즘*)

  • Ha, Hojin
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.18 no.4
    • /
    • pp.13-21
    • /
    • 2022
  • Recently, in wireless video sensor networks(WVSN), various schemes for efficient video data transmission have been studied. In this paper, a layer based cooperative relaying(LCR) algorithm is proposed for minimizing scalable video transmission distortion from packet loss in WVSN. The proposed LCR algorithm consists of two modules. In the first step, a parameter based error propagation metric is proposed to predict the effect of each scalable layer on video quality degradation at low complexity. In the second step, a layer-based cooperative relay algorithm is proposed to minimize distortion due to packet loss using the proposed error propagation metric and channel information of the video sensor node and relay node. In the experiment, the proposed algorithm showed that the improvement of peak signal-to-noise ratio (PSNR) in various channel environments, compared to the previous algorithm(Energy based Cooperative Relaying, ECR) without considering the metric of error propagation.The proposed LCR algorithm minimizes video quality degradation from packet loss using both the channel information of relaying node and the amount of layer based error propagation in scalable video.