arXiv subjects

Prasanna Chaporkar

Publications and source records attributed to Prasanna Chaporkar.

43 records · Page 3Linked to original sources

arXiv2017

Performance Evaluation of Optimal Radio Access Technology Selection Algorithms for LTE-WiFi Network

A Heterogeneous Network (HetNet) comprises of multiple Radio Access Technologies (RATs) allowing a user to associate with a specific RAT and steer to other RATs in a seamless manner. To cope up with the unprecedented growth of data traffic, mobile data can be offloaded to Wireless Fidelity (WiFi) in a Long Term Evolution (LTE) based HetNet. In this paper, an optimal RAT selection problem is considered to maximize the total system throughput in an LTE-WiFi system with offload capability. Another formulation is also developed where maximizing the total system throughput is subject to a constraint on the voice user blocking probability. It is proved that the optimal policies for the association and offloading of voice/data users contain threshold structures. Based on the threshold structures, we propose algorithms for the association and offloading of users in LTE-WiFi HetNet. Simulation results are presented to demonstrate the voice user blocking probability and the total system throughput performance of the proposed algorithms in comparison to another benchmark algorithm.

cs.NI↗

arXiv2017

Approximating Constrained Minimum Input Selection for State Space Structural Controllability

This paper looks at two problems, minimum constrained input selection and minimum cost constrained input selection for state space structured systems. The input matrix is constrained in the sense that the set of states that each input can influence is pre-specified and each input has a cost associated with it. Our goal is to optimally select an input set from the set of inputs given that the system is controllable. These problems are known to be NP-hard. Firstly, we give a new necessary and sufficient graph theoretic condition for checking structural controllability using flow networks. Using this condition we give a polynomial reduction of both these problems to a known NP-hard problem, the minimum cost fixed flow problem (MCFF). Subsequently, we prove that an optimal solution to the MCFF problem corresponds to an optimal solution to the original controllability problem. We also show that approximation schemes of MCFF directly applies to minimum cost constrained input selection problems. Using the special structure of the flow network constructed for the structured system, we give a polynomial approximation algorithm based on minimum weight bipartite matching and a greedy selection scheme for solving MCFF on system flow network. The proposed algorithm gives a $Δ$-approximate solution to MCFF, where $Δ$ denotes the maximum in-degree of input vertices in the flow network of the structured system.

math.OC↗

arXiv2013

Optimal Distributed Scheduling in Wireless Networks under the SINR interference model

Radio resource sharing mechanisms are key to ensuring good performance in wireless networks. In their seminal paper \cite{tassiulas1}, Tassiulas and Ephremides introduced the Maximum Weighted Scheduling algorithm, and proved its throughput-optimality. Since then, there have been extensive research efforts to devise distributed implementations of this algorithm. Recently, distributed adaptive CSMA scheduling schemes \cite{jiang08} have been proposed and shown to be optimal, without the need of message passing among transmitters. However their analysis relies on the assumption that interference can be accurately modelled by a simple interference graph. In this paper, we consider the more realistic and challenging SINR interference model. We present {\it the first distributed scheduling algorithms that (i) are optimal under the SINR interference model, and (ii) that do not require any message passing}. They are based on a combination of a simple and efficient power allocation strategy referred to as {\it Power Packing} and randomization techniques. We first devise algorithms that are rate-optimal in the sense that they perform as well as the best centralized scheduling schemes in scenarios where each transmitter is aware of the rate at which it should send packets to the corresponding receiver. We then extend these algorithms so that they reach throughput-optimality.

cs.IT↗

arXiv2011

Optimal Power Allocation for Renewable Energy Source

Battery powered transmitters face energy constraint, replenishing their energy by a renewable energy source (like solar or wind power) can lead to longer lifetime. We consider here the problem of finding the optimal power allocation under random channel conditions for a wireless transmitter, such that rate of information transfer is maximized. Here a rechargeable battery, which is periodically charged by renewable source, is used to power the transmitter. All of above is formulated as a Markov Decision Process. Structural properties like the monotonicity of the optimal value and policy derived in this paper will be of vital importance in understanding the kind of algorithms and approximations needed in real-life scenarios. The effect of curse of dimensionality which is prevalent in Dynamic programming problems can thus be reduced. We show our results under the most general of assumptions.

eess.SY↗

arXiv2010

Stochastic Approximation Algorithm for Optimal Throughput Performance of Wireless LANs

Throughput improvement of the Wireless LANs has been a constant area of research. Most of the work in this area, focuses on designing throughput optimal schemes for fully connected networks (no hidden nodes). But, we demonstrate that the proposed schemes, though perform optimally in fully connected network, achieve significantly lesser throughput even than that of standard IEEE 802.11 in a network with hidden nodes. This motivates the need for designing schemes that provide near optimal performance even when hidden nodes are present. The primary reason for the failure of existing protocols in the presence of hidden nodes is that these protocols are based on the model developed by Bianchi. However this model does not hold when hidden nodes exist. Moreover, analyzing networks with hidden nodes is still an open problem. Thus, designing throughput optimal schemes in networks with hidden nodes is particularly challenging. The novelty of our approach is that it is not based on any underlying mathematical model, rather it directly tunes the control variables so as to maximize the throughput. We demonstrate that this model independent approach achieves maximum throughput in networks with hidden terminals as well. Apart from this major contribution, we present stochastic approximation based algorithms for achieving weighted fairness in a connected networks. We also present a throughput optimal exponential backoff based random access algorithm. We demonstrate that the exponential backoff based scheme may outperform an optimal p-persistent scheme in networks with hidden terminals. This demonstrates the merit of exponential backoff based random access schemes which was deemed unnecessary by results shown by Bianchi.

cs.NI↗

arXiv2008

Channel and Multiuser Diversities in Wireless Systems: Delay-Energy Tradeoff

We consider a communication system with multi-access fading channel. Each user in the system requires certain rate guarantee. Our main contribution is to devise a scheduling scheme called "Opportunistic Super-position Coding" that satisfies the users' rate requirements. Using mean-field analysis, i.e., when the number of users go to infinity, we analytically show that the energy required to guarantee the required user rate can be made as small as required at the cost of a higher delay ("delay-energy tradeoff"). We explicitly compute the delay under the proposed scheduling policy and discuss how delay differentiation can be achieved. We extend the results to multi-band multi-access channel. Finally, all the results can be generalized in a straightforward fashion to broadcast channel due to the AWGN multiaccess-broadcast duality.

cs.IT↗

arXiv2007

Power Optimal Scheduling for Guaranteed Throughput in Multi-access Fading Channels

A power optimal scheduling algorithm that guarantees desired throughput and bounded delay to each user is developed for fading multi-access multi-band systems. The optimization is over the joint space of all rate allocation and coding strategies. The proposed scheduling assigns rates on each band based only on the current system state, and subsequently uses optimal multi-user signaling to achieve these rates. The scheduling is computationally simple, and hence scalable. Due to uplink-downlink duality, all the results extend in straightforward fashion to the broadcast channels.

cs.IT↗