(Enter summary)
Abstract: We consider the problem of determining the maximum
capacity of the MAC layer in wireless ad hoc networks.
Due to spatial contention for the shared wireless medium, not
all nodes can concurrently transmit packets to each other in
these networks. The maximum number of possible concurrent
transmissions is therefore an estimate of the maximum network
capacity, and depends on the media access (MAC) protocol being
used. We show that for a large class of MAC protocols based on
virtual carrier sensing... (Update)
Similar documents based on text: More All
0.3: Efficient Spacetime Meshing With Nonlocal - Cone Constraints Shripad
(Correct)
0.2: Spacetime Meshing With Adaptive Coarsening And Refinement - Reza Abedi Shuo-Heng (2003)
(Correct)
0.2: Implementation of a Power-Saving Protocol for Ad Hoc Wireless.. - Jamieson (2002)
(Correct)
BibTeX entry: (Update)
H. Balakrishnan, C. Barrett, V. S. Anil Kumar, M. Marathe, S. Thite. The distance-2 matching problem and its relationship to the MAClayer capacity of ad hoc networks, Los Alamos Technical Report. http://citeseer.ist.psu.edu/703193.html More
@misc{ balakrishnan-distance,
author = "H. Balakrishnan and C. Barrett and V. Kumar and M. Marathe and S. Thite",
title = "The distance-2 matching problem and its relationship to the MAClayer capacity
of ad hoc networks",
text = "H. Balakrishnan, C. Barrett, V. S. Anil Kumar, M. Marathe, S. Thite. The
distance-2 matching problem and its relationship to the MAClayer capacity
of ad hoc networks, Los Alamos Technical Report.",
url = "citeseer.ist.psu.edu/703193.html" }
Citations (may not include all citations):
190
Geography-informed Energy Conservation for Ad Hoc Routing
- Xu, Heidemann et al. - 2001
151
Span: an EnergyEfficient Coordination Algorithm for Topology..
- Chen, Jamieson et al. - 2002
113
IEEE Transactions on Information Theory (context) - Gupta, Kumar et al. - 2000
53
Chernoff-Hoeffding bounds for applications with limited inde..
- Schmidt, Siegel et al. - 1995
38
Simple Heuristics for Unit Disk Graphs
- Marathe, Breu et al. - 1995
36
NC-Approximation Schemes for NP- and PSPACE-Hard Problems fo..
- Marathe, Radhakrishnan et al. - 1998
24
Distributed Computing: a locality sensitive approach (context) - Peleg - 2000
18
Polynomial-Time Approximation Schemes for Geometric Graphs
- Erlebach, Jansen et al. - 2001
16
the Maximum Stable Throughput Problem in Random Networks wit..
- Peraki, Servetto - 2003
9
New Results on Induced Matchings (context) - Golumbic, Lewenstein - 2000
8
NP-Completeness of Some Generalizations of the Maximum Match.. (context) - Stockmeyer, Vazirani - 1982
8
Models and approximation algorithms for channel assignment i..
- Krumke, Marathe et al. - 2001
5
DMA Channel Assignment in Wireless Networks (context) - Ramanathan, Framework et al. - 1997
2
End-to-End Packet Scheduling in Wireless Ad-hoc Networks (context) - Kumar, Marathe et al. - 2004
2
The strong chromatic index of graphs (context) - Mahdian - 2000
[Article contains additional citations not shown here]
Documents on the same site (http://compgeom.cs.uiuc.edu/~thite/pubs/index.html): More
Efficient Spacetime Meshing With Nonlocal - Cone Constraints Shripad (2004)
(Correct)
Marketecture: A Simulation-Based Framework for.. - Atkins, Barrett.. (2004)
(Correct)
Efficient Spacetime Meshing With Nonlocal Cone Constraints - Je Erickson Robert (2003)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC