• Title/Summary/Keyword: Unsaturated throughput

Search Result 7, Processing Time 0.021 seconds

Unsaturated Throughput Analysis of IEEE 802.11 DCF under Imperfect Channel Sensing

  • Shin, Soo-Young
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.4
    • /
    • pp.989-1005
    • /
    • 2012
  • In this paper, throughput of IEEE 802.11 carrier-sense multiple access (CSMA) with collision-avoidance (CA) protocols in non-saturated traffic conditions is presented taking into account the impact of imperfect channel sensing. The imperfect channel sensing includes both missed-detection and false alarm and their impact on the utilization of IEEE 802.11 analyzed and expressed as a closed form. To include the imperfect channel sensing at the physical layer, we modified the state transition probabilities of well-known two state Markov process model. Simulation results closely match the theoretical expressions confirming the effectiveness of the proposed model. Based on both theoretical and simulated results, the choice of the best probability detection while maintaining probability of false alarm is less than 0.5 is a key factor for maximizing utilization of IEEE 802.11.

Optimal Stochastic Policies in a network coding capable Ad Hoc Networks

  • Oh, Hayoung
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.12
    • /
    • pp.4389-4410
    • /
    • 2014
  • Network coding is a promising technology that increases system throughput by reducing the number of packet transmissions from the source node to the destination node in a saturated traffic scenario. Nevertheless, some packets can suffer from end-to-end delay, because of a queuing delay in an intermediate node waiting for other packets to be encoded with exclusive or (XOR). In this paper, we analyze the delay according to packet arrival rate and propose two network coding schemes, iXOR (Intelligent XOR) and oXOR (Optimal XOR) with Markov Decision Process (MDP). They reduce the average delay, even under an unsaturated traffic load, through the Holding-${\chi}$ strategy. In particular, we are interested in the unsaturated network scenario. The unsaturated network is more practical because, in a real wireless network, nodes do not always have packets waiting to be sent. Through analysis and extensive simulations, we show that iXOR and oXOR are better than the Distributed Coordination Function (DCF) without XOR (the general forwarding scheme) and XOR with DCF with respect to average delay as well as delivery ratio.

Unified Model for Performance Analysis of IEEE 802.11 Ad Hoc Networks in Unsaturated Conditions

  • Xu, Changchun;Gao, Jingdong;Xu, Yanyi;He, Jianhua
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.2
    • /
    • pp.683-701
    • /
    • 2012
  • IEEE 802.11 standard has achieved huge success in the past decade and is still under development to provide higher physical data rate and better quality of service (QoS). An important problem for the development and optimization of IEEE 802.11 networks is the modeling of the MAC layer channel access protocol. Although there are already many theoretic analysis for the 802.11 MAC protocol in the literature, most of the models focus on the saturated traffic and assume infinite buffer at the MAC layer. In this paper we develop a unified analytical model for IEEE 802.11 MAC protocol in ad hoc networks. The impacts of channel access parameters, traffic rate and buffer size at the MAC layer are modeled with the assistance of a generalized Markov chain and an M/G/1/K queue model. The performance of throughput, packet delivery delay and dropping probability can be achieved. Extensive simulations show the analytical model is highly accurate. From the analytical model it is shown that for practical buffer configuration (e.g. buffer size larger than one), we can maximize the total throughput and reduce the packet blocking probability (due to limited buffer size) and the average queuing delay to zero by effectively controlling the offered load. The average MAC layer service delay as well as its standard deviation, is also much lower than that in saturated conditions and has an upper bound. It is also observed that the optimal load is very close to the maximum achievable throughput regardless of the number of stations or buffer size. Moreover, the model is scalable for performance analysis of 802.11e in unsaturated conditions and 802.11 ad hoc networks with heterogenous traffic flows.

Exploring the Feasibility of Differentiating IEEE 802.15.4 Networks to Support Health-Care Systems

  • Shin, Youn-Soon;Lee, Kang-Woo;Ahn, Jong-Suk
    • Journal of Communications and Networks
    • /
    • v.13 no.2
    • /
    • pp.132-141
    • /
    • 2011
  • IEEE 802.15.4 networks are a feasible platform candidate for connecting all health-care-related equipment dispersed across a hospital room to collect critical time-sensitive data about patient health state, such as the heart rate and blood pressure. To meet the quality of service requirements of health-care systems, this paper proposes a multi-priority queue system that differentiates between various types of frames. The effect of the proposed system on the average delay and throughput is explored herein. By employing different contention window parameters, as in IEEE 802.11e, this multi-queue system prioritizes frames on the basis of priority classes. Performance under both saturated and unsaturated traffic conditions was evaluated using a novel analytical model that comprehensively integrates two legacy models for 802.15.4 and 802.11e. To improve the accuracy, our model also accommodates the transmission retries and deferment algorithms that significantly affect the performance of IEEE 802.15.4. The multi-queue scheme is predicted to separate the average delay and throughput of two different classes by up to 48.4% and 46%, respectively, without wasting bandwidth. These outcomes imply that the multi-queue system should be employed in health-care systems for prompt allocation of synchronous channels and faster delivery of urgent information. The simulation results validate these model's predictions with a maximum deviation of 7.6%.

Mass spectrometry-based approaches to explore metabolism regulating ferroptosis

  • Nguyen, Chi Thi Ngoc;Kim, Seon Min;Kang, Yun Pyo
    • BMB Reports
    • /
    • v.55 no.9
    • /
    • pp.413-416
    • /
    • 2022
  • Ferroptosis is a type of programmed cell death distinct from apoptosis or necroptosis. Ferroptosis is well characterized by an iron-dependent accumulation of lipid peroxides and disruption of cellular membrane integrity. Many metabolic alterations can prevent or accelerate ferroptosis induction. Recent advances in analytical techniques of mass spectrometry have allowed high-throughput analysis of metabolites known to be critical for understanding ferroptosis regulatory metabolism. In this review, we introduce mass spectrometry-based analytical methods contributing to recent discovery of various metabolic pathways regulating ferroptosis, focusing on cysteine metabolism, antioxidant metabolism, and poly-unsaturated fatty acid metabolism.

Design and Performance Analysis of an Enhanced MAC Algorithm for the IEEE 802.11 DCF (IEEE 802.11 DCF 성능 개선을 위한 매체접근제어 알고리즘의 설계 및 성능 분석)

  • Hwang, An-Kyu;Lee, Jae-Yong;Kim, Byung-Chul
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.42 no.10 s.340
    • /
    • pp.39-50
    • /
    • 2005
  • In this paper, we propose a performance improving MAC algerian for the IEEE 802.11 DCF. WLAN based IEEE 802.11 uses two control methods called 'Distributed Coordination Function(UF)' and 'Point Coordination Function(PCF)'. The nF controls the Urnsmission based on carrier sense multiple access with collision detection(CSMA/CA), that decides a random backoff time with the range of contention window for each terminal. Normally, each terminal the CW double after collision, and reduces the CW to the minimum after successful transmission. This paper proposes an enhanced DCF algorithm that decreases the CW smoothly after successful transmission in order to reduce the collision Probability by utilizing the current status information of WLAN. We also analyze the throughput and delay performance for the unsaturated case mathematically. Simulation results show that our algorithm enhances the saturation throughput of WLAN. They also coincide well with the analytical results.

Evaluation of the Effects of a Grouping Algorithm on IEEE 802.15.4 Networks with Hidden Nodes

  • Um, Jin-Yeong;Ahn, Jong-Suk;Lee, Kang-Woo
    • Journal of Communications and Networks
    • /
    • v.16 no.1
    • /
    • pp.81-91
    • /
    • 2014
  • This paper proposes hidden-node aware grouping (HAG) algorithm to enhance the performance of institute of electrical and electronics engineers (IEEE) 802.15.4 networks when they undergo either severe collisions or frequent interferences by hidden nodes. According to the degree of measured collisions and interferences, HAG algorithm dynamically transforms IEEE 802.15.4 protocol between a contention algorithm and a contention-limited one. As a way to reduce the degree of contentions, it organizes nodes into some number of groups and assigns each group an exclusive per-group time slot during which only its member nodes compete to grab the channel. To eliminate harmful disruptions by hidden nodes, especially, it identifies hidden nodes by analyzing the received signal powers that each node reports and then places them into distinct groups. For load balancing, finally it flexibly adapts each per-group time according to the periodic average collision rate of each group. This paper also extends a conventional Markov chain model of IEEE 802.15.4 by including the deferment technique and a traffic source to more accurately evaluate the throughput of HAG algorithm under both saturated and unsaturated environments. This mathematical model and corresponding simulations predict with 6%discrepancy that HAG algorithm can improve the performance of the legacy IEEE 802.15.4 protocol, for example, even by 95% in a network that contains two hidden nodes, resulting in creation of three groups.