arXiv subjects

Abhay Karandikar

Publications and source records attributed to Abhay Karandikar.

At least 37 records · Page 2Linked to original sources

arXiv2018

Dual Connectivity Support in 5G Networks: An SDN based approach

Dual Connectivity (DC) is one of the key techniques to harness the potential of heterogeneous cellular networks. However, 3rd Generation Partnership Project (3GPP) has introduced disparate mechanisms for DC support in different Radio Access Technologies (RATs), bringing complexity to the network nodes in a Multi-RAT Radio Access Network (RAN). Moreover, DC support requires an exchange of high volume of control information between these network nodes. To address these issues, in this paper an SDN based architecture for Multi-RAT RAN is proposed. The proposed architecture brings simplicity to the network interactions, allows flexibility in the network and helps the network in performing load balancing and mobility management functions effectively. We also demonstrate a reduction in the control signaling and an improvement in system performance compared to legacy architecture.

cs.NI↗

arXiv2018

Strategy-Proof Spectrum Allocation among Multiple Operators

To address the demand of exponentially increasing end users efficient use of limited spectrum is a necessity. For this, spectrum allocation among co-existing operators in licensed and unlicensed spectrum band is required to cater to the temporal and spatial traffic variations in the wireless network. In this paper, we consider multiple operator spectrum allocation problem via auctions. The classical Vickrey-Clarke-Grooves (VCG) approach provides a strategy-proof and social welfare maximizing auction at the cost of high computational complexity which makes it intractable for practical implementation. We propose a sealed bid auction for spectrum allocation, which is computationally tractable and can hence be applied as per the dynamic load variations of the network. We show that the proposed algorithm is strategy-proof. Simulation results are presented to exhibit the performance comparison of the proposed algorithm and the VCG mechanism.

cs.GT↗

arXiv2018

GOSPAL: An Efficient Strategy-Proof mechanism for Constrained Resource Allocation

We consider allocation of a resource to multiple interested users with a constraint that if the resource is allocated to user $i$ then it can not be allocated simultaneously to a predefined set of users $\cS_i$ . This scenario arises in many practical systems that include wireless networks and constrained queuing systems. It is known that socially optimal strategy-proof mechanism is not only NP-hard, but it is also hard to approximate. This renders optimal policy hard to use in practice. Here, we propose a computationally efficient mechanism and prove it to be strategy proof. Using Monte Carlo simulations, we show that the social utility of the proposed scheme is close to that of the optimal. Further, we demonstrate how the proposed mechanism can be used for fair and efficient short-term spectrum allocation in resource constrained large wireless networks.

cs.GT↗

arXiv2018

A Structure-aware Online Learning Algorithm for Markov Decision Processes

To overcome the curse of dimensionality and curse of modeling in Dynamic Programming (DP) methods for solving classical Markov Decision Process (MDP) problems, Reinforcement Learning (RL) algorithms are popular. In this paper, we consider an infinite-horizon average reward MDP problem and prove the optimality of the threshold policy under certain conditions. Traditional RL techniques do not exploit the threshold nature of optimal policy while learning. In this paper, we propose a new RL algorithm which utilizes the known threshold structure of the optimal policy while learning by reducing the feasible policy space. We establish that the proposed algorithm converges to the optimal policy. It provides a significant improvement in convergence speed and computational and storage complexity over traditional RL algorithms. The proposed technique can be applied to a wide variety of optimization problems that include energy efficient data transmission and management of queues. We exhibit the improvement in convergence speed of the proposed algorithm over other RL algorithms through simulations.

cs.LG↗

arXiv2018

Stability Analysis of Device-to-Device Relay-Assisted Cellular Networks

Motivated by increasing popularity of delay sensitive applications, we investigate the queue stability in device-to-device (D2D) relay-assisted cellular networks. In contrast to prior works on D2D relay-assisted cellular networks, we incorporate practical properties of these networks such as bursty packet arrivals, user mobility and relays generating their own traffic. Assuming network topology evolving in IID fashion, we first evaluate the system stability region to quantify its delay performance. Subsequently, we formulate a policy for joint resource allocation and power control under a more realistic mobility scenario of generalized reflected random walk. Also, the throughput optimality of this policy is investigated. Simulation results are provided to give better understanding of queue stability in the network.

cs.NI↗

arXiv2018

Towards Optimal Grouping and Resource Allocation for Multicast Streaming in LTE

Multimedia traffic is predicted to account for 82% of the total data traffic by the year 2020. With the increasing popularity of video streaming applications like YouTube, Netflix, Amazon Prime Video, popular video content is often required to be delivered to a large number of users simultaneously. Multicast transmission can be used for catering to such applications efficiently. The common content can be transmitted to the users on the same resources resulting in considerable resource conservation. This paper proposes various schemes for efficient grouping and resource allocation for multicast transmission in LTE. The optimal grouping and resource allocation problems are shown to be NP-hard and so, we propose heuristic algorithms for both these problems. We also formulate a Simulated Annealing based algorithm to approximate the optimal resource allocation for our problem. The LP-relaxation based resource allocation proposed by us results in allocations very close to the estimated optimal.

cs.NI↗

arXiv2018

SDN based Control and Management of WLANs in the 3GPP 5G Network

The exponential growth in mobile broadband usage [1] has catalyzed the need for high data rate communication systems. In this regard, activities for standardizing the next generation mobile broadband system, known as the Fifth Generation(5G) system are underway. The 5G system also enables the integration of Institute of Electrical and Electronic Engineers (IEEE) Wireless Local Area Networks (WLANs) for providing cost-effective broadband connectivity. It is therefore imperative to find solutions for control and management of WLANs, while providing seamless inter-working capabilities with the cellular network. In this paper, we propose a novel Software Defined Networking (SDN) based architecture for efficient control and management of IEEE WLANs while providing a mechanism for smooth integration of WLANs within the 5G system.

cs.NI↗

arXiv2018

A Centralized SDN Architecture for the 5G Cellular Network

In order to meet the increasing demands of high data rate and low latency cellular broadband applications, plans are underway to roll out the Fifth Generation (5G) cellular wireless system by the year 2020. This paper proposes a novel method for adapting the Third Generation Partnership Project (3GPP)'s 5G architecture to the principles of Software Defined Networking (SDN). We propose to have centralized network functions in the 5G network core to control the network, end-to-end. This is achieved by relocating the control functionality present in the 5G Radio Access Network (RAN) to the network core, resulting in the conversion of the base station known as the gNB into a pure data plane node. This brings about a significant reduction in signaling costs between the RAN and the core network. It also results in improved system performance. The merits of our proposal have been illustrated by evaluating the Key Performance Indicators (KPIs) of the 5G network, such as network attach (registration) time and handover time. We have also demonstrated improvements in attach time and system throughput due to the use of centralized algorithms for mobility management with the help of ns-3 simulations.

eess.SP↗

arXiv2017

An Energy-Aware WLAN Discovery Scheme for LTE HetNet

Recently, there has been significant interest in the integration and co-existence of Third Generation Partnership Project (3GPP) Long Term Evolution (LTE) with other Radio Access Technologies, like IEEE 802.11 Wireless Local Area Networks (WLANs). Although, the inter-working of IEEE 802.11 WLANs with 3GPP LTE has indicated enhanced network performance in the context of capacity and load balancing, the WLAN discovery scheme implemented in most of the commercially available smartphones is very inefficient and results in high battery drainage. In this paper, we have proposed an energy efficient WLAN discovery scheme for 3GPP LTE and IEEE 802.11 WLAN inter-working scenario. User Equipment (UE), in the proposed scheme, uses 3GPP network assistance along with the results of past channel scans, to optimally select the next channels to scan. Further, we have also developed an algorithm to accurately estimate the UE's mobility state, using 3GPP network signal strength patterns. We have implemented various discovery schemes in Android framework, to evaluate the performance of our proposed scheme against other solutions in the literature. Since, Android does not support selective scanning mode, we have implemented modules in Android to enable selective scanning. Further, we have also used simulation studies and justified the results using power consumption modeling. The results from the field experiments and simulations have shown high power savings using the proposed scanning scheme without any discovery performance deterioration.

cs.NI↗

arXiv2017

Optimal Traffic Splitting Policy in LTE-based Heterogeneous Network

Dual Connectivity (DC) is a technique proposed to address the problem of increased handovers in heterogeneous networks. In DC, a foreground User Equipment (UE) with multiple transceivers has a possibility to connect to a Macro eNodeB (MeNB) and a Small cell eNodeB (SeNB) simultaneously. In downlink split bearer architecture of DC, a data radio bearer at MeNB gets divided into two; one part is forwarded to the SeNB through a non-ideal backhaul link to the UE, and the other part is forwarded by the MeNB. This may lead to an increase in the total delay at the UE since different packets corresponding to a single transmission may incur varying amounts of delays in the two different paths. Since the resources in the MeNB are shared by background legacy users and foreground users, DC may increase the blocking probability of background users. Moreover, single connectivity to the small cell may increase the blocking probability of foreground users. Therefore, we target to minimize the average delay of the system subject to a constraint on the blocking probability of background and foreground users. The optimal policy is computed and observed to contain a threshold structure. The variation of average system delay is studied for changes in different system parameters.

cs.NI↗

arXiv2017

A Framework for Wireless Broadband Network for Connecting the Unconnected

A significant barrier in providing affordable rural broadband is to connect the rural and remote places to the optical Point of Presence (PoP) over distances of few kilometers. A lot of work has been done in the area of long distance Wi-Fi networks. However, these networks require tall towers and high gain (directional) antennas. Also, they work in the unlicensed band which has Effective Isotropically Radiated Power (EIRP) limit (e.g. 1 W in India) which restricts the network design. In this work, we propose a Long Term Evolution-Advanced (LTE-A) network operating in TV UHF to connect the remote areas to the optical PoP. In India, around 100 MHz of TV UHF band IV (470-585 MHz) is unused at any location and can be put to an effective use in these areas. We explore the idea of multi-hop topology for the proposed network. We also compare the performance of the multi-hop network with the Point to Multipoint (PMP) topology. The results show that multi-hop network performs much better than the PMP network. We then formulate a Linear Programming (LP) problem of generating optimal topology and compare its performance with the multi-hop network. Overall, the analysis implies that an optimally planned LTE-A network in TV UHF band can be a potential solution for affordable rural broadband.

cs.NI↗

arXiv2017

Spectrum Sharing for LTE-A Network in TV White Space

Rural areas in the developing countries are predominantly devoid of Internet access as it is not viable for operators to provide broadband service in these areas. To solve this problem, we propose a middle mile Long erm Evolution Advanced (LTE-A) network operating in TV white space to connect villages to an optical Point of Presence (PoP) located in the vicinity of a rural area. We study the problem of spectrum sharing for the middle mile networks deployed by multiple operators. A graph theory based Fairness Constrained Channel Allocation (FCCA) algorithm is proposed, employing Carrier Aggregation (CA) and Listen Before Talk (LBT) features of LTE-A. We perform extensive system level simulations to demonstrate that FCCA not only increases spectral efficiency but also improves system fairness.

cs.NI↗

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↗

arXiv2016

TCP-aware Cross Layer Scheduling with Adaptive Modulation in IEEE 802.16 (WiMAX) Networks

In this paper, we propose Transmission Control Protocol (TCP)-aware cross layer scheduling algorithms in a multipoint-to-point network such as the uplink of an IEEE 802.16 (WiMAX) network. Inadequate bandwidth allocation to a TCP flow may lead to timeout and since TCP source drops its congestion window ($cwnd$) immediately after a timeout, it may affect the average throughput adversely. On the other hand, since the TCP source increases its $cwnd$ only linearly upon the availability of bandwidth, any excess assignment of bandwidth may remain underutilized. The proposed scheduling algorithms address this by allocating the resources based on $cwnd$ and TCP timeout. Moreover, since we focus on uplink scheduling, we consider that only {\em flow} level resource requirement is communicated to the Base Station ($BS$) instead of per {\em packet} information. The schedulers also take into account the wireless channel characteristics and are thus cross layer in nature. Through exhaustive simulations, we demonstrate that the proposed schedulers exhibit enhanced throughput and fairness properties when compared to that of Round Robin (RR) scheduler under different shadowing. We demonstrate a gain between 3.5 \% to 15 \% in throughput and 15 \% to 25 \% in channel utilization over RR scheduler under different shadowing.

cs.NI↗

arXiv2016

Towards Enabling Broadband for a Billon Plus Population with TV White Spaces

One of the major impediments to providing broadband connectivity in semi-urban and rural India is the lack of robust and affordable backhaul. Fiber connectivity in terms of backhaul that is being planned (or provided) by the Government of India would reach only till rural offices (named Gram Panchayat) in the Indian rural areas. In this exposition, we articulate how TV white space can address the challenge in providing broadband connectivity to a billion plus population within India. The villages can form local Wi-Fi clusters. The problem of connecting the Wi-Fi clusters to the optical fiber points can be addressed using a TV white space based backhaul (middle-mile) network. The amount of TV white space present in India is very large when compared with the developed world. Therefore, we discuss a backhaul architecture for rural India, which utilizes TV white spaces. We also showcase results from our TV white space testbed, which support the effectiveness of backhaul by using TV white spaces. Our testbed provides a broadband access network to rural population in thirteen villages. The testbed is deployed over an area of $25$km$^2$, and extends seamless broadband connectivity from optical fiber locations or Internet gateways to remote (difficult to connect) rural regions. We also discuss standards and TV white space regulations, which are pertinent to the backhaul architecture mentioned above.

cs.NI↗

arXiv2014

Analysis of Blocking Probability in a Relay-based Cellular OFDMA Network

Relay deployment in Orthogonal Frequency Division Multiple Access (OFDMA) based cellular networks helps in coverage extension and or capacity improvement. In OFDMA system, each user requires different number of subcarriers to meet its rate requirement. This resource requirement depends on the Signal to Interference Ratio (SIR) experienced by a user. Traditional methods to compute blocking probability cannot be used in relay based cellular OFDMA networks. In this paper, we present an approach to compute the blocking probability of such networks. We determine an expression of the probability distribution of the users resource requirement based on its experienced SIR and then classify the users into various classes depending upon their subcarrier requirement. We consider the system to be a multidimensional system with different classes and evaluate the blocking probability of system using the multi-dimensional Erlang loss formulas.

cs.IT↗

arXiv2014

A Self-Organized Resource Allocation using Inter-Cell Interference Coordination (ICIC) in Relay-Assisted Cellular Networks

In a multi-cell scenario, the inter-cell interference (ICI) is detrimental in achieving the intended system performance, in particular for the edge users. There is paucity of work available in literature on ICI coordination (ICIC) for relay-assisted cellular networks (RACN). In this paper, we do a survey on the ICIC schemes in cellular networks and RACN. We then propose a self-organized resource allocation plan for RACN to improve the edge user's performance by ICIC. We compare the performance of reuse-1, reuse-3, soft frequency reuse (SFR) scheme, proposed plan with and without relays. The performance metrics for comparison are edge user's spectral efficiency, their signal-to-interference-and-noise ratio (SINR) and system's area spectral efficiency. We show by the simulation results that our proposed plan performs better than the existing resource allocation schemes in static allocation scenario. Next, we propose to make our resource allocation plan dynamic and self-organized. The distinct features of our proposed plan are: One, it achieves a trade-off between the system's area spectral efficiency and the edge user's spectral efficiency performance. Secondly, it introduces a novel concept of interfering neighbor set to achieve ICIC by local interaction between the entities.

cs.NI↗

arXiv2013

Quantitative Assessment of TV White Space in India

Licensed but unutilized television (TV) band spectrum is called as TV white space in the literature. Ultra high frequency (UHF) TV band spectrum has very good wireless radio propagation characteristics. The amount of TV white space in the UHF TV band in India is of interest. Comprehensive quantitative assessment and estimates for the TV white space in the 470-590MHz band for four zones of India (all except north) are presented in this work. This is the first effort in India to estimate TV white spaces in a comprehensive manner. The average available TV white space per unit area in these four zones is calculated using two methods: (i) the primary (licensed) user and secondary (unlicensed) user point of view; and, (ii) the regulations of Federal Communications Commission in the United States. By both methods, the average available TV white space in the UHF TV band is shown to be more than 100MHz! A TV transmitter frequency-reassignment algorithm is also described. Based on spatial-reuse ideas, a TV channel allocation scheme is presented which results in insignicant interference to the TV receivers while using the least number of TV channels for transmission across the four zones. Based on this reassignment, it is found that four TV band channels (or 32MHz) are sufficient to provide the existing UHF TV band coverage in India.

cs.IT↗