• Title/Summary/Keyword: Throughput Rate

Search Result 934, Processing Time 0.024 seconds

Analysis of V2V Broadcast Performance Limit for WAVE Communication Systems Using Two-Ray Path Loss Model

  • Song, Yoo-Seung;Choi, Hyun-Kyun
    • ETRI Journal
    • /
    • v.39 no.2
    • /
    • pp.213-221
    • /
    • 2017
  • The advent of wireless access in vehicular environments (WAVE) technology has improved the intelligence of transportation systems and enabled generic traffic problems to be solved automatically. Based on the IEEE 802.11p standard for vehicle-to-anything (V2X) communications, WAVE provides wireless links with latencies less than 100 ms to vehicles operating at speeds up to 200 km/h. To date, most research has been based on field test results. In contrast, this paper presents a numerical analysis of the V2X broadcast throughput limit using a path loss model. First, the maximum throughput and minimum delay limit were obtained from the MAC frame format of IEEE 802.11p. Second, the packet error probability was derived for additive white Gaussian noise and fading channel conditions. Finally, the maximum throughput limit of the system was derived from the packet error rate using a two-ray path loss model for a typical highway topology. The throughput was analyzed for each data rate, which allowed the performance at the different data rates to be compared. The analysis method can be easily applied to different topologies by substituting an appropriate target path loss model.

An Efficient Cell Control Scheme for Internet Traffic Service in PNNI Networks (PNNI 망에서 인터넷 트래픽 서비스를 위한 효율적 셀 제어 기법)

  • Kim Byun-Gon
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.41 no.12
    • /
    • pp.15-21
    • /
    • 2004
  • The Guaranteed Bandwidth Rate scheme has been designed to accomodate non-real-time applications, such as Internet based traffic in Pm networks. The Guaranteed Bandwidth Rate scheme not only guarantees a minimum throughput at the frame level, but also supports a fair share of available resources. In this paper, we propose a cell control algorithm which can improve the fairness and the throughput through the traffic control in PM networks. For the evaluation of the proposed scheme, we compare proposed scheme with the existing scheme in the fairness and the throughput. Simulation results show that proposed scheme can improve the fairness and throughput than the existing scheme.

A Buffer Management Scheme for Throughput and Fairness Improvement in ATM Networks (ATM 망에서 수율 및 공평성 향상을 위한 효율적 버퍼관리 기법)

  • 김남희
    • Journal of Korea Multimedia Society
    • /
    • v.6 no.5
    • /
    • pp.842-848
    • /
    • 2003
  • The Guaranteed Frame Rate(GFR) service has been designed to accomodate non-real-time applications, such as TCP/IP based traffic in ATM networks. One of the important factors is buffer management for guaranteeing QoS in GFR service. In this paper, we propose a buffer management scheme which can improve the fairness and the throughput through the traffic control in GFR service. For the evaluation of the proposed scheme, we compare proposed scheme with the existing scheme in the fairness and the throughput. Simulation results show that proposed scheme can improve the fairness and throughput than the existing scheme.

  • PDF

Study on High Speed Routers(II)-Performance Analysis on Various Network Topology of STC104 (고속 라우터에 대한 고찰(II)-STC104의 망 구성에 따른 성능분석)

  • Lee, Hyo-Jong
    • The KIPS Transactions:PartA
    • /
    • v.8A no.2
    • /
    • pp.157-166
    • /
    • 2001
  • A simulation package has been developed as an event-driven system that can handle the hardware configuration of STC104 and algorithm proposed in the sister paper of ‘Study on High Speed Routers(II).’After various STC104 topology of meshes, torus, and hypercubes are constructed using up to 512 switches, the performance of each topology has been analyzed under different message generation rate in terms of throughputs, latency, and packet blocking time. Modified multicast algorithms for STC104 have been proposed for STC104 after U-mesh and U-torus in order to overcome the multicasting difficulty because of the point-to-point communication method found in STC104. The performance of the multicast algorithms have been analyzed over meshes and torus configuration. Throughput gets higher in the order of mesh, torus, and hypercube. Throughput difference among topology were distinctive in the zone of high message generation rate. Latency and blocking time increased in the order of hypercube, torus, and mesh. U-mesh and U-torus of software multicast showed similar throughput, however, U-mesh peformed slightly better result. These algorithms showed eight to ten times better results compared to individual message pass for 90 destination nodes. Multi-link environment also showed better performance than single-link environment because multi-link network used the extra links for communication.

  • PDF

Buffer-Based Adaptive Bitrate Algorithm for Streaming over HTTP

  • Rahman, Waqas ur;Chung, Kwangsue
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.11
    • /
    • pp.4585-4603
    • /
    • 2015
  • Video streaming services make up a large proportion of Internet traffic on both fixed and mobile access throughout the world. Adaptive streaming allows for dynamical adaptation of the bitrate with varying network conditions, to guarantee the best user experience. Adaptive bitrate algorithms face a significant challenge in correctly estimating the throughput as it varies widely over time. In this paper, we first evaluate the throughput estimation techniques and show that the method that we have used offers stable response to throughput fluctuations while maintaining a stable playback buffer. Then, we propose an adaptive bitrate scheme that intelligently selects the video bitrates based on the estimated throughput and buffer occupancy. We show that the proposed scheme improves viewing experience by achieving a high video rate without taking unnecessary risks and by minimizing the frequency of changes in the video quality. Furthermore, we show that it offers a stable response to short-term fluctuations and responds swiftly to large fluctuations. We evaluate our algorithm for both constant bitrate (CBR) and variable bitrate (VBR) video content by taking into account the segment sizes and show that it significantly improves the quality of video streaming.

Relaying Protocols and Delay Analysis for Buffer-aided Wireless Powered Cooperative Communication Networks

  • Zhan, Jun;Tang, Xiaohu;Chen, Qingchun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.8
    • /
    • pp.3542-3566
    • /
    • 2018
  • In this paper, we investigate a buffer-aided wireless powered cooperative communication network (WPCCN), in which the source and relay harvest the energy from a dedicated power beacon via wireless energy transfer, then the source transmits the data to the destination through the relay. Both the source and relay are equipped with an energy buffer to store the harvested energy in the energy transfer stage. In addition, the relay is equipped with a data buffer and can temporarily store the received information. Considering the buffer-aided WPCCN, we propose two buffer-aided relaying protocols, which named as the buffer-aided harvest-then-transmit (HtT) protocol and the buffer-aided joint mode selection and power allocation (JMSPA) protocol, respectively. For the buffer-aided HtT protocol, the time-averaged achievable rate is obtained in closed form. For the buffer-aided JMSPA protocol, the optimal adaptive mode selection scheme and power allocation scheme, which jointly maximize the time-averaged throughput of system, are obtained by employing the Lyapunov optimization theory. Furthermore, we drive the theoretical bounds on the time-averaged achievable rate and time-averaged delay, then present the throughput-delay tradeoff achieved by the joint JMSPA protocol. Simulation results validate the throughput performance gain of the proposed buffer-aided relaying protocols and verify the theoretical analysis.

Asymmetric RTS/CTS for Exposed Node Reduction in IEEE 802.11 Ad Hoc Networks

  • Matoba, Akihisa;Hanada, Masaki;Kanemitsu, Hidehiro;Kim, Moo Wan
    • Journal of Computing Science and Engineering
    • /
    • v.8 no.2
    • /
    • pp.107-118
    • /
    • 2014
  • One interesting problem regarding wireless local area network (WLAN) ad-hoc networks is the effective mitigation of hidden nodes. The WLAN standard IEEE 802.11 provides request to send/clear to send (RTS/CTS) as mitigation for the hidden node problem; however, this causes the exposed node problem. The first 802.11 standard provided only two transmission rates, 1 and 2 Mbps, and control frames, such as RTS/CTS assumed to be sent at 1 Mbps. The 802.11 standard has been enhanced several times since then and now it supports multi-rate transmission up to 65 Mbps in the currently popular 802.11n (20 MHz channel, single stream with long guard interval). As a result, the difference in transmission rates and coverages between the data frame and control frame can be very large. However adjusting the RTS/CTS transmission rate to optimize network throughput has not been well investigated. In this paper, we propose a method to decrease the number of exposed nodes by increasing the RTS transmission rate to decrease RTS coverage. Our proposed method, Asymmetric Range by Multi-Rate Control (ARMRC), can decrease or even completely eliminate exposed nodes and improve the entire network throughput. Experimental results by simulation show that the network throughput in the proposed method is higher by 20% to 50% under certain conditions, and the proposed method is found to be effective in equalizing dispersion of throughput among nodes.

QoS-guaranteed Multimedia Streaming for Mulltiple Interfaces (다중 인터페이스 환경에서 서비스 품질을 지원하는 멀티미디어 스트리밍 기법 연구)

  • Cho, Ki-Deok;Park, Yong-Woon;Kwon, Tae-Kyoung;Choi, Yang-Hee
    • Journal of KIISE:Information Networking
    • /
    • v.36 no.3
    • /
    • pp.191-197
    • /
    • 2009
  • One of popular applications in the Internet is the multimedia streaming services such as IPTV or You Tube in which supporting quality of service (QoS) is an important issue. One of widely adopted rate control scheme is TCP-friendly rate control (TFRC) which shows comparable performance with TCP in term of throughput and lower variation of throughput over time. On the other hand, devices with multiple interfaces are emerging in the market. However, it has not proposed to exploit multiple interfaces simultaneously for multimedia streaming services with TFRC. In this paper, we propose a multimedia streaming algorithm with TFRC which exploits multiple interfaces to guarantee the quality of service. We show that the proposed scheme shows better performance than those with a single interface in terms of throughput and communication costs.

Network Coding-based Maximum Lifetime Algorithm for Sliding Window in WSNs

  • Sun, Baolin;Gui, Chao;Song, Ying;Chen, Hua
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.3
    • /
    • pp.1298-1310
    • /
    • 2019
  • Network coding (NC) is a promising technology that can improve available bandwidth and packet throughput in wireless sensor networks (WSNs). Sliding window is an improved technology of NC, which is a supplement of TCP/IP technology and can improve data throughput and network lifetime on WSNs. This paper proposes a network coding-based maximum lifetime algorithm for sliding window in WSNs (NC-MLSW) which improves the throughput and network lifetime in WSN. The packets on the source node are sent on the WSNs. The intermediate node encodes the received original packet and forwards the newly encoded packet to the next node. Finally, the destination node decodes the received encoded data packet and recovers the original packet. The performance of the NC-MLSW algorithm is studied using NS2 simulation software and the network packet throughput, network lifetime and data packet loss rate were evaluated. The simulations experiment results show that the NC-MLSW algorithm can obviously improve the network packet throughput and network lifetime.

Complex Field Network Coding with MPSK Modulation for High Throughput in UAV Networks

  • Mingfei Zhao;Rui Xue
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.18 no.8
    • /
    • pp.2281-2297
    • /
    • 2024
  • Employing multiple drones as a swarm to complete missions can sharply improve the working efficiency and expand the scope of investigation. Remote UAV swarms utilize satellites as relays to forward investigation information. The increasing amount of data demands higher transmission rate and complex field network coding (CFNC) is deemed as an effective solution for data return. CFNC applied to UAV swarms enhances transmission efficiency by occupying only two time slots, which is less than other network coding schemes. However, conventional CFNC applied to UAVs is combined with constant coding and modulation scheme and results in a waste of spectrum resource when the channel conditions are better. In order to avoid the waste of power resources of the relay satellite and further improve spectral efficiency, a CFNC transmission scheme with MPSK modulation is proposed in this paper. For the proposed scheme, the satellite relay no longer directly forwards information, but transmits information after processing according to the current channel state. The proposed transmission scheme not only maintains throughput advantage of CFNC, but also enhances spectral efficiency, which obtains higher throughput performance. The symbol error probability (SEP) and throughput results corroborated by Monte Carlo simulation show that the proposed transmission scheme improves spectral efficiency in multiples compared to the conventional CFNC schemes. In addition, the proposed transmission scheme enhances the throughput performance for different topology structures while keeping SEP below a certain value.