IDEAS home Printed from https://ideas.repec.org/a/spr/telsys/v62y2016i3d10.1007_s11235-015-0091-9.html
   My bibliography  Save this article

Estimating the number of competing terminals by cost-reference particle filtering in non-saturated wireless-LAN

Author

Listed:
  • Jaechan Lim

    (Pohang University of Science and Technology)

  • Taejin Kim

    (Sogang University)

  • Daehyoung Hong

    (Sogang University)

Abstract

In IEEE 802.11 systems, the system throughput performance can be enhanced by optimizing the back-off window size based on the number of competing terminals n. Therefore, the information of n is crucial factor for optimal throughput performance in this system. However, estimating n is not an easy task because n varies with unknown statistical patterns. Most of previously proposed approaches additionally adopt a state variation detector in the algorithm, which incurs latency in tracking n. Therefore, we propose cost-reference particle filtering (CRPF) approach which is applied without an additional state variation detector. Consequently, a critical flaw of the detector, i.e. latency which causes highly degraded throughput performance, can be avoided. The proposed method promptly tracks varying n without any latency; therefore, it is highly efficient in non-saturated network condition. By computer simulations, we justify that CRPF is a new state of the art-approach for the investigated problem in terms of the tracking performance.

Suggested Citation

  • Jaechan Lim & Taejin Kim & Daehyoung Hong, 2016. "Estimating the number of competing terminals by cost-reference particle filtering in non-saturated wireless-LAN," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 62(3), pages 519-527, July.
  • Handle: RePEc:spr:telsys:v:62:y:2016:i:3:d:10.1007_s11235-015-0091-9
    DOI: 10.1007/s11235-015-0091-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11235-015-0091-9
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s11235-015-0091-9?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:telsys:v:62:y:2016:i:3:d:10.1007_s11235-015-0091-9. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.