Introduction Spectrum Sharing Problem Proposed Algorithm Performance Analysis Conclusion Spectrum Sharing in LTE-A network operating in TV White Space Meghna Khaturia, Sweety Suman, Abhay Karandikar and Prasanna Chaporkar Department of Electrical Engineering Indian Institute of Technology Bombay. February 27, 2018 Meghna Khaturia, IIT Bombay — NCC 2018 1/24
24
Embed
Spectrum Sharing in LTE-A network operating in TV White ...meghnak/Document/sharing_ppt.pdf · G. Naik, S. Singhal, A. Kumar, and A. Karandikar, \Quantitative assessment of TV White
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
Introduction Spectrum Sharing Problem Proposed Algorithm Performance Analysis Conclusion
Spectrum Sharing in LTE-A network operating in TVWhite Space
Meghna Khaturia, Sweety Suman, Abhay Karandikar and PrasannaChaporkar
Department of Electrical EngineeringIndian Institute of Technology Bombay.
February 27, 2018
Meghna Khaturia, IIT Bombay — NCC 2018 1/24
Introduction Spectrum Sharing Problem Proposed Algorithm Performance Analysis Conclusion
Outline
1 Introduction
2 Spectrum Sharing Problem
3 Proposed Algorithm
4 Performance Analysis
5 Conclusion
Meghna Khaturia, IIT Bombay — NCC 2018 2/24
Introduction Spectrum Sharing Problem Proposed Algorithm Performance Analysis Conclusion
Outline
1 Introduction
2 Spectrum Sharing Problem
3 Proposed Algorithm
4 Performance Analysis
5 Conclusion
Meghna Khaturia, IIT Bombay — NCC 2018 3/24
Introduction Spectrum Sharing Problem Proposed Algorithm Performance Analysis Conclusion
Current Status of Broadband
52%1 of the global population is not using the Internet
In India, there are only 325 million2 broadband subscriptions in apopulation of 1.34 billion
Introduction Spectrum Sharing Problem Proposed Algorithm Performance Analysis Conclusion
Spectrum Sharing ProblemNotations
Channel Allocation Matrix (A): We define channel allocationmatrix as A = {ak,m|ak,m ∈ {0, 1}}KxM such that
ak,m =
{1, if channel m is assigned to eNBk ,
0, otherwise.
Mode Allocation Matrix (B): B = {bk,m|bk,m ∈ {0, 1}}KxM is aK by M binary matrix.
bk,m =
{1, if allocated channel ak,m is to be shared ,
0, otherwise.
Jain Fairness Index (F):
F =
(K∑
k=1
Tk(A,B)
)2
K ×K∑
k=1
Tk(A,B)2.
Meghna Khaturia, IIT Bombay — NCC 2018 11/24
Introduction Spectrum Sharing Problem Proposed Algorithm Performance Analysis Conclusion
Spectrum Sharing ProblemProblem Formulation
Maximize system throughput subject to fairness constraint
(A?,B?) = arg maxA,B
(K∑
k=1
Tk(A,B)
),
subject to F > δ
where A = Channel Allocation Matrix,
B = Mode Allocation Matrix,
F = Fairness Index,
δ = Constrained value of fairness.
* This is a combinatorial problem which is known to be NP-complete.
Meghna Khaturia, IIT Bombay — NCC 2018 12/24
Introduction Spectrum Sharing Problem Proposed Algorithm Performance Analysis Conclusion
Outline
1 Introduction
2 Spectrum Sharing Problem
3 Proposed Algorithm
4 Performance Analysis
5 Conclusion
Meghna Khaturia, IIT Bombay — NCC 2018 13/24
Introduction Spectrum Sharing Problem Proposed Algorithm Performance Analysis Conclusion
Graphical Model of Network
1 System can be modeled as graph, G (V ,E )V := Set of all the vertices i.e. eNBs deployed in the given areaE := Set of edges between eNBs i.e. an edge between any twovertices implies that vertices are interfering with each other
2 Protocol Interference ModeleNBs interfere with each other if distance between them is less thandthreshold
1
2
4
3
5
Meghna Khaturia, IIT Bombay — NCC 2018 14/24
Introduction Spectrum Sharing Problem Proposed Algorithm Performance Analysis Conclusion