skip to main content
10.1145/1835698.1835731acmconferencesArticle/Chapter ViewAbstractPublication PagespodcConference Proceedingsconference-collections
short-paper

Brief announcement: distributed contention resolution in wireless networks

Published: 25 July 2010 Publication History

Abstract

We present and analyze simple distributed contention resolution protocols for wireless networks. In our setting, one is given n pairs of senders and receivers located in a metric space. Each sender wants to transmit a signal to its receiver at a prespecified power level, e.g., all senders use the same, uniform power level as it is typically implemented in practice. Our analysis is based on the physical model in which the success of a transmission depends on the Signal-to-Interference-plus-Noise-Ratio (SINR). The objective is to minimize the number of time slots until all signals are successfully transmitted.
Our main technical contribution is the introduction of a measure called maximum average affectance enabling us to analyze random contention-resolution algorithms in which each packet is transmitted in each step with a fixed probability depending on the maximum average affectance. We prove that the schedule generated this way is only an O(log2 n) factor longer than the optimal one, provided that the prespecified power levels satisfy natural monontonicity properties. By modifying the algorithm, senders need not to know the maximum average affectance in advance but only static information about the network. In addition, we extend our approach to multi-hop communication achieving the same appoximation factor.

References

[1]
Alexander Fanghänel, Thomas Kesselheim, Harald Räcke, and Berthold Vöcking. Oblivious interference scheduling. In PODC, pages 220--229, 2009.
[2]
Alexander Fanghänel, Thomas Kesselheim, and Berthold Vöcking. Improved algorithms for latency minimization in wireless networks. In ICALP, pages 447--458, 2009.
[3]
Piyush Gupta and P. R. Kumar. The capacity of wireless networks. IEEE Transactions on Information Theory, 46:388--404, 2000.
[4]
Magnús M. Halldórsson. Wireless scheduling with power control. In ESA, pages 361--372, 2009.
[5]
Magnús M. Halldórsson and Roger Wattenhofer. Wireless communication is in APX. In ICALP, pages 525--536, 2009.
[6]
Thomas Moscibroda, Roger Wattenhofer, and Aaron Zollinger. Topology control meets SINR: The scheduling complexity of arbitrary topologies. In Mobihoc, pages 310--321, 2006.

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
PODC '10: Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
July 2010
494 pages
ISBN:9781605588889
DOI:10.1145/1835698

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 25 July 2010

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. distributed scheduling
  2. interference
  3. physical model
  4. sinr
  5. wireless network

Qualifiers

  • Short-paper

Conference

PODC '10
Sponsor:

Acceptance Rates

Overall Acceptance Rate 740 of 2,477 submissions, 30%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 108
    Total Downloads
  • Downloads (Last 12 months)4
  • Downloads (Last 6 weeks)0
Reflects downloads up to 07 Mar 2025

Other Metrics

Citations

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media