• DocumentCode
    1162066
  • Title

    Optimal capacity of p-persistent CSMA protocols

  • Author

    Bruno, Raffaele ; Conti, Marco ; Gregori, Enrico

  • Author_Institution
    IIT Inst., Italian Nat. Res. Council, Pisa, Italy
  • Volume
    7
  • Issue
    3
  • fYear
    2003
  • fDate
    3/1/2003 12:00:00 AM
  • Firstpage
    139
  • Lastpage
    141
  • Abstract
    We deal with the characterization and computation of the p value, say p/sub opt/, corresponding to the maximum protocol capacity in p-persistent carrier-sense multiaccess (CSMA) protocols. The contribution of this paper is twofold. First, we give an analytical justification, and a numerical validation of a heuristic formula widely used in the literature to characterize the p/sub opt/. Second, we provide closed formulas for the p/sub opt/, and we show that the optimal capacity state, given the message length distribution, is characterized by an invariant figure: the Mp/sub opt/ product.
  • Keywords
    access protocols; carrier sense multiple access; optimisation; statistical analysis; carrier-sense multiaccess protocols; heuristic formula; maximum protocol capacity; message length distribution; optimal capacity; p-persistent CSMA protocols; Access protocols; Equations; Multiaccess communication; Random variables;
  • fLanguage
    English
  • Journal_Title
    Communications Letters, IEEE
  • Publisher
    ieee
  • ISSN
    1089-7798
  • Type

    jour

  • DOI
    10.1109/LCOMM.2002.808371
  • Filename
    1187388