Complexity in geometric SINR
Olga Goussevskaia,Yvonne Anne Oswald,Roger Wattenhofer +2 more
- pp 100-109
TLDR
The first NP-completeness proofs in the geometric SINR model, which explicitly uses the fact that nodes are distributed in the Euclidean plane, are presented, which proves two problems to be NP-complete: Scheduling and One-Shot Scheduling.Abstract:
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.read more
Citations
More filters
Proceedings ArticleDOI
Capacity of Arbitrary Wireless Networks
TL;DR: This work proposes the first scheduling algorithm with approximation guarantee independent of the topology of the network, and proves that the analysis of the algorithm is extendable to higher-dimensional Euclidean spaces, and to more realistic bounded-distortion spaces, induced by non-isotropic signal distortions.
Journal ArticleDOI
A Survey of Network Design Problems and Joint Design Approaches in Wireless Mesh Networks
Parth H. Pathak,Rudra Dutta +1 more
TL;DR: The fundamental WMN design problems of interference modeling, power control, topology control, link scheduling, and routing are identified, and brief overviews are provided, together with a survey of the recent research on these topics, with special stress on joint design methods.
Journal ArticleDOI
Modeling Interference in Wireless Ad Hoc Networks
TL;DR: The interference models are presented in this survey from the perspective of the radio capture phenomenon, resulting in a unified view of interference models, which may be helpful when selecting the appropriate model for a given purpose.
Proceedings ArticleDOI
Maximizing Capacity in Arbitrary Wireless Networks in the SINR Model: Complexity and Game Theory
Matthew Andrews,Michael Dinitz +1 more
TL;DR: It is shown that maximizing the number of supported connections is NP-hard, even when there is no background noise, in contrast to the problem of determining whether or not a given set of connections is feasible since that problem can be solved via linear programming.
Journal ArticleDOI
A Survey of Geographical Routing in Wireless Ad-Hoc Networks
TL;DR: This paper aims to provide both a comprehensive and methodical survey of existing literature in the area of geographic routing from its inception as well as acting as an introduction to the subject.
References
More filters
Journal ArticleDOI
The capacity of wireless networks
Piyush Gupta,P. R. Kumar +1 more
TL;DR: When n identical randomly located nodes, each capable of transmitting at W bits per second and using a fixed range, form a wireless network, the throughput /spl lambda/(n) obtainable by each node for a randomly chosen destination is /spl Theta/(W//spl radic/(nlogn)) bits persecond under a noninterference protocol.
Book ChapterDOI
Reducibility Among Combinatorial Problems
TL;DR: The work of Dantzig, Fulkerson, Hoffman, Edmonds, Lawler and other pioneers on network flows, matching and matroids acquainted me with the elegant and efficient algorithms that were sometimes possible.
Proceedings ArticleDOI
Impact of interference on multi-hop wireless network performance
TL;DR: It is shown that the routes derived from the analysis often yield noticeably better throughput than the default shortest path routes even in the presence of uncoordinated packet transmissions and MAC contention, suggesting that there is opportunity for achieving throughput gains by employing an interference-aware routing protocol.
Book ChapterDOI
Critical Power for Asymptotic Connectivity in Wireless Networks
Piyush Gupta,P. R. Kumar +1 more
TL;DR: It is shown that if n nodes are placed in a disc of unit area in !
Journal ArticleDOI
PAMAS—power aware multi-access protocol with signalling for ad hoc networks
TL;DR: A new multiaccess protocol based on the original MACA protocol with the adition of a separate signalling channel that conserves battery power at nodes by intelligently powering off nodes that are not actively transmitting or receiving packets.