# Bandwidth partitioning in decentralized wireless networks

@article{Jindal2008BandwidthPI, title={Bandwidth partitioning in decentralized wireless networks}, author={Nihar Jindal and Jeffrey G. Andrews and Steven P. Weber}, journal={IEEE Transactions on Wireless Communications}, year={2008}, volume={7} }

This paper addresses the following question, which is of interest in the design of a multiuser decentralized network. Given a total system bandwidth of W Hz and a fixed data rate constraint of R bps for each transmission, how many frequency slots N of size W/N should the band be partitioned into in order to maximize the number of simultaneous links in the network? Dividing the available spectrum results in two competing effects. On the positive side, a larger N allows for more parallel, non…

## 92 Citations

On the Throughput Maximization in Dencentralized Wireless Networks

- Computer Science, MathematicsArXiv
- 2008

It is proved that when the number of links is large, the optimum power allocation strategy for each user is the threshold-based on-off power scheme, and the maximum achievable network throughput is achieved at M = 1.

On the benefits of bandwidth limiting in decentralized vector multiple access channels

- Computer Science, Mathematics2009 4th International Conference on Cognitive Radio Oriented Wireless Networks and Communications
- 2009

This work shows the existence of an optimal number of dimensions that a transmitter must use in order to maximize the network performance measured in terms of spectral efficiency, and provides a closed form expression for this optimum point.

Virtual Cooperation for Throughput Maximization in Distributed Large-Scale Wireless Networks

- Computer ScienceEURASIP J. Adv. Signal Process.
- 2011

The main goal is to find the maximum network throughput in the asymptotic regime of , which is achieved by proposing a distributed power allocation strategy and choosing the optimum value for .

A model for randomized resource allocation in decentralized wireless networks

- Mathematics, Computer ScienceArXiv
- 2009

This paper proposes a randomized Frequency Hopping scheme in which each transmitter randomly hops over a subset of frequency sub-bands from transmission to transmission and shows that (depending on the probability mass function of the number of active users) the FH system can offer a significant improvement implying a more efficient usage of the spectrum.

Throughput maximization over frequency-selective communication networks

- Computer Science2015 IEEE Wireless Communications and Networking Conference (WCNC)
- 2015

From the simulations, it is shown that the optimal solution obtained through the theoretical analysis is consistent with the one obtained through exhaustive search, and an iterative resource allocation algorithm with low complexity is derived.

Randomized Resource Allocation in Decentralized Wireless Networks

- Mathematics, Computer ScienceIEEE Transactions on Information Theory
- 2011

Developing a new upper bound on the differential entropy of a mixed Gaussian random vector and using entropy power inequality, lower bounds are obtained on the maximum transmission rate per user to ensure a specified outage probability at a given SNR level.

Randomized vs. orthogonal spectrum allocation in decentralized networks: Outage Analysis

- Mathematics, Computer ScienceArXiv
- 2009

It is demonstrated that the so-called outage capacity can be considerably higher in the FH scheme than in the Frequency Division (FD) scenario for reasonable distributions on the number of active users.

On the performance of wireless ad hoc networks using bandwidth partitioning

- Computer ScienceWirel. Networks
- 2019

An hoc network where nodes are assumed to be distributed uniformly in space, according to a 2-D Poisson point process (PPP), and packets arrive at each transmitter according to an 1-D temporal PPP is considered, illustrating how the ’right’ number of subbands can improve the performance, compared to a random number ofSubbands.

Spatial Transmitter Density Allocation for Frequency-Selective Wireless Ad Hoc Networks

- Computer ScienceIEEE Transactions on Wireless Communications
- 2019

It is shown that the optimal solution obtained through the theoretical analysis is consistent with the one obtained through an exhaustive search, which reveals that the outage probability and the total spatial transmitter density are the keys to determining the network TC.

Access Point Density and Bandwidth Partitioning in Ultra Dense Wireless Networks

- Computer Science, MathematicsIEEE Transactions on Communications
- 2014

The user rate distribution is obtained analytically, taking into account the effects of multiple access as well as the SIR outage, and it is shown that user rate outage probability is dependent on the number of bandwidth partitions and the way they are utilized by the multiple access scheme.

## References

SHOWING 1-10 OF 39 REFERENCES

Optimizing the SINR operating point of spatial networks

- Mathematics, Computer ScienceArXiv
- 2007

Stochastic geometry is used to derive the optimal SINR threshold (which directly corresponds to the optimal spectral efficiency) on this tradeoff curve and show that it is a function of only the path loss exponent.

Bandwidth-SINR Tradeoffs in Spatial Networks

- Computer Science2007 IEEE International Symposium on Information Theory
- 2007

Using stochastic geometry, the optimal SINR threshold is derived and it is shown that it is a function of only the path loss exponent and lies between the low-SINR (power-limited) and high-SinR (bandwidth-limited] regimes.

Bandwidth- and power-efficient routing in linear wireless networks

- Computer ScienceIEEE Transactions on Information Theory
- 2006

A scheme based upon backward decoding that can remove all interference from the multihop system with an arbitrarily small rate loss is presented, and this new scheme is also used to demonstrate that rates of O(logN) are achievable over linear wireless networks even without synchronous cooperation.

Spectrum Sharing Between Wireless Networks

- Computer Science, MathematicsIEEE/ACM Transactions on Networking
- 2008

This work considers the problem of two wireless networks operating on the same (presumably unlicensed) frequency band and demonstrates via simulations that in certain environments, rival wireless networks may end up naturally cooperating.

Transmission capacity of wireless ad hoc networks with outage constraints

- Mathematics, Computer ScienceIEEE Transactions on Information Theory
- 2005

Upper and lower bounds on the transmission capacity of spread-spectrum (SS) wireless ad hoc networks are derived and it can be shown that FH-CDMA obtains a higher transmission capacity on the order of M/sup 1-2//spl alpha//, where M is the spreading factor and /spl alpha/>2 is the path loss exponent.

On the Optimal SINR in Random Access Networks with Spatial Reuse

- Computer Science2006 40th Annual Conference on Information Sciences and Systems
- 2006

A simple model for a homogeneous random access system with spatial reuse is considered, finding that the optimal SINR threshold for packet detection is considerably smaller than that used in many current systems, and the optimal distance between transmitters and intended receivers is larger than would be expected from prevailing conventional wisdom.

Fractional power control for decentralized wireless networks

- Computer Science, MathematicsIEEE Transactions on Wireless Communications
- 2008

It is proved that using an exponent of s* = 1/2 minimizes the outage probability, meaning that the inverse square root of the channel strength is a sensible transmit power scaling for networks with a relatively low density of interferers.

The Effect of Fading, Channel Inversion, and Threshold Scheduling on Ad Hoc Networks

- Computer Science, MathematicsIEEE Transactions on Information Theory
- 2007

A threshold-based transmission rule is developed where transmitters are active only if the channel to their receiver is acceptably strong, obtain expressions for the optimal threshold, and show that this simple, fully distributed scheme can significantly reduce the effect of fading.

Allocating dynamic time-spectrum blocks in cognitive radio networks

- Computer ScienceMobiHoc '07
- 2007

This paper introduces the concept of a time-spectrum block to model spectrum reservation, and uses it to present a theoretical formalization of the spectrum allocation problem in cognitive radio networks.

Optimum Transmission Ranges in a Direct-Sequence Spread-Spectrum Multihop Packet Radio Network

- Computer ScienceIEEE J. Sel. Areas Commun.
- 1990

The authors obtain the optimum transmission ranges to maximize throughput for a direct-sequence spread-spectrum multihop packet radio network. In the analysis, they model the network…