Skip to content
Free planNo credit card requiredStart writing

article · 2008

COMPLEXITY—Tradeoffs between Complexity Measures General Terms

V. S. Anil Kumar, Virginia Bio-informatics, Srinivasan Parthasarathy, Madhav V. Marathe, Virginia Bio-informatics, Aravind Srinivasan

Cited by 0Abstract and details only

Abstract

Given a wireless network and a collection of source-destination pairs {(si, ti)}, what is the maximum end-to-end rate (throughput) at which the network can transfer data from the sources to their corresponding destinations? The problem is nontrivial to solve in the case of wireless networks due to interference. It is additionally complicated when taking into account TCP like transport protocols. Here, we present near-optimal provably good polynomialtime routing and scheduling algorithms for solving these and other throughput maximization problems in wireless ad hoc networks. We also present distributed algorithms for simultaneously optimizing a large class of throughput related objectives with fixed routes and schedules. We consider a wide variety of conflict-graph based models with both primary and secondary wireless interference constraints. Our techniques can accommodate a variety of routing constraints such as low energy, low hop-count, etc. as well as incorporate wireless technologies such as multiple channels and directional antennas. Categories and Subject Descriptors

Cite this paper

APA 7

Kumar, V. S. A., Bio-informatics, V., Parthasarathy, S., Marathe, M. V., Bio-informatics, V., & Srinivasan, A. (2008). COMPLEXITY—Tradeoffs between Complexity Measures General Terms.

MLA 9

Kumar, V. S. Anil, et al. “COMPLEXITY—Tradeoffs between Complexity Measures General Terms.” 2008.

Chicago

Kumar, V. S. Anil, Virginia Bio-informatics, Srinivasan Parthasarathy, Madhav V. Marathe, Virginia Bio-informatics, and Aravind Srinivasan. 2008. “COMPLEXITY—Tradeoffs between Complexity Measures General Terms.”

Harvard

Kumar, V.S.A. et al. (2008) ‘COMPLEXITY—Tradeoffs between Complexity Measures General Terms’.

BibTeX
@article{kumar2008complexity,
  title = {{COMPLEXITY—Tradeoffs between Complexity Measures General Terms}},
  author = {Kumar, V. S. Anil and Bio-informatics, Virginia and Parthasarathy, Srinivasan and Marathe, Madhav V. and Bio-informatics, Virginia and Srinivasan, Aravind},
  year = {2008}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.