Please use this identifier to cite or link to this item: http://localhost/handle/Hannan/648979
Title: Carrier Aggregation Between Operators in Next Generation Cellular Networks: A Stable Roommate Market
Authors: Yong Xiao;Zhu Han;Chau Yuen;Luiz A. DaSilva
subject: graph|stable roommate|cognitive radio|matching|Carrier aggregation|cellular network|stable marriage|game theory
Year: 2016
Publisher: IEEE
Abstract: This paper studies carrier aggregation between multiple mobile network operators (MNOs), referred to as interoperator carrier aggregation (IO-CA). In IO-CA, each MNO can transmit on its own licensed spectrum and aggregate the spectrum licensed to other MNOs. We focus on the case that MNOs are partitioned and distributed into small groups, called IO-CA pairs, each of which consists of two MNOs that mutually agree to share their spectrum with each other. We model the IO-CA pairing problem between MNOs as a stable roommate market and derive a condition for which a stable matching structure among all MNOs exist. We propose an algorithm that achieves a stable matching if it exists. Otherwise, the algorithm results in a stable partition. For each IO-CA pair, we derive the optimal transmit power for each spectrum aggregator and establish a Stackelberg game model to analyze the interaction between the licensed subscribers and aggregators in the spectrum of each MNO. We derive the Stackelberg equilibrium of our proposed game and then develop a joint optimization algorithm that achieves the stable matching structure among MNOs as well as the optimal transmit powers for the aggregators and prices for the subscribers of each MNO.
Description: 
URI: http://localhost/handle/Hannan/178745
http://localhost/handle/Hannan/648979
ISSN: 1536-1276
volume: 15
issue: 1
Appears in Collections:2016

Files in This Item:
File Description SizeFormat 
7244237.pdf2.29 MBAdobe PDFThumbnail
Preview File
Title: Carrier Aggregation Between Operators in Next Generation Cellular Networks: A Stable Roommate Market
Authors: Yong Xiao;Zhu Han;Chau Yuen;Luiz A. DaSilva
subject: graph|stable roommate|cognitive radio|matching|Carrier aggregation|cellular network|stable marriage|game theory
Year: 2016
Publisher: IEEE
Abstract: This paper studies carrier aggregation between multiple mobile network operators (MNOs), referred to as interoperator carrier aggregation (IO-CA). In IO-CA, each MNO can transmit on its own licensed spectrum and aggregate the spectrum licensed to other MNOs. We focus on the case that MNOs are partitioned and distributed into small groups, called IO-CA pairs, each of which consists of two MNOs that mutually agree to share their spectrum with each other. We model the IO-CA pairing problem between MNOs as a stable roommate market and derive a condition for which a stable matching structure among all MNOs exist. We propose an algorithm that achieves a stable matching if it exists. Otherwise, the algorithm results in a stable partition. For each IO-CA pair, we derive the optimal transmit power for each spectrum aggregator and establish a Stackelberg game model to analyze the interaction between the licensed subscribers and aggregators in the spectrum of each MNO. We derive the Stackelberg equilibrium of our proposed game and then develop a joint optimization algorithm that achieves the stable matching structure among MNOs as well as the optimal transmit powers for the aggregators and prices for the subscribers of each MNO.
Description: 
URI: http://localhost/handle/Hannan/178745
http://localhost/handle/Hannan/648979
ISSN: 1536-1276
volume: 15
issue: 1
Appears in Collections:2016

Files in This Item:
File Description SizeFormat 
7244237.pdf2.29 MBAdobe PDFThumbnail
Preview File
Title: Carrier Aggregation Between Operators in Next Generation Cellular Networks: A Stable Roommate Market
Authors: Yong Xiao;Zhu Han;Chau Yuen;Luiz A. DaSilva
subject: graph|stable roommate|cognitive radio|matching|Carrier aggregation|cellular network|stable marriage|game theory
Year: 2016
Publisher: IEEE
Abstract: This paper studies carrier aggregation between multiple mobile network operators (MNOs), referred to as interoperator carrier aggregation (IO-CA). In IO-CA, each MNO can transmit on its own licensed spectrum and aggregate the spectrum licensed to other MNOs. We focus on the case that MNOs are partitioned and distributed into small groups, called IO-CA pairs, each of which consists of two MNOs that mutually agree to share their spectrum with each other. We model the IO-CA pairing problem between MNOs as a stable roommate market and derive a condition for which a stable matching structure among all MNOs exist. We propose an algorithm that achieves a stable matching if it exists. Otherwise, the algorithm results in a stable partition. For each IO-CA pair, we derive the optimal transmit power for each spectrum aggregator and establish a Stackelberg game model to analyze the interaction between the licensed subscribers and aggregators in the spectrum of each MNO. We derive the Stackelberg equilibrium of our proposed game and then develop a joint optimization algorithm that achieves the stable matching structure among MNOs as well as the optimal transmit powers for the aggregators and prices for the subscribers of each MNO.
Description: 
URI: http://localhost/handle/Hannan/178745
http://localhost/handle/Hannan/648979
ISSN: 1536-1276
volume: 15
issue: 1
Appears in Collections:2016

Files in This Item:
File Description SizeFormat 
7244237.pdf2.29 MBAdobe PDFThumbnail
Preview File