• DocumentCode
    46421
  • Title

    Temporal Starvation in CSMA Wireless Networks

  • Author

    Caihong Kai ; Soung Chang Liew

  • Author_Institution
    Dept. of Inf. Eng., Chinese Univ. of Hong Kong, Shatin, China
  • Volume
    14
  • Issue
    7
  • fYear
    2015
  • fDate
    July 1 2015
  • Firstpage
    1515
  • Lastpage
    1529
  • Abstract
    It is well known that links in CSMA wireless networks are prone to starvation. Prior works focused almost exclusively on equilibrium starvation. Links in CSMA wireless networks are also susceptible to temporal starvation. Specifically, although some links have good equilibrium throughputs and do not suffer from equilibrium starvation, they can still have zero or little throughputs for extended periods from time to time. For real-time applications such as VoIP and video streaming, it is desirable to understand and characterize temporal starvation in CSMA wireless networks. To this end, we develop a “trap theory” to analyze temporal throughput fluctuations. The trap theory serves two functions. First, it allows us to derive new mathematical results that shed light on the transient behavior of CSMA networks. For example, we show that the duration of a trap, during which some links receive zero or little throughputs, is insensitive to the distributions of the transmission time (packet duration) and the backoff countdown time in the CSMA protocol given their respective means. This implies that the phenomenon of temporal starvation is fundamental and cannot be solved by simply manipulating the probability distributions of the backoff countdown time and transmission time alone. Second, with the trap theory, we can develop analytical tools for computing the “degrees of starvation” for CSMA networks to aid network design. For example, given a CSMA network, we can determine whether it suffers from starvation, and if so, which links will starve. Furthermore, the likelihood and durations of temporal starvation, if any, can also be computed. To further motivate the study of temporal starvation, we show that the existing remedies designed to solve equilibrium starvation may not work well as far as temporal starvation is considered. We believe that the ability to identify and characterize temporal starvation as established in this paper will serve - s an important first step toward the design of effective remedies for it.
  • Keywords
    carrier sense multiple access; radio links; radio networks; statistical distributions; CSMA protocol; CSMA wireless networks; backoff countdown time distribution; equilibrium starvation; equilibrium throughput; probability distribution; temporal starvation; temporal throughput fluctuation; transmission time distribution; trap theory; wireless links; IEEE 802.11 Standards; Markov processes; Mobile computing; Multiaccess communication; Protocols; Throughput; Wireless networks; CSMA; IEEE 802.11; Starvation; Wi-Fi; ergodic sojourn time;
  • fLanguage
    English
  • Journal_Title
    Mobile Computing, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    1536-1233
  • Type

    jour

  • DOI
    10.1109/TMC.2014.2352256
  • Filename
    6883199