Pub Date : 2014-04-06DOI: 10.1109/WCNC.2014.6953120
M. Monemian, M. Mahdavi
In cognitive radio networks (CRNs) unlicensed Secondary Users (SU) are allowed to access the resources of licensed Primary Users (PU), if they do not make harmful interference to them. In Cooperative Spectrum Sensing (CSS), SUs sense the spectrum independently and send their sensing information to a fusion center combining the received information and making the final decision about the PU presence. The reliability of decision that FC makes is improved by CSS. However, the various requirements of SUs such as battery constraints are not usually considered during CSS process. Therefore, in this paper an energy based user selection algorithm is proposed in which the participants in CSS are selected based on their energy constraints. Our proposed algorithm prevents from early finishing the battery life of SUs by balanced distribution of sensing process among all of them. Numerical results confirm the improved performance of the proposed algorithm in comparison with conventional ones.
在认知无线网络(cognitive radio network, crn)中，如果未授权的从用户(Secondary user, SU)不对授权的主用户(Primary user, PU)造成有害干扰，则允许未授权的从用户(Secondary user)访问已授权的主用户(Primary user)的资源。在协同频谱感知(CSS)中，单个单元独立感知频谱，并将其感知信息发送到融合中心，并结合接收到的信息对PU的存在做出最终决策。CSS提高了FC决策的可靠性。然而，在CSS过程中，通常不会考虑单元的各种要求，例如电池约束。为此，本文提出了一种基于能量的用户选择算法，该算法根据用户的能量约束选择CSS中的参与者。我们提出的算法通过在所有单元之间均衡分配感知过程来防止单元的电池寿命过早结束。数值结果表明，与传统算法相比，该算法的性能有所提高。
{"title":"Sensing user selection based on energy constraints in cognitive radio networks","authors":"M. Monemian, M. Mahdavi","doi":"10.1109/WCNC.2014.6953120","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6953120","url":null,"abstract":"In cognitive radio networks (CRNs) unlicensed Secondary Users (SU) are allowed to access the resources of licensed Primary Users (PU), if they do not make harmful interference to them. In Cooperative Spectrum Sensing (CSS), SUs sense the spectrum independently and send their sensing information to a fusion center combining the received information and making the final decision about the PU presence. The reliability of decision that FC makes is improved by CSS. However, the various requirements of SUs such as battery constraints are not usually considered during CSS process. Therefore, in this paper an energy based user selection algorithm is proposed in which the participants in CSS are selected based on their energy constraints. Our proposed algorithm prevents from early finishing the battery life of SUs by balanced distribution of sensing process among all of them. Numerical results confirm the improved performance of the proposed algorithm in comparison with conventional ones.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125151024","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 : 2014-04-06DOI: 10.1109/WCNC.2014.6953089
Qian Hu, Muqing Wu, Song Guo
Content-Centric Networking (CCN) focuses on content acquisition rather than end-to-end communication by decoupling content resources from special hosts. CCN does not need maintain stable paths between nodes and is independent of IP addresses, which make CCN convenient and efficient for mobile ad hoc network (MANET). In this paper, we develop an analytical model of content acquisition for Content-Centric MANET (CCM) in two-dimensional case, which considers in-network caching and nodes mobility. Closed-form expressions for round trip time and throughput are derived as functions of miss probabilities. From the expressions, we can obtain the relationship among the round trip time, cache size and content popularity. Simulations show that our model can be used as a guide to design CCM and to evaluate its performance.
{"title":"Modeling content acquisition in two-dimensional content-centric MANETs","authors":"Qian Hu, Muqing Wu, Song Guo","doi":"10.1109/WCNC.2014.6953089","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6953089","url":null,"abstract":"Content-Centric Networking (CCN) focuses on content acquisition rather than end-to-end communication by decoupling content resources from special hosts. CCN does not need maintain stable paths between nodes and is independent of IP addresses, which make CCN convenient and efficient for mobile ad hoc network (MANET). In this paper, we develop an analytical model of content acquisition for Content-Centric MANET (CCM) in two-dimensional case, which considers in-network caching and nodes mobility. Closed-form expressions for round trip time and throughput are derived as functions of miss probabilities. From the expressions, we can obtain the relationship among the round trip time, cache size and content popularity. Simulations show that our model can be used as a guide to design CCM and to evaluate its performance.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125188351","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 : 2014-04-06DOI: 10.1109/WCNC.2014.6952640
Zhongliang Zhao, D. Rosário, T. Braun, E. Cerqueira
Opportunistic routing (OR) employs a list of candidates to improve reliability of wireless transmission. However, list-based OR features restrict the freedom of opportunism, since only the listed nodes can compete for packet forwarding. Additionally, the list is statically generated based on a single metric prior to data transmission, which is not appropriate for mobile ad-hoc networks. This paper provides a thorough performance evaluation of a new protocol - Context-aware Opportunistic Routing (COR). The contributions of COR are threefold. First, it uses various types of context information simultaneously such as link quality, geographic progress, and residual energy of nodes to make routing decisions. Second, it allows all qualified nodes to participate in packet forwarding. Third, it exploits the relative mobility of nodes to further improve performance. Simulation results show that COR can provide efficient routing in mobile environments, and it outperforms existing solutions that solely rely on a single metric by nearly 20-40 %.
{"title":"Context-aware opportunistic routing in mobile ad-hoc networks incorporating node mobility","authors":"Zhongliang Zhao, D. Rosário, T. Braun, E. Cerqueira","doi":"10.1109/WCNC.2014.6952640","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6952640","url":null,"abstract":"Opportunistic routing (OR) employs a list of candidates to improve reliability of wireless transmission. However, list-based OR features restrict the freedom of opportunism, since only the listed nodes can compete for packet forwarding. Additionally, the list is statically generated based on a single metric prior to data transmission, which is not appropriate for mobile ad-hoc networks. This paper provides a thorough performance evaluation of a new protocol - Context-aware Opportunistic Routing (COR). The contributions of COR are threefold. First, it uses various types of context information simultaneously such as link quality, geographic progress, and residual energy of nodes to make routing decisions. Second, it allows all qualified nodes to participate in packet forwarding. Third, it exploits the relative mobility of nodes to further improve performance. Simulation results show that COR can provide efficient routing in mobile environments, and it outperforms existing solutions that solely rely on a single metric by nearly 20-40 %.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"174 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126783406","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 : 2014-04-06DOI: 10.1109/WCNC.2014.6952163
Amir Minayi Jalil, V. Meghdadi, J. Cances
A new distributed coding scheme is proposed to achieve diversity in a network comprising multiple sources, multiple relays, and a single destination. This scheme is based on a distributed implementation of linear block codes, where each relay is assigned to a subset of the source nodes using the channel state information (CSI) of the source-relay (SR) channels. The proposed scheme achieves diversity without using the CSI of the relay-destination (R-D) channels for relay assignment. On the other hand, in classical distributed coding schemes, it is usually assumed that each relay can fully decide if its received symbols are successfully decoded. This is achieved by using complicated coding schemes in S-R channels, which is also vulnerable to quasi-static fading. The proposed scheme achieves the intended diversity without using this extra coding/overhead. For the resulting relay assignment problem, we propose an algorithm based on the max-min criterion.
{"title":"Distributed coding based on partial relay selection","authors":"Amir Minayi Jalil, V. Meghdadi, J. Cances","doi":"10.1109/WCNC.2014.6952163","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6952163","url":null,"abstract":"A new distributed coding scheme is proposed to achieve diversity in a network comprising multiple sources, multiple relays, and a single destination. This scheme is based on a distributed implementation of linear block codes, where each relay is assigned to a subset of the source nodes using the channel state information (CSI) of the source-relay (SR) channels. The proposed scheme achieves diversity without using the CSI of the relay-destination (R-D) channels for relay assignment. On the other hand, in classical distributed coding schemes, it is usually assumed that each relay can fully decide if its received symbols are successfully decoded. This is achieved by using complicated coding schemes in S-R channels, which is also vulnerable to quasi-static fading. The proposed scheme achieves the intended diversity without using this extra coding/overhead. For the resulting relay assignment problem, we propose an algorithm based on the max-min criterion.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114928685","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 : 2014-04-06DOI: 10.1109/WCNC.2014.6952569
Jin-Seok Han, Jae-Seok Bang, Yong-Hwan Lee
Wireless sensor networks operating in 2.4 GHz ISM band are seriously affected by interference from coexisting radio systems such as IEEE 802.11× wireless local area networks. In this paper, we investigate the transmission performance of wireless sensor networks in the presence of co-channel interference. We first analyze the probability of transmission failure and data throughput associated with transmission schemes in interference environments. The transmission schemes are modeled using a Markov chain taking into account the detection probability of channel sensing detector and the interference channel characteristics. Then, we determine the packet size to maximize the data throughput in the presence of co-channel interference. It is shown that the data throughput and energy consumption are affected by the packet size, data transmission rate, data transmission scheme, detection probability of channel sensing detector, and interference channel characteristics.
{"title":"Transmission performance of wireless sensor networks in the presence of co-channel interference","authors":"Jin-Seok Han, Jae-Seok Bang, Yong-Hwan Lee","doi":"10.1109/WCNC.2014.6952569","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6952569","url":null,"abstract":"Wireless sensor networks operating in 2.4 GHz ISM band are seriously affected by interference from coexisting radio systems such as IEEE 802.11× wireless local area networks. In this paper, we investigate the transmission performance of wireless sensor networks in the presence of co-channel interference. We first analyze the probability of transmission failure and data throughput associated with transmission schemes in interference environments. The transmission schemes are modeled using a Markov chain taking into account the detection probability of channel sensing detector and the interference channel characteristics. Then, we determine the packet size to maximize the data throughput in the presence of co-channel interference. It is shown that the data throughput and energy consumption are affected by the packet size, data transmission rate, data transmission scheme, detection probability of channel sensing detector, and interference channel characteristics.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"309 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116116924","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 : 2014-04-06DOI: 10.1109/WCNC.2014.6952207
Hamdi Joudeh, M. Gurcan
Recently, Multiflow transmission has been standardized as part of Multipoint High-Speed Downlink Packet Access (HSDPA). Multiflow schemes enable cell-edge HSDPA users to receive simultaneous data streams from multiple serving cells leading to improved user experience. The standard considers a single transmit antenna for each serving cell in a distributed Per Antenna Rate Control (PARC) manner. This paper investigates the potential gains of utilizing an extra antenna at each cell and hence enabling Beamforming. It is demonstrated that under the proposed transmission scheme, interference aware equalizers can be used without requiring knowledge about the Beamforming antenna weights of interfering cells. Furthermore, it is shown that combining transmit Beamforming with Successive Interference Cancellation (SIC) at the receiver could significantly improve the performance of Multiflow schemes.
{"title":"Beamforming enhanced Multiflow HSDPA with interference cancellation","authors":"Hamdi Joudeh, M. Gurcan","doi":"10.1109/WCNC.2014.6952207","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6952207","url":null,"abstract":"Recently, Multiflow transmission has been standardized as part of Multipoint High-Speed Downlink Packet Access (HSDPA). Multiflow schemes enable cell-edge HSDPA users to receive simultaneous data streams from multiple serving cells leading to improved user experience. The standard considers a single transmit antenna for each serving cell in a distributed Per Antenna Rate Control (PARC) manner. This paper investigates the potential gains of utilizing an extra antenna at each cell and hence enabling Beamforming. It is demonstrated that under the proposed transmission scheme, interference aware equalizers can be used without requiring knowledge about the Beamforming antenna weights of interfering cells. Furthermore, it is shown that combining transmit Beamforming with Successive Interference Cancellation (SIC) at the receiver could significantly improve the performance of Multiflow schemes.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116534780","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 : 2014-04-06DOI: 10.1109/WCNC.2014.6951931
Ahmed Hindy, A. El-Keyi, M. Nafie, A. Tulino
A novel transmission scheme is developed for the downlink frame of cellular networks. Each base station (BS) aims at iteratively balancing the throughput at the mobile stations (MSs) of its cell with the interference it causes at the MSs of the neighboring cells, requiring negligible coordination between the BSs. A simplified version of the scheme that neither requires iterations nor cooperation is also proposed. Simulation results show that the proposed schemes achieve substantial gains over well-known schemes in the literature.
{"title":"A proper throughput-leakage balance for downlink cellular networks","authors":"Ahmed Hindy, A. El-Keyi, M. Nafie, A. Tulino","doi":"10.1109/WCNC.2014.6951931","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6951931","url":null,"abstract":"A novel transmission scheme is developed for the downlink frame of cellular networks. Each base station (BS) aims at iteratively balancing the throughput at the mobile stations (MSs) of its cell with the interference it causes at the MSs of the neighboring cells, requiring negligible coordination between the BSs. A simplified version of the scheme that neither requires iterations nor cooperation is also proposed. Simulation results show that the proposed schemes achieve substantial gains over well-known schemes in the literature.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"132 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114300283","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 : 2014-04-06DOI: 10.1109/WCNC.2014.6952450
H. Kebriaei, B. Maham, D. Niyato
We consider a cellular based primary network coexisting with a secondary network. The primary network consists of multiple service providers (SP) and there are several independent users in the secondary network. The SP are operating on the different frequency spectrum and a group of secondary users intend to share these spectrum with the primary services. This situation is formulated as a bandwidth auction game where each user bids a demand curve and each SP offers a supply curve. We consider two cases of complete information case and incomplete information case or learning games. For two cases, we derive the optimal strategies of the players and the distributed algorithms are presented to obtain the solution of these dynamic games.
{"title":"Supply-demand function equilibrium for double sided bandwidth-auction games","authors":"H. Kebriaei, B. Maham, D. Niyato","doi":"10.1109/WCNC.2014.6952450","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6952450","url":null,"abstract":"We consider a cellular based primary network coexisting with a secondary network. The primary network consists of multiple service providers (SP) and there are several independent users in the secondary network. The SP are operating on the different frequency spectrum and a group of secondary users intend to share these spectrum with the primary services. This situation is formulated as a bandwidth auction game where each user bids a demand curve and each SP offers a supply curve. We consider two cases of complete information case and incomplete information case or learning games. For two cases, we derive the optimal strategies of the players and the distributed algorithms are presented to obtain the solution of these dynamic games.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116756785","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 : 2014-04-06DOI: 10.1109/WCNC.2014.6951940
G. Dahman, Jose Flordelis, F. Tufvesson
Spatially distributed transmission points connected to the same source, known as distributed antenna systems, is one of the promising communication techniques that is capable to improve system performance. The distribution of the transmission points over a large geographical area increases the chances for the receive mobile station (MS) to experience favorable channel conditions from one link or more, simultaneously. However, this anticipated gain depends heavily on the cross-correlation properties of the parameters of different links, especially the large scale parameters (LSP). In this contribution, propagation measurements were used in order to study the cross-correlation of the large-scale fading (LSF) of different links in a distributed antenna system. Multi-site fully-coherent wideband (40 MHz bandwidth) measurements for a semi-urban microcell environment at 2.6 GHz with four base stations (BSs) and one MS were performed. The study of the LSF cross-correlation properties was performed on the global scale (i.e., using the LSF values of the full measurement route at once), and on the local scale (i.e., over local areas of hundreds of wavelengths long). It was found that, for the investigated environment, analyzing the LSF cross-correlation properties on the local scale gives better insight compared to performing the analysis on the global scale; the variations of the LSF of the different links are caused mainly by independent interacting objects (IOs), which reduce the probability of having all the links degrade simultaneously; and a Gaussian distribution can be used to model the cross-correlation coefficients for each link pairs.
{"title":"On the cross-correlation properties of large-scale fading in distributed antenna systems","authors":"G. Dahman, Jose Flordelis, F. Tufvesson","doi":"10.1109/WCNC.2014.6951940","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6951940","url":null,"abstract":"Spatially distributed transmission points connected to the same source, known as distributed antenna systems, is one of the promising communication techniques that is capable to improve system performance. The distribution of the transmission points over a large geographical area increases the chances for the receive mobile station (MS) to experience favorable channel conditions from one link or more, simultaneously. However, this anticipated gain depends heavily on the cross-correlation properties of the parameters of different links, especially the large scale parameters (LSP). In this contribution, propagation measurements were used in order to study the cross-correlation of the large-scale fading (LSF) of different links in a distributed antenna system. Multi-site fully-coherent wideband (40 MHz bandwidth) measurements for a semi-urban microcell environment at 2.6 GHz with four base stations (BSs) and one MS were performed. The study of the LSF cross-correlation properties was performed on the global scale (i.e., using the LSF values of the full measurement route at once), and on the local scale (i.e., over local areas of hundreds of wavelengths long). It was found that, for the investigated environment, analyzing the LSF cross-correlation properties on the local scale gives better insight compared to performing the analysis on the global scale; the variations of the LSF of the different links are caused mainly by independent interacting objects (IOs), which reduce the probability of having all the links degrade simultaneously; and a Gaussian distribution can be used to model the cross-correlation coefficients for each link pairs.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129555401","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 : 2014-04-06DOI: 10.1109/WCNC.2014.6952524
Dawei Wang, Pinyi Ren, Yichen Wang
Aiming at reducing the outage probability of primary users (PU) and obtaining spectrum resources for secondary users (SU), in this paper, we proposed a joint subcarrier and power allocation scheme (JSPA) for reciprocally-benefited spectrum sharing with SUs cooperating with PUs. In JSPA scheme, SUs adopt the decode-and-forward (DF) relaying protocol to help PUs in a two-stage way. Meanwhile, a fraction of unallocated licensed spectrum is allocated for the secondary transmission in every stage. However, if the two-stage cooperation still cannot satisfy PUs' outage quality-of-service (QoS) requirement, SUs then switch to the access mode to entirely capture the licensed spectrum. Our proposal is to maximize the average transmission rate of SUs through joint allocation of subcarriers and power. The closed-form expressions about the outage probability and average transmission rate of both PUs and SUs are derived. Simulation results show that compared with the conventional cognitive cooperation schemes, the average transmission rate of SUs improves.
为了降低主用户(PU)的中断概率，为次用户(SU)获取频谱资源，本文提出了一种联合子载波和功率分配方案(JSPA)，实现主用户与副用户的频谱互惠共享。在JSPA方案中，su采用DF (decode and forward)中继协议，分两阶段帮助pu。同时，在每个阶段分配一部分未分配的许可频谱用于二次传输。但是，如果两阶段合作仍然不能满足pu的中断服务质量(QoS)要求，则su切换到接入模式以完全捕获许可频谱。我们的建议是通过联合分配子载波和功率来最大化单元的平均传输速率。导出了pu和su的停电概率和平均传输速率的封闭表达式。仿真结果表明，与传统的认知协作方案相比，SUs的平均传输速率有所提高。
{"title":"Joint subcarrier and power allocation for reciprocally-benefited spectrum sharing in cognitive radio networks","authors":"Dawei Wang, Pinyi Ren, Yichen Wang","doi":"10.1109/WCNC.2014.6952524","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6952524","url":null,"abstract":"Aiming at reducing the outage probability of primary users (PU) and obtaining spectrum resources for secondary users (SU), in this paper, we proposed a joint subcarrier and power allocation scheme (JSPA) for reciprocally-benefited spectrum sharing with SUs cooperating with PUs. In JSPA scheme, SUs adopt the decode-and-forward (DF) relaying protocol to help PUs in a two-stage way. Meanwhile, a fraction of unallocated licensed spectrum is allocated for the secondary transmission in every stage. However, if the two-stage cooperation still cannot satisfy PUs' outage quality-of-service (QoS) requirement, SUs then switch to the access mode to entirely capture the licensed spectrum. Our proposal is to maximize the average transmission rate of SUs through joint allocation of subcarriers and power. The closed-form expressions about the outage probability and average transmission rate of both PUs and SUs are derived. Simulation results show that compared with the conventional cognitive cooperation schemes, the average transmission rate of SUs improves.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129756801","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
扫码关注我们
求助内容：
应助结果提醒方式：