Joint Routing and Scheduling in Multi-hop Wireless Networks with Directional Antennas
Name
Dutta-2010-Joint routing and scheduling in multi-hop wireless networks with directional antennas.pdf
Size
170.16 KB
Format
Adobe PDF
Checksum (MD5)
7e2474f2bee063f6f87b030c21b58b34
Author(s)
Dutta, Partha
Mhatre, Vivek
Rastogi, Rajeev
Panigrahi, Debmalya
Date Issued
May 2010
Journal
IEEE INFOCOM
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Dutta, Partha et al. “Joint Routing and Scheduling in Multi-hop Wireless Networks with Directional Antennas.” IEEE, 2010. 1–5. Web. 5 Apr. 2012.
Version
Final published version
Abstract
Long-distance multi-hop wireless networks have been used in recent years to provide connectivity to rural areas. The salient features of such networks include TDMA channel access, nodes with multiple radios, and point-to-point long-distance wireless links established using high-gain directional antennas mounted on high towers. It has been demonstrated previously that in such network architectures, nodes can transmit concurrently on multiple radios, as well as receive concurrently on multiple radios. However, concurrent transmission on one radio, and reception on another radio causes interference. Under this scheduling constraint, given a set of source-destination demand rates, we consider the problem of satisfying the maximum fraction of each demand (also called the maximum concurrent flow problem). We give a novel joint routing and scheduling scheme for this problem, based on linear programming and graph coloring. We analyze our algorithm theoretically and prove that at least 50% of a satisfiable set of demands is satisfied by our algorithm for most practical networks (with maximum node degree at most 5).
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
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.2010.5462186
