Distributed Game Theoretic Optimization and Management of Multichannel ALOHA Networks

The problem of distributed rate maximization in multi-channel ALOHA networks is considered. First, we study the problem of constrained distributed rate maximization, where user rates are subject to total transmission probability constraints. We propose a best-response algorithm, where each user updates its strategy to increase its rate according to the channel state information and the current channel utilization. We prove the convergence of the algorithm to a Nash equilibrium in both homogeneous and heterogeneous networks using the theory of potential games. The performance of the best-response dynamic is analyzed and compared to a simple transmission scheme, where users transmit over the channel with the highest collision-free utility. Then, we consider the case where users are not restricted by transmission probability constraints. Distributed rate maximization under uncertainty is considered to achieve both efficiency and fairness among users. We propose a distributed scheme where users adjust their transmission probability to maximize their rates according to the current network state, while maintaining the desired load on the channels. We show that our approach plays an important role in achieving the Nash bargaining solution among users. Sequential and parallel algorithms are proposed to achieve the target solution in a distributed manner. The efficiencies of the algorithms are demonstrated through both theoretical and simulation results.Comment: 34 pages, 6 figures, accepted for publication in the IEEE/ACM Transactions on Networking, part of this work was presented at IEEE CAMSAP 201

Deploy-As-You-Go Wireless Relay Placement: An Optimal Sequential Decision Approach using the Multi-Relay Channel Model

We use information theoretic achievable rate formulas for the multi-relay channel to study the problem of as-you-go deployment of relay nodes. The achievable rate formulas are for full-duplex radios at the relays and for decode-and-forward relaying. Deployment is done along the straight line joining a source node and a sink node at an unknown distance from the source. The problem is for a deployment agent to walk from the source to the sink, deploying relays as he walks, given that the distance to the sink is exponentially distributed with known mean. As a precursor, we apply the multi-relay channel achievable rate formula to obtain the optimal power allocation to relays placed along a line, at fixed locations. This permits us to obtain the optimal placement of a given number of nodes when the distance between the source and sink is given. Numerical work suggests that, at low attenuation, the relays are mostly clustered near the source in order to be able to cooperate, whereas at high attenuation they are uniformly placed and work as repeaters. We also prove that the effect of path-loss can be entirely mitigated if a large enough number of relays are placed uniformly between the source and the sink. The structure of the optimal power allocation for a given placement of the nodes, then motivates us to formulate the problem of as-you-go placement of relays along a line of exponentially distributed length, and with the exponential path-loss model, so as to minimize a cost function that is additive over hops. The hop cost trades off a capacity limiting term, motivated from the optimal power allocation solution, against the cost of adding a relay node. We formulate the problem as a total cost Markov decision process, establish results for the value function, and provide insights into the placement policy and the performance of the deployed network via numerical exploration.Comment: 21 pages. arXiv admin note: substantial text overlap with arXiv:1204.432

Sequential Hybrid Beamforming Design for Multi-Link mmwave Communication

In this paper, we propose a sequential hybrid beamforming design for multi-link transmission over mmwave frequency bands. As a starting point, a baseline data communication link is established via traditional analog beamforming at both the BS and UE. If an extra RF chain is available at the UE, it can continue to probe the propagation environment at the same frequencies. In case the environment is favorable and system resources allow, a secondary data communication link is established to enable multi-stream transmission. In principle, the secondary link could be served by the same BS and/or one or several other BS(s). To initialize the secondary data communication link, a parallel beam search scheme is proposed, which helps the UE/BS to find a suitable beam pair with given optimization criteria without interrupting the baseline data communication. By applying the proposed two-step approach, hybrid beamforming becomes an add-on feature that can be easily switched on over an analog beamforming enabled system without interrupting its operation whenever system requires. Meanwhile, the information obtained by deploying the proposed parallel beam search scheme can also be used for deciding a back-up beam pair if signal blockage occurs to the baseline data communication link

Beamspace Aware Adaptive Channel Estimation for Single-Carrier Time-varying Massive MIMO Channels

In this paper, the problem of sequential beam construction and adaptive channel estimation based on reduced rank (RR) Kalman filtering for frequency-selective massive multiple-input multiple-output (MIMO) systems employing single-carrier (SC) in time division duplex (TDD) mode are considered. In two-stage beamforming, a new algorithm for statistical pre-beamformer design is proposed for spatially correlated time-varying wideband MIMO channels under the assumption that the channel is a stationary Gauss-Markov random process. The proposed algorithm yields a nearly optimal pre-beamformer whose beam pattern is designed sequentially with low complexity by taking the user-grouping into account, and exploiting the properties of Kalman filtering and associated prediction error covariance matrices. The resulting design, based on the second order statistical properties of the channel, generates beamspace on which the RR Kalman estimator can be realized as accurately as possible. It is observed that the adaptive channel estimation technique together with the proposed sequential beamspace construction shows remarkable robustness to the pilot interference. This comes with significant reduction in both pilot overhead and dimension of the pre-beamformer lowering both hardware complexity and power consumption.Comment: 7 pages, 3 figures, accepted by IEEE ICC 2017 Wireless Communications Symposiu