Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Poster abstract: measuring multi-parameter conflict graphs for 802.11 networks

Poster abstract: measuring multi-parameter conflict graphs for 802.11 networks Poster Abstract: Measuring Multi-Parameter Con ‚ict Graphs for 802.11 Networks Nabeel Ahmed, Usman Ismail, Srinivasan Keshav {n3ahmed, uismail, keshav}@cs.uwaterloo.ca School Konstantina Papagiannaki ¡ dina.papagiannaki@intel.com of Computer Science, University of Waterloo, ON, Canada ¡ Intel Research, Pittsburgh, PA, U.S.A I. Introduction Dropping prices and increasing demand for a mobile workforce have caused a proliferation of wireless LANs in modern enterprises. In an attempt to increase wireless capacity and provide complete coverage, enterprises are turning to dense deployments of access points (APs). Unfortunately, APs on the same channel that ˜share the air ™ are interference-limited, due to hidden and exposed terminals. Thus, increasing AP density can, paradoxically, reduce aggregate throughput. Proposals aiming to mitigate RF interference in 802.11 networks, such as dynamic frequency selection, power control, and traf c scheduling [1] assume the existence of a con ‚ict graph (CG) as input. A con ‚ict graph is a data structure that encodes interference information between links in the network. Speci cally, for each link, it lists the set of other links which could cause interference either at the transmitter or receiver of the link. Note that the existence of a con ‚ict edge between two links in a CG is http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM SIGMOBILE Mobile Computing and Communications Review Association for Computing Machinery

Poster abstract: measuring multi-parameter conflict graphs for 802.11 networks

Loading next page...
 
/lp/association-for-computing-machinery/poster-abstract-measuring-multi-parameter-conflict-graphs-for-802-11-6aChHs8qzQ

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Association for Computing Machinery
Copyright
The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc.
ISSN
1559-1662
DOI
10.1145/1710130.1710142
Publisher site
See Article on Publisher Site

Abstract

Poster Abstract: Measuring Multi-Parameter Con ‚ict Graphs for 802.11 Networks Nabeel Ahmed, Usman Ismail, Srinivasan Keshav {n3ahmed, uismail, keshav}@cs.uwaterloo.ca School Konstantina Papagiannaki ¡ dina.papagiannaki@intel.com of Computer Science, University of Waterloo, ON, Canada ¡ Intel Research, Pittsburgh, PA, U.S.A I. Introduction Dropping prices and increasing demand for a mobile workforce have caused a proliferation of wireless LANs in modern enterprises. In an attempt to increase wireless capacity and provide complete coverage, enterprises are turning to dense deployments of access points (APs). Unfortunately, APs on the same channel that ˜share the air ™ are interference-limited, due to hidden and exposed terminals. Thus, increasing AP density can, paradoxically, reduce aggregate throughput. Proposals aiming to mitigate RF interference in 802.11 networks, such as dynamic frequency selection, power control, and traf c scheduling [1] assume the existence of a con ‚ict graph (CG) as input. A con ‚ict graph is a data structure that encodes interference information between links in the network. Speci cally, for each link, it lists the set of other links which could cause interference either at the transmitter or receiver of the link. Note that the existence of a con ‚ict edge between two links in a CG is

Journal

ACM SIGMOBILE Mobile Computing and Communications ReviewAssociation for Computing Machinery

Published: Jan 21, 2010

There are no references for this article.