TDMA scheduling in long-distance wifi networks
Name
Panigrahi-2009-TDMA scheduling in long-distance wifi networks.pdf
Size
265.86 KB
Format
Adobe PDF
Checksum (MD5)
f7166e4b1e68d5f1619d4430d8c6906d
Author(s)
Panigrahi, Debmalya
Raman, Bhaskaran
Date Issued
April 2009
Journal
IEEE INFOCOM
Publisher
Institute of Electrical and Electronics Engineers
Citation
Panigrahi, D., and B. Raman. “TDMA Scheduling in Long-Distance WiFi Networks.” INFOCOM 2009, IEEE. 2009. 2931-2935.© 2009, IEEE
Version
Final published version
Abstract
In the last few years, long-distance WiFi networks have been used to provide Internet connectivity in rural areas. The strong requirement to support real-time applications in these settings leads us to consider TDMA link scheduling. In this paper, we consider the FRACTEL architecture for long-distance mesh networks. We propose a novel angular interference model, which is not only practical, but also makes the problem of TDMA scheduling tractable. We then consider delay-bounded scheduling and present an algorithm which uses at most 1/3rd more time-slots than the optimal number of slots required without the delay bound. Our evaluation on various network topologies shows that the algorithm is practical, and more efficient in practice than its worst-case bound.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/INFCOM.2009.5062261
