Pub Date : 2012-12-01DOI: 10.1109/GLOCOM.2012.6503970
L. Zhang, Qiang Ye, Jie Cheng, Hongbo Jiang, Yake Wang, Rui Zhou, Peng Zhao
Wireless sensor networks are expected to be used in many different applications such as disaster relief, environmental control, and intelligent buildings. In this paper, we focus on a sensor network that collects environment data from all sensor nodes periodically. To gather the sensing data quickly and reliably, the scheduling algorithm should be able to coordinate the data transmissions in the network and react to node/link failures effectively. In this paper, we present an innovative scheduling algorithm, Fault-Tolerant Scheduling for data collection (FTS), that leads to short data collection time and high fault tolerance. Our experimental results show that FTS outperforms the DCSB algorithm and exhibits strong fault-tolerant capabilities.
{"title":"Fault-tolerant scheduling for data collection in wireless sensor networks","authors":"L. Zhang, Qiang Ye, Jie Cheng, Hongbo Jiang, Yake Wang, Rui Zhou, Peng Zhao","doi":"10.1109/GLOCOM.2012.6503970","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503970","url":null,"abstract":"Wireless sensor networks are expected to be used in many different applications such as disaster relief, environmental control, and intelligent buildings. In this paper, we focus on a sensor network that collects environment data from all sensor nodes periodically. To gather the sensing data quickly and reliably, the scheduling algorithm should be able to coordinate the data transmissions in the network and react to node/link failures effectively. In this paper, we present an innovative scheduling algorithm, Fault-Tolerant Scheduling for data collection (FTS), that leads to short data collection time and high fault tolerance. Our experimental results show that FTS outperforms the DCSB algorithm and exhibits strong fault-tolerant capabilities.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"8 1","pages":"5345-5349"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75247255","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}
In recent years, there has been an increasing interest in the adoption of wireless sensor networks (WSNs) for structural health monitoring (SHM). However, considering the large amount of sampled data, limited power supply and wireless bandwidth of WSNs, it is generally not possible for sensor nodes to monitor structural condition continuously especially for long-term SHM. From SHM perspective, it is highly desirable to collect data during the occurrence of some certain kinds of events such as earthquakes, large wind, etc, since data collected during these periods are more informative for damage detection purpose. However, these events in SHM occur infrequently and if happen, only last for a very short period of time. To effectively capture these short events using energy-limited wireless sensor nodes is a challenging task that has not been addressed in literature. In this paper, we propose a fast and reliable scheme to capture these short-term events. In terms of hardware, the radio-triggered unit and the vibration-triggered unit are designed in our motes. From software perspective, we develop the event capture scheme to realize fast, reliable and energy-efficient event detection under noisy environment. We mainly study the very first problem of the scheme: sentry selection. The optimization problem is formulated and we show that the problem is a general case of the classical k-center problem. Then we propose a greedy algorithm to solve this problem, and conduct simulation to test the effectiveness of the proposed algorithm.
{"title":"A high quality event capture scheme for WSN-based structural health monitoring","authors":"Chao Yang, Jiannong Cao, Xuefeng Liu, Lijun Chen, Daoxu Chen","doi":"10.1109/GLOCOM.2012.6503182","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503182","url":null,"abstract":"In recent years, there has been an increasing interest in the adoption of wireless sensor networks (WSNs) for structural health monitoring (SHM). However, considering the large amount of sampled data, limited power supply and wireless bandwidth of WSNs, it is generally not possible for sensor nodes to monitor structural condition continuously especially for long-term SHM. From SHM perspective, it is highly desirable to collect data during the occurrence of some certain kinds of events such as earthquakes, large wind, etc, since data collected during these periods are more informative for damage detection purpose. However, these events in SHM occur infrequently and if happen, only last for a very short period of time. To effectively capture these short events using energy-limited wireless sensor nodes is a challenging task that has not been addressed in literature. In this paper, we propose a fast and reliable scheme to capture these short-term events. In terms of hardware, the radio-triggered unit and the vibration-triggered unit are designed in our motes. From software perspective, we develop the event capture scheme to realize fast, reliable and energy-efficient event detection under noisy environment. We mainly study the very first problem of the scheme: sentry selection. The optimization problem is formulated and we show that the problem is a general case of the classical k-center problem. Then we propose a greedy algorithm to solve this problem, and conduct simulation to test the effectiveness of the proposed algorithm.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"37 1","pages":"622-627"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76954460","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 : 2012-12-01DOI: 10.1109/GLOCOM.2012.6503619
Jingon Joung, Chin Keong Ho, Sumei Sun
Spectral efficiency (SE) and energy efficiency (EE) are key measures for wireless communication systems. In OFDM systems, the non-linear effects and inefficiencies of power amplifiers (PAs) have posed practical challenges for system design. In this paper, we analyze the impact of the PA on the SE and EE tradeoff of OFDM systems. We also propose a PA switching technique which achieves a better SE-EE tradeoff, e.g., the EE can be improved by 323% with 15% SE reduction.
{"title":"Tradeoff of spectral and energy efficiencies: Impact of power amplifier on OFDM systems","authors":"Jingon Joung, Chin Keong Ho, Sumei Sun","doi":"10.1109/GLOCOM.2012.6503619","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503619","url":null,"abstract":"Spectral efficiency (SE) and energy efficiency (EE) are key measures for wireless communication systems. In OFDM systems, the non-linear effects and inefficiencies of power amplifiers (PAs) have posed practical challenges for system design. In this paper, we analyze the impact of the PA on the SE and EE tradeoff of OFDM systems. We also propose a PA switching technique which achieves a better SE-EE tradeoff, e.g., the EE can be improved by 323% with 15% SE reduction.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"71 1","pages":"3274-3279"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77225304","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 : 2012-12-01DOI: 10.1109/GLOCOM.2012.6503396
Haifeng Lu, C. Foh, Yonggang Wen, Jianfei Cai
Among different setups of cloud storage systems, fountain-codes based distributed cloud storage system provides reliable online storage solution through placing coded content fragments into multiple storage nodes. Luby Transform (LT) code is one of the popular fountain codes for storage systems due to its efficient recovery. However, to ensure high success decoding of fountain codes based storage, retrieval of additional fragments is required, and this requirement introduces additional delay, which is critical for content retrieval or downloading applications. In this paper, we show that multiple-stage retrieval of fragments is effective to reduce the content-retrieval delay. We first develop a delay model for various multiple-stage retrieval schemes applicable to our considered system. With the developed model, we study optimal retrieval schemes given the success decodability requirement. Our numerical results demonstrate that the content-retrieval delay can be significantly reduced by optimally scheduling packet requests in a multi-stage fashion.
{"title":"Optimizing content retrieval delay for LT-based distributed cloud storage systems","authors":"Haifeng Lu, C. Foh, Yonggang Wen, Jianfei Cai","doi":"10.1109/GLOCOM.2012.6503396","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503396","url":null,"abstract":"Among different setups of cloud storage systems, fountain-codes based distributed cloud storage system provides reliable online storage solution through placing coded content fragments into multiple storage nodes. Luby Transform (LT) code is one of the popular fountain codes for storage systems due to its efficient recovery. However, to ensure high success decoding of fountain codes based storage, retrieval of additional fragments is required, and this requirement introduces additional delay, which is critical for content retrieval or downloading applications. In this paper, we show that multiple-stage retrieval of fragments is effective to reduce the content-retrieval delay. We first develop a delay model for various multiple-stage retrieval schemes applicable to our considered system. With the developed model, we study optimal retrieval schemes given the success decodability requirement. Our numerical results demonstrate that the content-retrieval delay can be significantly reduced by optimally scheduling packet requests in a multi-stage fashion.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"67 1","pages":"1920-1925"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76232520","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 : 2012-12-01DOI: 10.1109/GLOCOM.2012.6503690
Chia-Chang Hu, Yi-Shiang Chiu, Sheng-Shang Lin
In the paper, the source/relays-precoders and destination-equalizer combined optimization is proposed in a dual-hop multiple-input multiple-output (MIMO) amplify-and-forward (AF) multiple-relay system with correlated channel uncertainties in both hops. By taking correlated channel uncertainties into account, a robust transceiver joint design is developed based on the minimum mean-squared error (MMSE) criterion under individual power constraints at the source and relays. Simulation results illustrate that the robust transceiver design architecture for an AF-MIMO system equipped with multiple relays outperforms substantially the non-robust transceiver design.
{"title":"Joint optimization for MIMO AF multiple-relay systems with correlated channel uncertainties","authors":"Chia-Chang Hu, Yi-Shiang Chiu, Sheng-Shang Lin","doi":"10.1109/GLOCOM.2012.6503690","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503690","url":null,"abstract":"In the paper, the source/relays-precoders and destination-equalizer combined optimization is proposed in a dual-hop multiple-input multiple-output (MIMO) amplify-and-forward (AF) multiple-relay system with correlated channel uncertainties in both hops. By taking correlated channel uncertainties into account, a robust transceiver joint design is developed based on the minimum mean-squared error (MMSE) criterion under individual power constraints at the source and relays. Simulation results illustrate that the robust transceiver design architecture for an AF-MIMO system equipped with multiple relays outperforms substantially the non-robust transceiver design.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"12 1","pages":"3690-3695"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80502666","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 : 2012-12-01DOI: 10.1109/GLOCOM.2012.6503872
Yuanping Zhu, Jing Xu, Yang Yang, Xin Yang, Ze-ping Hu
Soft Frequency Reuse (SFR) has been widely used to deal with the severe ICI (Inter-Cell Interference) especially for cell edge users. This paper presents an analytical method to investigate the statistics of inter-cell interference in uplink when SFR scheme is adopted in OFDM (Orthogonal Frequency Division Multiplexing) systems. PDF (Probability Density Function) of ICI from one adjacent interfering cell is derived and then used to deduce the expectation and variance of ICI from multiple interfering cells. The derived results are validated through comparison with Monte Carlo simulations. In addition, the relationships between system parameters and statistics of ICI in different frequency bands are investigated. These contributions will give inspect into important guidelines to system optimization.
软频率复用(Soft Frequency Reuse, SFR)被广泛用于处理严重的小区间干扰，特别是小区边缘用户的小区间干扰。本文提出了一种分析研究OFDM (Orthogonal Frequency Division Multiplexing)系统中采用SFR方案时上行小区间干扰统计的分析方法。首先推导了相邻干扰单元的ICI的概率密度函数(PDF)，然后用它来推导多个干扰单元的ICI的期望和方差。通过与蒙特卡罗仿真的比较，验证了所得结果。此外，还研究了系统参数与不同频段ICI统计量之间的关系。这些贡献将为系统优化提供重要的指导。
{"title":"Inter-cell interference statistics of uplink OFDM systems with Soft Frequency Reuse","authors":"Yuanping Zhu, Jing Xu, Yang Yang, Xin Yang, Ze-ping Hu","doi":"10.1109/GLOCOM.2012.6503872","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503872","url":null,"abstract":"Soft Frequency Reuse (SFR) has been widely used to deal with the severe ICI (Inter-Cell Interference) especially for cell edge users. This paper presents an analytical method to investigate the statistics of inter-cell interference in uplink when SFR scheme is adopted in OFDM (Orthogonal Frequency Division Multiplexing) systems. PDF (Probability Density Function) of ICI from one adjacent interfering cell is derived and then used to deduce the expectation and variance of ICI from multiple interfering cells. The derived results are validated through comparison with Monte Carlo simulations. In addition, the relationships between system parameters and statistics of ICI in different frequency bands are investigated. These contributions will give inspect into important guidelines to system optimization.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"15 1","pages":"4764-4769"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78871794","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 : 2012-12-01DOI: 10.1109/GLOCOM.2012.6503301
Yonglei Jiang, Huaxia Chen, Honglin Hu
The Cyclic Delay Diversity (CDD)-induced cyclostationary signature is considered to be a robust and cost-efficient scheme for self-coordination of Cognitive Radio Network (CRN). However, the performance of network coordination relies on the reliable detection of such cyclostationary signatures. In this paper, we deduce an exact covariance matrix to characterize the statistics of cyclostationary signature. Based on the covariance matrix, we propose an Asymptotically Optimal Likelihood (AOL) detector for the test of the CDD-induced cyclostationary signature. In addition, an Asymptotically Maximum Likelihood Probability (AMLP) criterion is provided to solve the multiple signatures identification issue. Comprehensive simulations verify that the proposed detector provides superior performance in detection probability and observation duration, compared with the existing Constant False Alarm Rate (CFAR) detector.
{"title":"Asymptotically Optimal Likelihood detector for cyclostationary signature induced by Cyclic Delay Diversity","authors":"Yonglei Jiang, Huaxia Chen, Honglin Hu","doi":"10.1109/GLOCOM.2012.6503301","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503301","url":null,"abstract":"The Cyclic Delay Diversity (CDD)-induced cyclostationary signature is considered to be a robust and cost-efficient scheme for self-coordination of Cognitive Radio Network (CRN). However, the performance of network coordination relies on the reliable detection of such cyclostationary signatures. In this paper, we deduce an exact covariance matrix to characterize the statistics of cyclostationary signature. Based on the covariance matrix, we propose an Asymptotically Optimal Likelihood (AOL) detector for the test of the CDD-induced cyclostationary signature. In addition, an Asymptotically Maximum Likelihood Probability (AMLP) criterion is provided to solve the multiple signatures identification issue. Comprehensive simulations verify that the proposed detector provides superior performance in detection probability and observation duration, compared with the existing Constant False Alarm Rate (CFAR) detector.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"8 1","pages":"1351-1355"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81841895","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 : 2012-12-01DOI: 10.1109/GLOCOM.2012.6503681
Rui Wang, M. Tao
We study precoding design for cognitive two-way relay networks (C-TWRNs). In C-TWRN, the multi-antenna secondary transmitter not only transmits its own signal to the secondary receiver, it also acts as relay to help forwarding signals of two primary users via two-way relaying in the licensed frequency band. Our objective is to design linear relay transceiver or precoder such that the achievable rate of the secondary user is maximized while maintaining rate requirements of the primary users. To achieve this goal, different relay strategies, i.e., amplify-and-forward (AF), bit level XOR based decode-and-forward (DF-XOR) and symbol level superposition coding based decode-and-forward (DF-SUP), are considered. By transforming these non-convex design problems into suitable forms, efficient optimization tools are used to find the optimal solutions of all the schemes. Closed-form solutions are also obtained under certain conditions.
{"title":"Precoding design for cognitive two-way relay networks","authors":"Rui Wang, M. Tao","doi":"10.1109/GLOCOM.2012.6503681","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503681","url":null,"abstract":"We study precoding design for cognitive two-way relay networks (C-TWRNs). In C-TWRN, the multi-antenna secondary transmitter not only transmits its own signal to the secondary receiver, it also acts as relay to help forwarding signals of two primary users via two-way relaying in the licensed frequency band. Our objective is to design linear relay transceiver or precoder such that the achievable rate of the secondary user is maximized while maintaining rate requirements of the primary users. To achieve this goal, different relay strategies, i.e., amplify-and-forward (AF), bit level XOR based decode-and-forward (DF-XOR) and symbol level superposition coding based decode-and-forward (DF-SUP), are considered. By transforming these non-convex design problems into suitable forms, efficient optimization tools are used to find the optimal solutions of all the schemes. Closed-form solutions are also obtained under certain conditions.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"91 1","pages":"3638-3643"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78692919","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 : 2012-12-01DOI: 10.1109/GLOCOM.2012.6503379
Lanjie Zhai, Hong Ji, Xi Li, Yiwen Tang
Cooperative relaying technology among secondary users (SUs) in cognitive radio networks (CRN) is shown to yield a significant performance improvement, such as improving spectrum utilization as well as system fairness in CRN. This paper investigates the problem of the relay selection and resource allocation in a downlink OFDMA cognitive relay network. The objective of this optimization problem is to maximize both system throughput and system fairness, which is achieved through our proposed non-transferable utility coalition graph game algorithm (NTU-CGGA). In this algorithm, the SUs with more available channels can help SUs with less available channels to improve their utility in terms of the throughput and fairness by forming a directed tree graph. The coalition graph is formatted according to spectrum availability and traffic demands of SUs by using merge-split rule. So it can effectively exploit both space and frequency diversity of the system. Simulation results show that, NTU-CGGA significantly improves system throughput while not reducing the fairness level, which has a better performance comparing with other existing algorithms.
{"title":"Coalition Graph Game for joint relay selection and resource allocation in cooperative cognitive radio networks","authors":"Lanjie Zhai, Hong Ji, Xi Li, Yiwen Tang","doi":"10.1109/GLOCOM.2012.6503379","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503379","url":null,"abstract":"Cooperative relaying technology among secondary users (SUs) in cognitive radio networks (CRN) is shown to yield a significant performance improvement, such as improving spectrum utilization as well as system fairness in CRN. This paper investigates the problem of the relay selection and resource allocation in a downlink OFDMA cognitive relay network. The objective of this optimization problem is to maximize both system throughput and system fairness, which is achieved through our proposed non-transferable utility coalition graph game algorithm (NTU-CGGA). In this algorithm, the SUs with more available channels can help SUs with less available channels to improve their utility in terms of the throughput and fairness by forming a directed tree graph. The coalition graph is formatted according to spectrum availability and traffic demands of SUs by using merge-split rule. So it can effectively exploit both space and frequency diversity of the system. Simulation results show that, NTU-CGGA significantly improves system throughput while not reducing the fairness level, which has a better performance comparing with other existing algorithms.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"14 1","pages":"1818-1823"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81211931","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 : 2012-12-01DOI: 10.1109/GLOCOM.2012.6503276
X. Tan, Liang Li, Wei Guo
To improve the utilization of spectrum resource, a primary network can share its unused bandwidth with a closely located secondary network. As a compensation, the latter should pay a certain price for the obtained bandwidth. To determine this price under the constraint that the primary network only knows an incomplete information for the utility of the secondary network, the present paper consider the repeated offering of a price from the primary network to the secondary network, which then can accept or reject it, until they reach a price agreement. Since this bargaining process helps the primary network estimate the real utility of the secondary network as accurate as possible, the agreed price is mutually beneficial for both networks. Moreover, to increase the satisfaction of all secondary terminals in transmitting heterogeneous applications, i.e., voice, video, image, and data, we also propose a spectrum allocation solution within the secondary network based on Nash bargaining model. Numerical simulation shows that the benefits of the two networks from spectrum sharing varies with their maximal bargaining times and the proposed spectrum allocation scheme can improve the total satisfaction of all secondary terminals while maintain a reasonable fairness among them.
{"title":"Bargaining-based spectrum sharing for cognitive radio networks with incomplete information","authors":"X. Tan, Liang Li, Wei Guo","doi":"10.1109/GLOCOM.2012.6503276","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503276","url":null,"abstract":"To improve the utilization of spectrum resource, a primary network can share its unused bandwidth with a closely located secondary network. As a compensation, the latter should pay a certain price for the obtained bandwidth. To determine this price under the constraint that the primary network only knows an incomplete information for the utility of the secondary network, the present paper consider the repeated offering of a price from the primary network to the secondary network, which then can accept or reject it, until they reach a price agreement. Since this bargaining process helps the primary network estimate the real utility of the secondary network as accurate as possible, the agreed price is mutually beneficial for both networks. Moreover, to increase the satisfaction of all secondary terminals in transmitting heterogeneous applications, i.e., voice, video, image, and data, we also propose a spectrum allocation solution within the secondary network based on Nash bargaining model. Numerical simulation shows that the benefits of the two networks from spectrum sharing varies with their maximal bargaining times and the proposed spectrum allocation scheme can improve the total satisfaction of all secondary terminals while maintain a reasonable fairness among them.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"33 1","pages":"1198-1204"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89315034","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
扫码关注我们
求助内容：
应助结果提醒方式：