Pub Date : 2015-12-03DOI: 10.1109/WCSP.2015.7341249
Yijie Luo, Li Cui, Yang Yang, Bin Gao
Device-to-device (D2D) communication is a promising technology for 5G wireless communication system. Since D2D communication usually reuses the resource of cellular users, interference management and resource allocation of D2D are the mainly research directions in D2D communication underlay cellular networks. The physical-layer security problem of D2D link is rarely under studied. In this paper, we develop the Stackelberg game frame to model D2D underlay communication in cellular networks. We analyze the equilibrium solution and optimize the power control and channel access of D2D link to maximize the achievable rate of cellular users and the physical-layer secrecy rate of D2D link. We propose a power control and channel access algorithm of D2D link then. Finally, we perform numerical simulations to study the performance of the proposed algorithm.
{"title":"Power control and channel access for physical-layer security of D2D underlay communication","authors":"Yijie Luo, Li Cui, Yang Yang, Bin Gao","doi":"10.1109/WCSP.2015.7341249","DOIUrl":"https://doi.org/10.1109/WCSP.2015.7341249","url":null,"abstract":"Device-to-device (D2D) communication is a promising technology for 5G wireless communication system. Since D2D communication usually reuses the resource of cellular users, interference management and resource allocation of D2D are the mainly research directions in D2D communication underlay cellular networks. The physical-layer security problem of D2D link is rarely under studied. In this paper, we develop the Stackelberg game frame to model D2D underlay communication in cellular networks. We analyze the equilibrium solution and optimize the power control and channel access of D2D link to maximize the achievable rate of cellular users and the physical-layer secrecy rate of D2D link. We propose a power control and channel access algorithm of D2D link then. Finally, we perform numerical simulations to study the performance of the proposed algorithm.","PeriodicalId":164776,"journal":{"name":"2015 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126890827","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-12-03DOI: 10.1109/WCSP.2015.7341017
Dongyu Cao, Shuguo Zhuo, Liantao Wu, Zhi Wang
To extend the system life, duty-cycling technique is widely adopted in wireless sensor network. However, this technique also introduces limited throughput and extra packet delay to the system. To solve the problem, in this paper, we propose eQueue-MAC, a multi-channel traffic adaptive CSMA/TDMA hybrid MAC protocol with slotted channel hopping technique which is robust to external interference and can adapt to variable traffic loads. eQueue-MAC maintains high flexibility by allowing CSMA accesses in light traffic conditions. With traffic increases, eQueue-MAC utilizes the queue-length information to dynamically allocate TDMA slots to sensor nodes to deal with the burst traffic load. In addition, the up to date IEEE 802.15.4e slotted channel hopping scheme is adopted in the vTDMA period to mitigate the impact from external interference or multipath fading. We have successfully implemented eQueue-MAC on STM32W108 SOC chips and carried out extensive experiments to evaluate its effectiveness. The results show that eQueue-MAC achieves low packet delay and high throughput under various traffic conditions. Moreover, the proposed protocol has also shown its effectiveness in handling external interferences, making it suitable for various industrial applications.
{"title":"eQueue-MAC: Enhanced traffic adaptive hybrid MAC protocol with IEEE 802.15.4e features for industrial applications","authors":"Dongyu Cao, Shuguo Zhuo, Liantao Wu, Zhi Wang","doi":"10.1109/WCSP.2015.7341017","DOIUrl":"https://doi.org/10.1109/WCSP.2015.7341017","url":null,"abstract":"To extend the system life, duty-cycling technique is widely adopted in wireless sensor network. However, this technique also introduces limited throughput and extra packet delay to the system. To solve the problem, in this paper, we propose eQueue-MAC, a multi-channel traffic adaptive CSMA/TDMA hybrid MAC protocol with slotted channel hopping technique which is robust to external interference and can adapt to variable traffic loads. eQueue-MAC maintains high flexibility by allowing CSMA accesses in light traffic conditions. With traffic increases, eQueue-MAC utilizes the queue-length information to dynamically allocate TDMA slots to sensor nodes to deal with the burst traffic load. In addition, the up to date IEEE 802.15.4e slotted channel hopping scheme is adopted in the vTDMA period to mitigate the impact from external interference or multipath fading. We have successfully implemented eQueue-MAC on STM32W108 SOC chips and carried out extensive experiments to evaluate its effectiveness. The results show that eQueue-MAC achieves low packet delay and high throughput under various traffic conditions. Moreover, the proposed protocol has also shown its effectiveness in handling external interferences, making it suitable for various industrial applications.","PeriodicalId":164776,"journal":{"name":"2015 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121450151","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-12-03DOI: 10.1109/WCSP.2015.7341284
Chaojie Xu, Zhongling Liu, Jun Xia, Hui Yu
In wireless sensor networks, hierarchical clustering schemes have been widely used to enhance the quality of service. However, in mobile wireless sensor networks, node mobility dynamically influences the topology of the clustered network, thus affects the optimal cluster performance such as compactness and separation of clusters. To eliminate the influence of node mobility, a novel adaptive distributed re-clustering scheme is proposed in this paper. In this scheme, nodes are clustered initially. At each time after that, nodes estimate their current locations and predict the most possible locations of next time. Each boundary node of a cluster periodically obtains location information of the nodes in the neighbouring clusters and autonomously evaluates the optimal cluster according to the information. If a re-clustering process is necessary, the boundary node will switch its assigned cluster through communicating with cluster headers of current cluster and the optimal cluster. The simulation results demonstrate the efficacy of the proposed scheme in increasing the performance on compactness and separation of clusters, and reveal the outperformance of the proposed scheme on packet delivery ratio comparing with existing schemes.
{"title":"An adaptive distributed re-clustering scheme for mobile wireless sensor networks","authors":"Chaojie Xu, Zhongling Liu, Jun Xia, Hui Yu","doi":"10.1109/WCSP.2015.7341284","DOIUrl":"https://doi.org/10.1109/WCSP.2015.7341284","url":null,"abstract":"In wireless sensor networks, hierarchical clustering schemes have been widely used to enhance the quality of service. However, in mobile wireless sensor networks, node mobility dynamically influences the topology of the clustered network, thus affects the optimal cluster performance such as compactness and separation of clusters. To eliminate the influence of node mobility, a novel adaptive distributed re-clustering scheme is proposed in this paper. In this scheme, nodes are clustered initially. At each time after that, nodes estimate their current locations and predict the most possible locations of next time. Each boundary node of a cluster periodically obtains location information of the nodes in the neighbouring clusters and autonomously evaluates the optimal cluster according to the information. If a re-clustering process is necessary, the boundary node will switch its assigned cluster through communicating with cluster headers of current cluster and the optimal cluster. The simulation results demonstrate the efficacy of the proposed scheme in increasing the performance on compactness and separation of clusters, and reveal the outperformance of the proposed scheme on packet delivery ratio comparing with existing schemes.","PeriodicalId":164776,"journal":{"name":"2015 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121452996","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-12-03DOI: 10.1109/WCSP.2015.7341117
Shidang Li, Chunguo Li, Yongming Huang, Yi Wang, Dongming Wang, Cheng Zhang, Luxi Yang
This paper considers interference mitigation with power allocation in cognitive radio systems. In such a system, cognitive radio is designed to transmit data to its corresponding users without causing any interference to the current primary transmission. To avoid these interference between these links, the secondary transmitters sense the primary user's unused eigenvector space and reuse these spatial hole resource in the same resource block. Moreover, an interference suppression scheme based on matrix distance is presented. Due to limit of the numerical times, the overleft leakage interference in the desired signal space is still exist. To improve the secondary users and total performance, we jointly optimize the precoding matrix, decoding matrix and power loading matrix under the constraints of transmission power of each transmitter. Since the problem is non-convex, the iterative technique and Cauchy-Buniakowsky-Schwarz theorem are used. Extensive computer simulation are provided and demonstrate that our proposed algorithm extremely outperforms the conventional scheme.
{"title":"An efficient interference mitigating scheme for cognitive radio networks: From the perspective of space pooling","authors":"Shidang Li, Chunguo Li, Yongming Huang, Yi Wang, Dongming Wang, Cheng Zhang, Luxi Yang","doi":"10.1109/WCSP.2015.7341117","DOIUrl":"https://doi.org/10.1109/WCSP.2015.7341117","url":null,"abstract":"This paper considers interference mitigation with power allocation in cognitive radio systems. In such a system, cognitive radio is designed to transmit data to its corresponding users without causing any interference to the current primary transmission. To avoid these interference between these links, the secondary transmitters sense the primary user's unused eigenvector space and reuse these spatial hole resource in the same resource block. Moreover, an interference suppression scheme based on matrix distance is presented. Due to limit of the numerical times, the overleft leakage interference in the desired signal space is still exist. To improve the secondary users and total performance, we jointly optimize the precoding matrix, decoding matrix and power loading matrix under the constraints of transmission power of each transmitter. Since the problem is non-convex, the iterative technique and Cauchy-Buniakowsky-Schwarz theorem are used. Extensive computer simulation are provided and demonstrate that our proposed algorithm extremely outperforms the conventional scheme.","PeriodicalId":164776,"journal":{"name":"2015 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121618503","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-12-03DOI: 10.1109/WCSP.2015.7340975
Zhaohui Yang, Yijin Pan, Ming Chen, Hao Xu, Jianfeng Shi
We consider the problem of optimization of sum cell load with the constraints of cell load coupling and power control in LTE network. Our system model characterizes the coupling relation between cell load and power, considering non-uniform traffic demand and interference between cells. Solving the problem involves optimization with fixed power, and optimization with power control. We prove the the convergence of fixed-point iteration, which is used in optimization with fixed power, and provide sufficient and necessary conditions for the feasibility of cell load coupling with power control. Numerical results illustrate that our proposed solutions are superior to the conventional power allocation schemes.
{"title":"Cell load coupling with power control for LTE network planning","authors":"Zhaohui Yang, Yijin Pan, Ming Chen, Hao Xu, Jianfeng Shi","doi":"10.1109/WCSP.2015.7340975","DOIUrl":"https://doi.org/10.1109/WCSP.2015.7340975","url":null,"abstract":"We consider the problem of optimization of sum cell load with the constraints of cell load coupling and power control in LTE network. Our system model characterizes the coupling relation between cell load and power, considering non-uniform traffic demand and interference between cells. Solving the problem involves optimization with fixed power, and optimization with power control. We prove the the convergence of fixed-point iteration, which is used in optimization with fixed power, and provide sufficient and necessary conditions for the feasibility of cell load coupling with power control. Numerical results illustrate that our proposed solutions are superior to the conventional power allocation schemes.","PeriodicalId":164776,"journal":{"name":"2015 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123062229","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Trajectories extracted by previous methods for human action recognition contain irrelevant changes, and the Orientation-Magnitude descriptors of their shapes lack the robustness to camera motion. To solve these problems, action recognition by tracking salient relative motion points is proposed in this paper. Firstly, motion boundary detector which suppresses the camera constant motion is utilized to extract motion features. After processing the detected boundaries by the adaptive threshold, the super-pixels that contain salient points are defined as relative motion regions. Then tracking the points within super-pixels is to generate trajectories. For the trajectory shape, the pre-defined orientation assignments with coarse-to-fine quantization levels are used to produce orientation statistics. Finally, the descriptors of oriented gradient, motion boundary, oriented statistic and their combination are adopted to represent action videos, respectively. On the benchmark KTH and UCF-sports action datasets, experimental results show that the extracted trajectories can describe the movement process of object. Compared with the conventional algorithms, our method with multiple kernel learning obtains good performance.
{"title":"A study of relative motion point trajectories for action recognition","authors":"Tongchi Zhou, Nijun Li, Xu Cheng, Qinjun Xu, Lin Zhou, Zhen-yang Wu","doi":"10.1109/WCSP.2015.7340988","DOIUrl":"https://doi.org/10.1109/WCSP.2015.7340988","url":null,"abstract":"Trajectories extracted by previous methods for human action recognition contain irrelevant changes, and the Orientation-Magnitude descriptors of their shapes lack the robustness to camera motion. To solve these problems, action recognition by tracking salient relative motion points is proposed in this paper. Firstly, motion boundary detector which suppresses the camera constant motion is utilized to extract motion features. After processing the detected boundaries by the adaptive threshold, the super-pixels that contain salient points are defined as relative motion regions. Then tracking the points within super-pixels is to generate trajectories. For the trajectory shape, the pre-defined orientation assignments with coarse-to-fine quantization levels are used to produce orientation statistics. Finally, the descriptors of oriented gradient, motion boundary, oriented statistic and their combination are adopted to represent action videos, respectively. On the benchmark KTH and UCF-sports action datasets, experimental results show that the extracted trajectories can describe the movement process of object. Compared with the conventional algorithms, our method with multiple kernel learning obtains good performance.","PeriodicalId":164776,"journal":{"name":"2015 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"579 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116265188","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-12-03DOI: 10.1109/WCSP.2015.7341230
M. Ke, Jing Lv, Jiang Chang, Weiheng Dai, Kaixiang Tong, M. Zhu
The precise point positioning (PPP) is widely used as a typical representative of GNSS. But the main challenge of dual-frequency PPP is that it requires quite a long time to succeed in the ambiguity-fixed so it takes more than 30 min to obtain centimeter-level accuracy. A combination of GPS and low earth orbit (LEO) satellites can improve the diversity of available satellites' geometric distribution and reduce the correlation of observation data between epochs. Then the accuracy of float solution will be promoted and the ambiguity of GPS will take less time to get fixed. The purpose of this paper is to reduce the convergence time of PPP by the contribution of LEO satellites which have low earth orbit and move speedily. We adopt a free-ionosphere PPP model to combine GPS and LEO satellites. Numerous experimental results show that GPS/LEO PPP requires much less convergence time and gets higher positioning accuracy than that of PPP with GPS alone. In addition, an analysis is also made to compare GPS/LEO PPP and GPS/GLONASS PPP. The results indicate that GPS/LEO PPP also requires much less convergence time and gets higher positioning accuracy than that of GPS/GLONASS PPP when increasing the same number of available satellites. This proved that LEO satellites have more contribution to PPP performance than MEO.
{"title":"Integrating GPS and LEO to accelerate convergence time of precise point positioning","authors":"M. Ke, Jing Lv, Jiang Chang, Weiheng Dai, Kaixiang Tong, M. Zhu","doi":"10.1109/WCSP.2015.7341230","DOIUrl":"https://doi.org/10.1109/WCSP.2015.7341230","url":null,"abstract":"The precise point positioning (PPP) is widely used as a typical representative of GNSS. But the main challenge of dual-frequency PPP is that it requires quite a long time to succeed in the ambiguity-fixed so it takes more than 30 min to obtain centimeter-level accuracy. A combination of GPS and low earth orbit (LEO) satellites can improve the diversity of available satellites' geometric distribution and reduce the correlation of observation data between epochs. Then the accuracy of float solution will be promoted and the ambiguity of GPS will take less time to get fixed. The purpose of this paper is to reduce the convergence time of PPP by the contribution of LEO satellites which have low earth orbit and move speedily. We adopt a free-ionosphere PPP model to combine GPS and LEO satellites. Numerous experimental results show that GPS/LEO PPP requires much less convergence time and gets higher positioning accuracy than that of PPP with GPS alone. In addition, an analysis is also made to compare GPS/LEO PPP and GPS/GLONASS PPP. The results indicate that GPS/LEO PPP also requires much less convergence time and gets higher positioning accuracy than that of GPS/GLONASS PPP when increasing the same number of available satellites. This proved that LEO satellites have more contribution to PPP performance than MEO.","PeriodicalId":164776,"journal":{"name":"2015 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"35 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120995486","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-12-03DOI: 10.1109/WCSP.2015.7341272
Haibo Zhou, Nan Cheng, Ning Zhang, Shaohua Wu, Lin Gui, Quan Yu, Xuemin Shen, F. Bai
Enabling efficient vehicular wireless connections with wide coverage for vehicular applications has gained significant attentions in both academia and industry. In this paper, we study the TV white spaces (WS) supportive vehicular content distribution with Geolocation database, which is referred to as WhiteFi Infostations. Taking into account both the realistic content distribution requirements for delay and throughput constraints in vehicular applications and the vehicular mobility as well, we propose a mobility-aware contention-free multi-polling access scheduling scheme to support both the deadline-driven and delay-tolerant vehicular content distribution applications. Through extensive simulations with real-world empirical TVWS data and urban vehicular traces, we demonstrate that our proposed vehicular content distribution solution can well support both the deadline-driven and delay-tolerant vehicular tailor-made services in vehicular ad hoc networks (VANET).
{"title":"Enabling efficient and wide-coverage vehicular content distribution over TV white spaces","authors":"Haibo Zhou, Nan Cheng, Ning Zhang, Shaohua Wu, Lin Gui, Quan Yu, Xuemin Shen, F. Bai","doi":"10.1109/WCSP.2015.7341272","DOIUrl":"https://doi.org/10.1109/WCSP.2015.7341272","url":null,"abstract":"Enabling efficient vehicular wireless connections with wide coverage for vehicular applications has gained significant attentions in both academia and industry. In this paper, we study the TV white spaces (WS) supportive vehicular content distribution with Geolocation database, which is referred to as WhiteFi Infostations. Taking into account both the realistic content distribution requirements for delay and throughput constraints in vehicular applications and the vehicular mobility as well, we propose a mobility-aware contention-free multi-polling access scheduling scheme to support both the deadline-driven and delay-tolerant vehicular content distribution applications. Through extensive simulations with real-world empirical TVWS data and urban vehicular traces, we demonstrate that our proposed vehicular content distribution solution can well support both the deadline-driven and delay-tolerant vehicular tailor-made services in vehicular ad hoc networks (VANET).","PeriodicalId":164776,"journal":{"name":"2015 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116610783","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-12-03DOI: 10.1109/WCSP.2015.7341126
Wanchun Liu, Xiangyun Zhou, S. Durrani
Exploring a cooperative node as a friendly jammer is an effective means of providing secure communication between a source-destination pair in the presence of an eavesdropper. In this work, we consider the use of a wireless-powered friendly jammer. Without relying on external energy supply, the friendly jammer is powered by the source node via wireless power transfer. We apply a simple time-switching protocol where the power transfer and jammer-assisted secure transmission occur in different time blocks. By investigating the long-term behavior of the communication protocol, we derive a closed-form expression of the throughput. We further optimize the jamming power and the rate parameters for maximizing the throughput subject to a secrecy outage probability constraint.
{"title":"Wireless-powered friendly jammer for physical layer security","authors":"Wanchun Liu, Xiangyun Zhou, S. Durrani","doi":"10.1109/WCSP.2015.7341126","DOIUrl":"https://doi.org/10.1109/WCSP.2015.7341126","url":null,"abstract":"Exploring a cooperative node as a friendly jammer is an effective means of providing secure communication between a source-destination pair in the presence of an eavesdropper. In this work, we consider the use of a wireless-powered friendly jammer. Without relying on external energy supply, the friendly jammer is powered by the source node via wireless power transfer. We apply a simple time-switching protocol where the power transfer and jammer-assisted secure transmission occur in different time blocks. By investigating the long-term behavior of the communication protocol, we derive a closed-form expression of the throughput. We further optimize the jamming power and the rate parameters for maximizing the throughput subject to a secrecy outage probability constraint.","PeriodicalId":164776,"journal":{"name":"2015 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125243798","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The next generation of small cell base stations (SCBSs), with multi-mode specialty, can offload part of traffic load to unlicensed spectrum to alleviate burden in licensed band. In this paper, we propose an interference graph to capture the coupling interference relationship in unlicensed band between small cell. Based on the interference graph, we formulated the traffic-offloading issue as the local cooperation game. In addition, we prove that the proposed game is an exact potential game which has at least one pure strategy Nash equilibrium (NE), which maximize the total network sum-rate. Furthermore, we design a distributed iterative learning algorithm to explore the optimal pure strategy NE point of the game.
{"title":"Locally cooperative traffic-offloading in multi-mode small cell networks: Potential games","authors":"Hongxiang Shao, Youming Sun, Hang-sheng Zhao, Wei Zhong","doi":"10.1109/WCSP.2015.7341224","DOIUrl":"https://doi.org/10.1109/WCSP.2015.7341224","url":null,"abstract":"The next generation of small cell base stations (SCBSs), with multi-mode specialty, can offload part of traffic load to unlicensed spectrum to alleviate burden in licensed band. In this paper, we propose an interference graph to capture the coupling interference relationship in unlicensed band between small cell. Based on the interference graph, we formulated the traffic-offloading issue as the local cooperation game. In addition, we prove that the proposed game is an exact potential game which has at least one pure strategy Nash equilibrium (NE), which maximize the total network sum-rate. Furthermore, we design a distributed iterative learning algorithm to explore the optimal pure strategy NE point of the game.","PeriodicalId":164776,"journal":{"name":"2015 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128112967","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：