Scheduling algorithms for multihop radio networks
IEEE/ACM Transactions on Networking (TON)
Joint optimal channel base station and power assignment for wireless access
IEEE/ACM Transactions on Networking (TON)
NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs
Journal of Algorithms
PAMAS—power aware multi-access protocol with signalling for ad hoc networks
ACM SIGCOMM Computer Communication Review
Comparison between graph-based and interference-based STDMA scheduling
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Impact of interference on multi-hop wireless network performance
Proceedings of the 9th annual international conference on Mobile computing and networking
End-to-end packet-scheduling in wireless ad-hoc networks
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Coloring unstructured radio networks
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Topology control meets SINR: the scheduling complexity of arbitrary topologies
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Proceedings of the 12th annual international conference on Mobile computing and networking
On the complexity of scheduling in wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking
Rate Allocation and Admission Control for Differentiated Services in CDMA Data Networks
IEEE Transactions on Mobile Computing
The worst-case capacity of wireless sensor networks
Proceedings of the 6th international conference on Information processing in sensor networks
Cross-Layer Design for Power Efficiency and QoS Provisioning in Multi-Hop Wireless Networks
IEEE Transactions on Wireless Communications
The capacity of wireless networks
IEEE Transactions on Information Theory
Wireless Link Scheduling With Power Control and SINR Constraints
IEEE Transactions on Information Theory
Link scheduling in polynomial time
IEEE Transactions on Information Theory - Part 1
Optimal power control, scheduling, and routing in UWB networks
IEEE Journal on Selected Areas in Communications
Computing and communicating functions over sensor networks
IEEE Journal on Selected Areas in Communications
Efficient Resource Allocation and Paving the Way Towards Highly Efficient IMT-Advanced Systems
Wireless Personal Communications: An International Journal
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Complexity of scheduling with analog network coding
Proceedings of the 1st ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing
Exact and approximate link scheduling algorithms under the physical interference model
Proceedings of the fifth international workshop on Foundations of mobile computing
A measurement study of interference modeling and scheduling in low-power wireless networks
Proceedings of the 6th ACM conference on Embedded network sensor systems
Facets of the Fully Mixed Nash Equilibrium Conjecture
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Interference Games in Wireless Networks
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Link Scheduling in Local Interference Models
Algorithmic Aspects of Wireless Sensor Networks
Wireless link scheduling under a graded SINR interference model
Proceedings of the 2nd ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing
Proceedings of the 2nd ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing
Wireless Communication Is in APX
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
SINR diagrams: towards algorithmically usable SINR models of wireless networks
Proceedings of the 28th ACM symposium on Principles of distributed computing
Brief announcement: distributed algorithms for approximating wireless network capacity
Proceedings of the 28th ACM symposium on Principles of distributed computing
Scheduling partition for order optimal capacity in large-scale wireless networks
Proceedings of the 15th annual international conference on Mobile computing and networking
Maximum Independent Set of Links under Physical Interference Model
WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
Energy-optimal distributed algorithms for minimum spanning trees
IEEE Journal on Selected Areas in Communications - Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks
PHY-aware distributed scheduling for ad hoc communications with physical interference model
IEEE Transactions on Wireless Communications
Labels, routing, and capacity: bringing theoretical networking closer to practice
INFOCOM'09 Proceedings of the 28th IEEE international conference on Computer Communications Workshops
Sensor networks continue to puzzle: selected open problems
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Online capacity maximization in wireless networks
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Localized scheduling for practical and optimal capacity utilization in large wireless networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
A simple greedy algorithm for link scheduling with the physical interference model
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Structure and algorithms in the SINR wireless model
ACM SIGACT News
Distributed algorithms for approximating wireless network capacity
INFOCOM'10 Proceedings of the 29th conference on Information communications
Topology control for effective interference cancellation in multi-user MIMO networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Effective carrier sensing in CSMA networks under cumulative interference
INFOCOM'10 Proceedings of the 29th conference on Information communications
CSMA-based distributed scheduling in multi-hop MIMO networks under SINR model
INFOCOM'10 Proceedings of the 29th conference on Information communications
Minimum-latency aggregation scheduling in wireless sensor networks under physical interference model
Proceedings of the 13th ACM international conference on Modeling, analysis, and simulation of wireless and mobile systems
Maximum weighted independent set of links under physical interference model
WASA'10 Proceedings of the 5th international conference on Wireless algorithms, systems, and applications
Distributed contention resolution in wireless networks
DISC'10 Proceedings of the 24th international conference on Distributed computing
Connectivity problem in wireless networks
DISC'10 Proceedings of the 24th international conference on Distributed computing
Fast algorithms for joint power control and scheduling in wireless networks
IEEE Transactions on Wireless Communications
Broadcasting in sensor networks of unknown topology in the presence of swamping
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Scheduling multicast transmissions under SINR constraints
ALGOSENSORS'10 Proceedings of the 6th international conference on Algorithms for sensor systems, wireless adhoc networks, and autonomous mobile entities
Efficiency of Wireless Networks: Approximation Algorithms for the Physical Interference Model
Foundations and Trends® in Networking
Approximation algorithms for wireless link scheduling with SINR-based interference
IEEE/ACM Transactions on Networking (TON)
multi-channel assignment for communication in radio networks
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
Maximizing capacity with power control under physical interference model in simplex mode
WASA'11 Proceedings of the 6th international conference on Wireless algorithms, systems, and applications
Capacity of wireless networks under SINR interference constraints
Wireless Networks
Topology control and channel assignment in lossy wireless sensor networks
Proceedings of the 23rd International Teletraffic Congress
Minimum latency data aggregation in the physical interference model
Proceedings of the 14th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Energy efficient spatial TDMA scheduling in wireless networks
Computers and Operations Research
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
A greedy link scheduler for wireless networks with Gaussian multiple-access and broadcast channels
IEEE/ACM Transactions on Networking (TON)
Distributed ($#916;+1)-coloring in the physical model
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
Real-Time video streaming in multi-hop wireless static ad hoc networks
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
Multi-hop routing and scheduling in wireless networks in the SINR model
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
On the capacity of oblivious powers
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
Low-complexity scheduling for wireless networks
Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
SINR Diagrams: Convexity and Its Applications in Wireless Networks
Journal of the ACM (JACM)
Deterministic distributed data aggregation under the SINR model
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
A note on uniform power connectivity in the physical signal to interference plus noise (SINR) model
Theoretical Computer Science
Minimum latency aggregation scheduling for arbitrary tree topologies under the SINR model
ADHOC-NOW'12 Proceedings of the 11th international conference on Ad-hoc, Mobile, and Wireless Networks
Minimum latency data aggregation in the physical interference model
Computer Communications
Wireless scheduling with power control
ACM Transactions on Algorithms (TALG)
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Online capacity maximization in wireless networks
Journal of Scheduling
Adaptive energy-efficient scheduling for hierarchical wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Brief announcement: locality in wireless scheduling
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
Broadcasting in logarithmic time for ad hoc network nodes on a line using mimo
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
Topology control for effective interference cancellation in multiuser MIMO networks
IEEE/ACM Transactions on Networking (TON)
Constant-approximation for optimal data aggregation with physical interference
Journal of Global Optimization
Distributed CSMA algorithms for link scheduling in multihop MIMO networks under SINR model
IEEE/ACM Transactions on Networking (TON)
Maximum independent set of links with a monotone and sublinear power assignment
WASA'13 Proceedings of the 8th international conference on Wireless Algorithms, Systems, and Applications
| Hi-index | 0.00 |
In this paper we study the problem of scheduling wireless links in the geometric SINR model, which explicitly uses the fact that nodes are distributed in the Euclidean plane. We present the first NP-completeness proofs in such a model. In particular, we prove two problems to be NP-complete: Scheduling and One-Shot Scheduling. The first problem consists in finding a minimum-length schedule for a given set of links. The second problem receives a weighted set of links as input and consists in finding a maximum-weight subset of links to be scheduled simultaneously in one shot. In addition to the complexity proofs, we devise an approximation algorithm for each problem.