• Title/Summary/Keyword: saturation throughput

Search Result 46, Processing Time 0.025 seconds

IEEE 802.15.6 Under Saturation: Some Problems to Be Expected

  • Rashwand, Saeed;Misic, Jelena;Khazaei, Hamzeh
    • Journal of Communications and Networks
    • /
    • v.13 no.2
    • /
    • pp.142-148
    • /
    • 2011
  • Because currently available wireless technologies are not appropriate for wireless body area networks (WBANs), the IEEE 802.15.6 standard was introduced by the IEEE 802.15.6 Task Group to satisfy all the requirements for a monitoring system that operates on, in, or around the human body. In this work, we develop an analytical model for evaluating the performance of an IEEE 802.15.6-based WBAN under saturation condition and a noisy channel. We employ a three-dimensional Markov chain to model the backoff procedure as specified in the standard. Probability generating functions (PGFs) are used to compute the performance descriptors of the network. The results obtained from the analytical model are validated by simulation results. Our results indicate that under saturation condition, the medium is accessed by the highest user priority nodes at the vast majority of time while the other nodes are starving.

Modeling and Analyzing Per-flow Throughput in IEEE 802.11 Multi-hop Ad Hoc Networks

  • Lei, Lei;Zhao, Xinru;Cai, Shengsuo;Song, Xiaoqin;Zhang, Ting
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.10
    • /
    • pp.4825-4847
    • /
    • 2016
  • In this paper, we focus on the per-flow throughput analysis of IEEE 802.11 multi-hop ad hoc networks. The importance of an accurate saturation throughput model lies in establishing the theoretical foundation for effective protocol performance improvements. We argue that the challenge in modeling the per-flow throughput in IEEE 802.11 multi-hop ad hoc networks lies in the analysis of the freezing process and probability of collisions. We first classify collisions occurring in the whole transmission process into instantaneous collisions and persistent collisions. Then we present a four-dimensional Markov chain model based on the notion of the fixed length channel slot to model the Binary Exponential Backoff (BEB) algorithm performed by a tagged node. We further adopt a continuous time Markov model to analyze the freezing process. Through an iterative way, we derive the per-flow throughput of the network. Finally, we validate the accuracy of our model by comparing the analytical results with that obtained by simulations.

Throughput Analysis of Right Turn Shared Lane with Lane Width Change (차로폭에 따른 우회전 공용차로의 통과교통량분석)

  • 김동녕;김경환
    • Journal of Korean Society of Transportation
    • /
    • v.21 no.2
    • /
    • pp.17-31
    • /
    • 2003
  • This study is about throughput analysis of the shared right turn lane at signalized intersection with lane width change. It is expected that the increased width of the right turn shared lane causes to increase the volume of right turn on red(RTOR) In this study, the throughput computation is designed to take into account the lost time which is caused by the blocked right turn due to the stop of through traffic. The saturation flow rate of right turn using the rest of lane after through traffic stops is included as well. Results show that the different RTOR volume levels due to the various shared lane width leads to a difference in throughput. For the shared right turn lanes. throughput capacity for various lane widths is bigger than that of the KHCM as much as from 1.1 to 2.1 times.

Performance Analysis of Directional CSMA/CA for IEEE 802.15.3c under Saturation Environments

  • Kim, Mee-Joung;Kim, Yong-Sang;Lee, Woo-Yong
    • ETRI Journal
    • /
    • v.34 no.1
    • /
    • pp.24-34
    • /
    • 2012
  • In this paper, the directional carrier sense multiple access/collision avoidance (CSMA/CA) protocol in the immediate acknowledgement mode for IEEE 802.15.3c is analyzed under saturation environments. For the analysis, a sensing region and an exclusive region with a directional antenna are computed probabilistically and a Markov chain model in which the features of IEEE 802.15.3c and the effects of using directional antennas are incorporated is analyzed. An algorithm to find the maximal number of concurrently transmittable frames is proposed. The system throughput and the average transmission delay are obtained in closed forms. The numerical results show the impact of directional antennas on the CSMA/CA media access control (MAC) protocol. For instance, the throughput with a small beamwidth of antenna is more than ten times larger than that for an omnidirectional antenna. The overall analysis is verified by a simulation. The obtained results will be helpful in developing an MAC protocol for enhancing the performance of mmWave wireless personal area networks.

CANCAR - Congestion-Avoidance Network Coding-Aware Routing for Wireless Mesh Networks

  • Pertovt, Erik;Alic, Kemal;Svigelj, Ales;Mohorcic, Mihael
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.9
    • /
    • pp.4205-4227
    • /
    • 2018
  • Network Coding (NC) is an approach recently investigated for increasing the network throughput and thus enhancing the performance of wireless mesh networks. The benefits of NC can further be improved when routing decisions are made with the awareness of coding capabilities and opportunities. Typically, the goal of such routing is to find and exploit routes with new coding opportunities and thus further increase the network throughput. As shown in this paper, in case of proactive routing the coding awareness along with the information of the measured traffic coding success can also be efficiently used to support the congestion avoidance and enable more encoded packets, thus indirectly further increasing the network throughput. To this end, a new proactive routing procedure called Congestion-Avoidance Network Coding-Aware Routing (CANCAR) is proposed. It detects the currently most highly-loaded node and prevents it from saturation by diverting some of the least coded traffic flows to alternative routes, thus achieving even higher coding gain by the remaining well-coded traffic flows on the node. The simulation results confirm that the proposed proactive routing procedure combined with the well-known COPE NC avoids network congestion and provides higher coding gains, thus achieving significantly higher throughput and enabling higher traffic loads both in a representative regular network topology as well as in two synthetically generated random network topologies.

Link Layer Traffic Control Algorithm to Improve the Performance of WLANs (무선 랜 성능 향상을 위한 링크 계층 트래픽 제어 알고리즘)

  • Choi, Sun-Woong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.12 no.4
    • /
    • pp.758-765
    • /
    • 2008
  • Wide-spread deployment of infrastructure WLANs has made Wi-Fi an integral part of today's Internet access technology. WLANs suffer from degraded system throughput and each node's throughput fluctuates significantly in the saturation regime. In this paper, we propose a link layer traffic control mechanism which controls the offered load of DCF system. It is shown that the link layer traffic controller can improve DCF system throughput and reduce nodes' throughput fluctuation with properly controlled offered load. We propose a dynamic traffic control algorithm which can find an optimal offered load and show its performance improvement with ns-2 simulation.

Green-Split Coordination Strategy in Oversaturated Signal System (과포화교통상태에서의 SPLIT COORDINATION신호제어전략)

  • 이광훈
    • Journal of Korean Society of Transportation
    • /
    • v.11 no.1
    • /
    • pp.87-103
    • /
    • 1993
  • The subject this paper is the signal control strategy under oversaturated conditions. The nature of traffic control for oversaturation is essentially different from the standard control modes. While under non-saturated situation traffic control is needed for the sake of safety and efficiency, the throughput is essential under oversaturated conditions. Therefore berth objective and strategies differ. For an oversaturated stream the cycle time and the signal offset are thought to be of rather secondary importance. For this case the green split may well be the most important control variable to serve the excessive demand. Up to now, however, most efforts have concentrated on the strategy with the concept which lies just on the extension of Webster's. "Green-split Coordination Strategy for Over-Saturated Networks", presents newly contrived three types of strategies named Forward-coordination, Backward-coordination and Network-coordination respectively and describes the algorithms with the evaluations. The forward coordination strategy treats the forward wave of flow between two signals. The aim is to prevent the outbreak of queue due to the accumulation of temporary excess of demand in near-saturation or saturation flow. The backward coordination strategy treats the backward rave of flow between two signals. The goal is to prevent the waste of green time caused by the exit block at the upstream signal. for this purpose a feedback regulation is provided of the upstream green-split so that the inflow-outflow balance is kept zero. The resultant surplus of green time is alloted to other signal stages. Also here the examination is made of the appropriate value of the feedback control parameter. The network coordination strategy is operated to maximize the network throughput in a specific direction applying a bang-bang control at the bottleneck intersection. This is a type of intervenient control for policy reasons. For this strategy the green-split coordinations, particuarly the backward coordination, are essential as the tactical elements. In order to evaluate the preposed strategies those are compared with the latest existing strategy called saturation-degree-ratio control by the simulation experiments in an assumed 4$\times$4 grid network. The results are satisfactory showing a 10-15% reduction in delays and a 15% increase in network capacity.

  • PDF

Modeling Slotted Aloha of WBAN in Non-Saturated Conditions

  • Chowdhury, Mohammad Sanaullah;Khan, Pervez;Jung, Jaijin;Kwak, Kyung Sup
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.6
    • /
    • pp.1901-1913
    • /
    • 2014
  • The IEEE 802.15.6 is a communication standard for Wireless Body Area Networks (WBANs). This standard includes a prioritized slotted Aloha as a choice for medium access control. This protocol is different from the traditional version as it has integral considerations for certain priorities of users. It attempts to resolve collision by halving the probability of retransmission, lower bounded by to a minimum, in the alternate slots to follow. In this paper, we present an analytical model to compute the non-saturated throughput of this protocol in the presence of finite number of nodes. The model is validated against simulation.

802.11 Ad Hoc LANs with Realistic Channels : Study of Packet Fragmentation

  • Kim, Chesoong;Lee, Seokjun;Lyakhov, Andrey;Vishnevsky , Vladimir
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.33 no.3
    • /
    • pp.381-392
    • /
    • 2007
  • In this paper, we present an analytical method for estimating the saturation throughput of an 802.11 ad hoc LAN in the presence of noise distorting transmitted frames. This is the first method that allows studying analytically the 802.11 network performance with consideration of correlated channel failures usually inherent to realistic wireless channels. With the study, we consider the possible packet fragmentation that can be adopted to reduce the performance degradation caused by noise-induced distortions. In addition to the throughput, our method allows estimating the probability of a packet rejection occurring when the number of packet transmission retries attains its limit. The obtained numerical results of investigating 802.11 LANs by the developed method are validated by simulation and show high estimation accuracy as well as the method efficiency in determining the optimal fragmentation threshold.

Priority MAC based on Multi-parameters for IEEE 802.15.7 VLC in Non-saturation Environments

  • Huynh, Vu Van;Le, Le Nam-Tuan;Jang, Yeong-Min
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.3C
    • /
    • pp.224-232
    • /
    • 2012
  • Priority MAC is an important issue in every communication system when we consider differentiated service applications. In this paper, we propose a mechanism to support priority MAC based on multi-parameters for IEEE 802.15.7 visible light communication (VLC). By using three parameters such as number of backoff times (NB), backoff exponent (BE) and contention window (CW), we provide priority for multi-level differentiated service applications. We consider beacon-enabled VLC personal area network (VPAN) mode with slotted version for random access algorithm in this paper. Based on a discrete-time Markov chain, we analyze the performance of proposed mechanism under non-saturation environments. By building a Markov chain model for multi-parameters, this paper presents the throughput and transmission delay time for VLC system. Numerical results show that we can apply three parameters to control the priority for VLC MAC protocol.