3,057 research outputs found
Communication Over a Wireless Network With Random Connections
A network of nodes in which pairs communicate over a shared wireless medium is analyzed. We consider the maximum total aggregate traffic flow possible as given by the number of users multiplied by their data rate. The model in this paper differs substantially from the many existing approaches in that the channel connections in this network are entirely random: rather than being governed by geometry and a decay-versus-distance law, the strengths of the connections between nodes are drawn independently from a common distribution. Such a model is appropriate for environments where the first-order effect that governs the signal strength at a receiving node is a random event (such as the existence of an obstacle), rather than the distance from the transmitter. It is shown that the aggregate traffic flow as a function of the number of nodes n is a strong function of the channel distribution. In particular, for certain distributions the aggregate traffic flow is at least n/(log n)^d for some d≫0, which is significantly larger than the O(sqrt n) results obtained for many geometric models. The results provide guidelines for the connectivity that is needed for large aggregate traffic. The relation between the proposed model and existing distance-based models is shown in some cases
Aggregate Interference Modeling in Cognitive Radio Networks with Power and Contention Control
In this paper, we present an interference model for cognitive radio (CR)
networks employing power control, contention control or hybrid power/contention
control schemes. For the first case, a power control scheme is proposed to
govern the transmission power of a CR node. For the second one, a contention
control scheme at the media access control (MAC) layer, based on carrier sense
multiple access with collision avoidance (CSMA/CA), is proposed to coordinate
the operation of CR nodes with transmission requests. The probability density
functions of the interference received at a primary receiver from a CR network
are first derived numerically for these two cases. For the hybrid case, where
power and contention controls are jointly adopted by a CR node to govern its
transmission, the interference is analyzed and compared with that of the first
two schemes by simulations. Then, the interference distributions under the
first two control schemes are fitted by log-normal distributions with greatly
reduced complexity. Moreover, the effect of a hidden primary receiver on the
interference experienced at the receiver is investigated. It is demonstrated
that both power and contention controls are effective approaches to alleviate
the interference caused by CR networks. Some in-depth analysis of the impact of
key parameters on the interference of CR networks is given via numerical
studies as well.Comment: 24 pages, 8 figures, submitted to IEEE Trans. Communications in July
201
Joint Pilot Design and Uplink Power Allocation in Multi-Cell Massive MIMO Systems
This paper considers pilot design to mitigate pilot contamination and provide
good service for everyone in multi-cell Massive multiple input multiple output
(MIMO) systems. Instead of modeling the pilot design as a combinatorial
assignment problem, as in prior works, we express the pilot signals using a
pilot basis and treat the associated power coefficients as continuous
optimization variables. We compute a lower bound on the uplink capacity for
Rayleigh fading channels with maximum ratio detection that applies with
arbitrary pilot signals. We further formulate the max-min fairness problem
under power budget constraints, with the pilot signals and data powers as
optimization variables. Because this optimization problem is non-deterministic
polynomial-time hard due to signomial constraints, we then propose an algorithm
to obtain a local optimum with polynomial complexity. Our framework serves as a
benchmark for pilot design in scenarios with either ideal or non-ideal
hardware. Numerical results manifest that the proposed optimization algorithms
are close to the optimal solution obtained by exhaustive search for different
pilot assignments and the new pilot structure and optimization bring large
gains over the state-of-the-art suboptimal pilot design.Comment: 16 pages, 8 figures. Accepted to publish at IEEE Transactions on
Wireless Communication
Achievable Throughput in Two-Scale Wireless Networks
We propose a new model of wireless networks which we refer to as "two-scale networks." At a local scale, characterised by nodes being within a distance r, channel strengths are drawn independently and identically from a distance-independent distribution. At a global scale, characterised by nodes being further apart from each other than a distance r, channel connections are governed by a Rayleigh distribution, with the power satisfying a distance-based decay law. Thus, at a local scale, channel strengths are determined primarily by random effects such as obstacles and scatterers whereas at the global scale channel strengths depend on distance.
For such networks, we propose a hybrid communications scheme, combining elements of distance-dependent networks and random networks. For particular classes of two-scale networks with N nodes, we show that an aggregate throughput that is slightly sublinear in N, for instance, of the form N/ log^4 N is achievable. This offers a significant improvement over a throughput scaling behaviour of O(√N) that is obtained in other work
- …