IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v9y2013i3p174634.html
   My bibliography  Save this article

Amortized Fairness for Drive-Thru Internet

Author

Listed:
  • Zhi Li
  • Limin Sun
  • Xinyun Zhou

Abstract

The drive-thru Internet is an effective mean to provide Internet access service for wireless sensor networks deployed on vehicles. In these networks, vehicles often experience different link qualities due to different relative positions to the access point. This makes fair and efficient system design a very challenging task. In traditional approaches, the network efficiency has to be greatly sacrificed to provide the fair share for vehicles with low link quality. To address this issue, we propose a novel amortized fairness MAC protocol. The basic idea is that vehicles with lower link quality can defer their fairness requests and let the lost fairness be “amortized†in the future when their links become the high quality. The amortized fairness MAC requires predictions of future link quality. For this, we fully exploit the inner and inter-AP correlations revealed from our extensive field studies and design a link quality prediction algorithm. Based on the predicted link quality, we formulate the optimal amortized fairness MAC as a convex programming problem, which can be solved with the desired precision in polynomial time. Extensive simulation on real traces shows that the amortized fairness MAC scheme is more efficient than the existing fairness schemes in terms of efficiency and fairness.

Suggested Citation

  • Zhi Li & Limin Sun & Xinyun Zhou, 2013. "Amortized Fairness for Drive-Thru Internet," International Journal of Distributed Sensor Networks, , vol. 9(3), pages 174634-1746, March.
  • Handle: RePEc:sae:intdis:v:9:y:2013:i:3:p:174634
    DOI: 10.1155/2013/174634
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2013/174634
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2013/174634?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
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:sae:intdis:v:9:y:2013:i:3:p:174634. 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: SAGE Publications (email available below). General contact details of provider: .

    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.