Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints
Deepti Chafekar,V.S.A. Kumart,Madhav V. Marathe,Srinivasan Parthasarathy,Aravind Srinivasan +4 more
- pp 1166-1174
TLDR
This paper develops polynomial time algorithms to provably approximate the total throughput in this setting of the capacity estimation problem using the more general Signal to Interference Plus Noise Ratio model for interference, on arbitrary wireless networks.Abstract:
A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which data can be sent on these connections. Most of the research in this direction has focused on either random distributions of points, or has assumed simple graph-based models for wireless interference. In this paper, we study capacity estimation problem using the more general Signal to Interference Plus Noise Ratio (SINR) model for interference, on arbitrary wireless networks. The problem becomes much harder in this setting, because of the non-locality of the SINR model. Recent work by Moscibroda et al. (2006) has shown that the throughput in this model can differ from graph based models significantly. We develop polynomial time algorithms to provably approximate the total throughput in this setting.read more
Citations
More filters
Dissertation
Modèles probabilistes et statistiques pour la conception et l'analyse des systèmes de communications
TL;DR: The main aim of the study is to identify which of the proposed mechanisms outperforms CSMA best depending on the scenario, and to address the problem of lack of QoS in CSMA.
Book ChapterDOI
Exploiting Geometry in the SINR\(_k\) Model
TL;DR: An \(O(1))-approximation algorithm for the scheduling problem (under the SINR\(_k\) model) is presented and a PTAS for the maximum capacity problem is presented, obtaining a constant of approximation which is considerably better than those obtained under the SinR model.
Proceedings ArticleDOI
A maximum dispersion approach for rate feasibility problems in SINR model
TL;DR: This paper proposes a maximum dispersion based approach for the problem of determining the feasibility of a set of single-hop rates in SINR model and confirms that such an approach performs significantly better than the existing work.
Proceedings ArticleDOI
Delay Efficient D2D Communications Over 5G Edge-Computing Mobile Networks with Power Control
TL;DR: In this paper , an approximation algorithm under the duty-cycled model is proposed to address the above challenges with theoretically proved the approximation factor which could independent of the period length under the Duty-Cycle model.
Proceedings ArticleDOI
Link Scheduling in Cooperative Communication with SINR-Based Interference
Chenxi Qiu,Haiying Shen +1 more
TL;DR: Simulation results indicate that the cooperative link scheduling approaches outperform non-cooperative ones.
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.
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.
Proceedings ArticleDOI
Joint channel assignment and routing for throughput optimization in multi-radio wireless mesh networks
TL;DR: A solution is developed that optimizes the overall network throughput subject to fairness constraints on allocation of scarce wireless capacity among mobile clients, and the performance of the algorithms is within a constant factor of that of any optimal algorithm for the joint channel assignment and routing problem.
Proceedings ArticleDOI
Characterizing the capacity region in multi-radio multi-channel wireless mesh networks
TL;DR: This paper provides necessary conditions to verify the feasibility of rate vectors in next generation fixed wireless broadband networks, and uses them to derive upper bounds on the capacity in terms of achievable throughput, using a fast primal-dual algorithm.
Journal ArticleDOI
Joint Channel Assignment and Routing for Throughput Optimization in Multiradio Wireless Mesh Networks
TL;DR: A solution is developed that optimizes the overall network throughput subject to fairness constraints on allocation of scarce wireless capacity among mobile clients, and the performance of the algorithms is within a constant factor of that of any optimal algorithm for the joint channel assignment and routing problem.