The power of oblivious wireless power

DOI10.1137/15M1023348zbMATH Open1371.68021arXiv1210.3371OpenAlexW2733091665MaRDI QIDQ5269826FDOQ5269826

Pradipta Mitra, Roger Wattenhofer, Stephan Holzer, Magnús M. Halldórsson

Publication date: 28 June 2017

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Abstract: We study a fundamental measure for wireless interference in the SINR model known as (weighted) inductive independence. This measure characterizes the effectiveness of using oblivious power --- when the power used by a transmitter only depends on the distance to the receiver --- as a mechanism for improving wireless capacity. We prove optimal bounds for inductive independence, implying a number of algorithmic applications. An algorithm is provided that achieves --- due to existing lower bounds --- capacity that is asymptotically best possible using oblivious power assignments. Improved approximation algorithms are provided for a number of problems for oblivious power and for power control, including distributed scheduling, connectivity, secondary spectrum auctions, and dynamic packet scheduling.

Full work available at URL: https://arxiv.org/abs/1210.3371

Recommendations

• The power of non-uniform wireless power
• Wireless capacity with oblivious power in general metrics
• The price of local power control in wireless scheduling
• Wireless Scheduling with Power Control
• Wireless scheduling with power control

zbMATH Keywords

approximation algorithmsSINR modelpower controlwireless communicationinductive independencewireless capacityoblivious power

Mathematics Subject Classification ID

Randomized algorithms (68W20) Communication theory (94A05) Approximation algorithms (68W25) Network design and communication in computer systems (68M10)

Cites Work

• Dynamic packet scheduling in wireless networks
• How Well Can Graphs Represent Wireless Interference?
• Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
• Nearly optimal bounds for distributed wireless scheduling in the SINR model
• Approximation Algorithms for Wireless Link Scheduling with Flexible Data Rates
• Wireless scheduling with power control
• Distributed connectivity of wireless networks
• Distributed Contention Resolution in Wireless Networks
• Wireless Communication Is in APX
• The capacity of wireless networks
• Oblivious interference scheduling
• Improved Algorithms for Latency Minimization in Wireless Networks
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Power of Non-Uniform Wireless Power
• Approximations of Weighted Independent Set and Hereditary Subset Problems
• Vertex coloring edge-weighted digraphs
• (Incremental) priority algorithms
• The topology of wireless communication
• Broadcast in the Ad Hoc SINR Model
• Elimination graphs
• On Some Bounds on the Optimum Schedule Length in the SINR Model
• On the impact of geometry on ad hoc communication in wireless networks
• Jamming-Resistant Learning in Wireless Networks
• Beyond geometry
• The Price of Local Power Control in Wireless Scheduling
• Title not available (Why is that?)

Cited In (3)

• Spanning Trees With Edge Conflicts and Wireless Connectivity
• Effective Wireless Scheduling via Hypergraph Sketches
• Network design under general wireless interference

This page was built for publication: The power of oblivious wireless power

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5269826)