Pub Date : 2012-06-10DOI: 10.1109/ICC.2012.6364821
S. S. Husain, LaeYoung Kim, T. Koshimizu, A. Kunz
This paper mainly explains an enhanced domain handover scheme for VoLTE (Voice over LTE) called eSRVCC. The scheme is essential in order to ensure the carrier-grade voice call quality; especially during the network migration phase from legacy circuit switched system to the All IP based EPS (Evolved Packet System). In addition, this paper explains the new mechanisms to support VoLTE in roaming scenarios.
本文主要介绍了一种用于VoLTE (Voice over LTE)的增强域切换方案——eSRVCC。为了保证电信级的语音通话质量，该方案必不可少;特别是在从传统电路交换系统到基于全IP的EPS(演进分组系统)的网络迁移阶段。此外，本文还解释了在漫游场景下支持VoLTE的新机制。
{"title":"Enhanced voice over LTE and its roaming aspects","authors":"S. S. Husain, LaeYoung Kim, T. Koshimizu, A. Kunz","doi":"10.1109/ICC.2012.6364821","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364821","url":null,"abstract":"This paper mainly explains an enhanced domain handover scheme for VoLTE (Voice over LTE) called eSRVCC. The scheme is essential in order to ensure the carrier-grade voice call quality; especially during the network migration phase from legacy circuit switched system to the All IP based EPS (Evolved Packet System). In addition, this paper explains the new mechanisms to support VoLTE in roaming scenarios.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129845170","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-06-10DOI: 10.1109/ICC.2012.6364572
A. Ghassemi, L. Lampe, T. Gulliver
Tone reservation (TR) has been proposed to reduce the peak-to-average power ratio (PAPR) of orthogonal frequency division multiple access (OFDMA) uplink communication systems. However, it introduces multiple-access interference (MAI) at the receiver. To reduce the effects of MAI, TR was proposed which uses all unused subcarriers at the OFDMA transmitter to generate a peak reduction signal under power spectral density constraints. However, the accumulated MAI at the receiver can be significant, which leads to performance degradation. To address this problem, we consider both PAPR and MAI reduction using TR and propose ordering the subcarriers before allocating the peak reduction tones. In so doing, we are able to achieve PAPR reduction with causing only minimal MAI.
{"title":"Tone reservation based peak power reduction in OFDMA uplink systems","authors":"A. Ghassemi, L. Lampe, T. Gulliver","doi":"10.1109/ICC.2012.6364572","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364572","url":null,"abstract":"Tone reservation (TR) has been proposed to reduce the peak-to-average power ratio (PAPR) of orthogonal frequency division multiple access (OFDMA) uplink communication systems. However, it introduces multiple-access interference (MAI) at the receiver. To reduce the effects of MAI, TR was proposed which uses all unused subcarriers at the OFDMA transmitter to generate a peak reduction signal under power spectral density constraints. However, the accumulated MAI at the receiver can be significant, which leads to performance degradation. To address this problem, we consider both PAPR and MAI reduction using TR and propose ordering the subcarriers before allocating the peak reduction tones. In so doing, we are able to achieve PAPR reduction with causing only minimal MAI.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128417713","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-06-10DOI: 10.1109/ICC.2012.6364865
S. Filin, H. Harada
Motivated by the large interest in the white space radio systems research, design, and standardization, IEEE Standards Committee on Dynamic Spectrum Networks (IEEE DySPAN-SC) of the IEEE Communications Society Standards Board has started to consider standardization of white space radio systems. IEEE 1900.7 working group (WG) of the IEEE DySPAN-SC is currently developing draft standard for “Radio Interface for White Space Dynamic Spectrum Access Radio Systems Supporting Fixed and Mobile Operation.” This paper describes the current status of the IEEE 1900.7 WG focusing on use cases and associated network topology options and requirements.1
{"title":"IEEE DySPAN-SC activities on standardization of white space radio systems","authors":"S. Filin, H. Harada","doi":"10.1109/ICC.2012.6364865","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364865","url":null,"abstract":"Motivated by the large interest in the white space radio systems research, design, and standardization, IEEE Standards Committee on Dynamic Spectrum Networks (IEEE DySPAN-SC) of the IEEE Communications Society Standards Board has started to consider standardization of white space radio systems. IEEE 1900.7 working group (WG) of the IEEE DySPAN-SC is currently developing draft standard for “Radio Interface for White Space Dynamic Spectrum Access Radio Systems Supporting Fixed and Mobile Operation.” This paper describes the current status of the IEEE 1900.7 WG focusing on use cases and associated network topology options and requirements.1","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128469271","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-06-10DOI: 10.1109/ICC.2012.6363835
Rui Wang, M. Tao
This paper presents an analytical study on the outage performance of amplify-and-forward (AF) two-way relay system with multi-antenna relay node (RN). Two major bidirectional protocols, i.e., two time slots multiple access broadcast (MABC) protocol and three time slots time division broadcast (TDBC) protocol, are considered. For both considerations, we first assume that instantaneous channel-state-information (CSI) is unavailable at RN, thus RN just simply uses the fixed relay gain derived from statistical CSI to scale the received signals before forwarding. We then consider the scenario where RN can obtain the instantaneous CSI to perform the zero-forcing (ZF) relay precoding. The closed-form expressions of outage probability are derived for all cases. Based on these expressions, the diversity-multiplexing tradeoff (DMT) is further obtained for the MABC protocol. The analytical results show that, for non-precoding MABC scheme, the diversity order is only 1, which is independent to the relay antenna number M. While for the ZF-precoding case, the diversity order of M - 1 can be obtained.
{"title":"Outage performance analysis of two-way relay system with multi-antenna relay node","authors":"Rui Wang, M. Tao","doi":"10.1109/ICC.2012.6363835","DOIUrl":"https://doi.org/10.1109/ICC.2012.6363835","url":null,"abstract":"This paper presents an analytical study on the outage performance of amplify-and-forward (AF) two-way relay system with multi-antenna relay node (RN). Two major bidirectional protocols, i.e., two time slots multiple access broadcast (MABC) protocol and three time slots time division broadcast (TDBC) protocol, are considered. For both considerations, we first assume that instantaneous channel-state-information (CSI) is unavailable at RN, thus RN just simply uses the fixed relay gain derived from statistical CSI to scale the received signals before forwarding. We then consider the scenario where RN can obtain the instantaneous CSI to perform the zero-forcing (ZF) relay precoding. The closed-form expressions of outage probability are derived for all cases. Based on these expressions, the diversity-multiplexing tradeoff (DMT) is further obtained for the MABC protocol. The analytical results show that, for non-precoding MABC scheme, the diversity order is only 1, which is independent to the relay antenna number M. While for the ZF-precoding case, the diversity order of M - 1 can be obtained.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128504807","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-06-10DOI: 10.1109/ICC.2012.6364533
Hongxia Sun, Chuan Wu
Recent years have witnessed the prosperity of mobile social networks, where various information is shared among mobile users through their opportunistic contacts. To investigate efficiency of information dissemination in wireless networks, epidemic models have been employed to study message forwarding delays, presuming message delivery whenever an opportunistic contact occurs. A practical concern is typically neglected, that one mobile user may only be willing to pass information onto others with social ties, rather than anyone upon contact. Under such a constraint, information dissemination may behave differently, according to the pattern of social ties that exist in the network. In this paper, we model social-aware epidemic forwarding in mobile social networks using mean-field equations, and carefully study the end-to-end unicast message propagation delays under different levels of social ties among users. Both cases of limited and unlimited message validity are considered in our models, i.e., whether relay nodes may delete a message after carrying it for some finite time T or never. Through careful theoretical analysis and empirical studies, we made a number of intriguing observations: First, the topology of social relation graphs significantly influences message forwarding delays, i.e., the more skewed the social relationship distribution is, the larger delay it results in. Second, the average delivery delay remains fairly stable with the growth of system scale, presenting a sharp contrast with the case without social awareness. Third, we observe that with a moderate choice of T, message delivery can achieve a successful ratio of almost 100% with an expected delay very close to the case of unlimited validity, signifying that a good tradeoff can be achieved between end-to-end message delivery efficiency and energy/storage overhead at the relay nodes in a network. All these provide useful guidance for efficient information dissemination protocol design in practical mobile social networks.
{"title":"Epidemic forwarding in mobile social networks","authors":"Hongxia Sun, Chuan Wu","doi":"10.1109/ICC.2012.6364533","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364533","url":null,"abstract":"Recent years have witnessed the prosperity of mobile social networks, where various information is shared among mobile users through their opportunistic contacts. To investigate efficiency of information dissemination in wireless networks, epidemic models have been employed to study message forwarding delays, presuming message delivery whenever an opportunistic contact occurs. A practical concern is typically neglected, that one mobile user may only be willing to pass information onto others with social ties, rather than anyone upon contact. Under such a constraint, information dissemination may behave differently, according to the pattern of social ties that exist in the network. In this paper, we model social-aware epidemic forwarding in mobile social networks using mean-field equations, and carefully study the end-to-end unicast message propagation delays under different levels of social ties among users. Both cases of limited and unlimited message validity are considered in our models, i.e., whether relay nodes may delete a message after carrying it for some finite time T or never. Through careful theoretical analysis and empirical studies, we made a number of intriguing observations: First, the topology of social relation graphs significantly influences message forwarding delays, i.e., the more skewed the social relationship distribution is, the larger delay it results in. Second, the average delivery delay remains fairly stable with the growth of system scale, presenting a sharp contrast with the case without social awareness. Third, we observe that with a moderate choice of T, message delivery can achieve a successful ratio of almost 100% with an expected delay very close to the case of unlimited validity, signifying that a good tradeoff can be achieved between end-to-end message delivery efficiency and energy/storage overhead at the relay nodes in a network. All these provide useful guidance for efficient information dissemination protocol design in practical mobile social networks.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128293836","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-06-10DOI: 10.1109/ICC.2012.6364981
Chris Develder, J. Buysse, M. D. Leenheer, B. Jaumard, B. Dhoedt
In this paper we address the problem of dimensioning infrastructure, comprising both network and server resources, for large-scale decentralized distributed systems such as grids or clouds. We will provide an overview of our work in this area, and in particular focus on how to design the resulting grid/cloud to be resilient against network link and/or server site failures. To this end, we will exploit relocation: under failure conditions, a request may be sent to an alternate destination than the one under failure-free conditions. We will provide a comprehensive overview of related work in this area, and focus in some detail on our own most recent work. The latter comprises a case study where traffic has a known origin, but we assume a degree of freedom as to where its end up being processed, which is typically the case for e.g., grid applications of the bag-of-tasks (BoT) type or for providing cloud services. In particular, we will provide in this paper a new integer linear programming (ILP) formulation to solve the resilient grid/cloud dimensioning problem using failure-dependent backup routes. Our algorithm will simultaneously decide on server and network capacity. We find that in the anycast routing problem we address, the benefit of using failure-dependent (FD) rerouting is limited compared to failure-independent (FID) backup routing. We confirm our earlier findings in terms of network capacity savings achieved by relocation compared to not exploiting relocation (order of 6-10% in the current case studies).
{"title":"Resilient network dimensioning for optical grid/clouds using relocation","authors":"Chris Develder, J. Buysse, M. D. Leenheer, B. Jaumard, B. Dhoedt","doi":"10.1109/ICC.2012.6364981","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364981","url":null,"abstract":"In this paper we address the problem of dimensioning infrastructure, comprising both network and server resources, for large-scale decentralized distributed systems such as grids or clouds. We will provide an overview of our work in this area, and in particular focus on how to design the resulting grid/cloud to be resilient against network link and/or server site failures. To this end, we will exploit relocation: under failure conditions, a request may be sent to an alternate destination than the one under failure-free conditions. We will provide a comprehensive overview of related work in this area, and focus in some detail on our own most recent work. The latter comprises a case study where traffic has a known origin, but we assume a degree of freedom as to where its end up being processed, which is typically the case for e.g., grid applications of the bag-of-tasks (BoT) type or for providing cloud services. In particular, we will provide in this paper a new integer linear programming (ILP) formulation to solve the resilient grid/cloud dimensioning problem using failure-dependent backup routes. Our algorithm will simultaneously decide on server and network capacity. We find that in the anycast routing problem we address, the benefit of using failure-dependent (FD) rerouting is limited compared to failure-independent (FID) backup routing. We confirm our earlier findings in terms of network capacity savings achieved by relocation compared to not exploiting relocation (order of 6-10% in the current case studies).","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128569349","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-06-10DOI: 10.1109/ICC.2012.6364377
Z. Zeinalkhani, A. Banihashemi
A major task in cognitive radios (CRs) is spectrum sensing. In a wide-band regime, this is a challenging task requiring very high-speed analog-to-digital converters (ADCs), operating at or above the Nyquist rate. Compressed sensing is recognized as an effective technique to significantly reduce the sampling rate in wideband spectrum sensing, taking advantage of the sparsity of the spectrum. The recovery of the spectrum from the samples at sub-Nyquist rates is usually achieved through the so-called ℓ1-norm minimization. A more effective recovery technique for block sparse signals, called ℓ2/ℓ1-norm minimization, can be used as a replacement for ℓ1-norm minimization to reduce the sampling rate and consequently simplify the implementation of ADCs even further. In this paper, we propose two iterative ℓ2/ ℓ1-norm minimization algorithms for the recovery of block sparse spectrums. Similar to the standard ℓ2/ℓ1-norm minimization, the proposed algorithms require the side information about the boundaries of the spectral blocks. We evaluate the performance of the proposed algorithms both in the absence and in the presence of noise, and demonstrate that for both cases, the proposed algorithms significantly outperform the existing ℓ1-minimization-based and standard ℓ2/ℓ1 minimization recovery algorithms. The improvement in performance comes at a small cost in complexity increase.
{"title":"Iterative recovery algorithms for compressed sensing of wideband block sparse spectrums","authors":"Z. Zeinalkhani, A. Banihashemi","doi":"10.1109/ICC.2012.6364377","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364377","url":null,"abstract":"A major task in cognitive radios (CRs) is spectrum sensing. In a wide-band regime, this is a challenging task requiring very high-speed analog-to-digital converters (ADCs), operating at or above the Nyquist rate. Compressed sensing is recognized as an effective technique to significantly reduce the sampling rate in wideband spectrum sensing, taking advantage of the sparsity of the spectrum. The recovery of the spectrum from the samples at sub-Nyquist rates is usually achieved through the so-called ℓ<sub>1</sub>-norm minimization. A more effective recovery technique for block sparse signals, called ℓ<sub>2</sub>/ℓ<sub>1</sub>-norm minimization, can be used as a replacement for ℓ<sub>1</sub>-norm minimization to reduce the sampling rate and consequently simplify the implementation of ADCs even further. In this paper, we propose two iterative ℓ<sub>2</sub>/ ℓ<sub>1</sub>-norm minimization algorithms for the recovery of block sparse spectrums. Similar to the standard ℓ<sub>2</sub>/ℓ<sub>1</sub>-norm minimization, the proposed algorithms require the side information about the boundaries of the spectral blocks. We evaluate the performance of the proposed algorithms both in the absence and in the presence of noise, and demonstrate that for both cases, the proposed algorithms significantly outperform the existing ℓ<sub>1</sub>-minimization-based and standard ℓ<sub>2</sub>/ℓ<sub>1</sub> minimization recovery algorithms. The improvement in performance comes at a small cost in complexity increase.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128739572","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-06-10DOI: 10.1109/ICC.2012.6363999
A. Fehske, G. Fettweis
In order to meet increasing traffic demands, future generations of cellular networks are characterized by decreasing cell sizes at full frequency reuse. Due to inevitable inter-cell interference, load conditions in neighboring cells can no longer be considered independent. Unfortunately, the adequate flow level model for such a setup is analytically intractable. Utilizing aggregation techniques, which were originally proposed to analyze large state models in economics, we propose a framework to compute the average base station loads based on an approximation of the joint stationary distribution of the number of active flows in all cells. The technique proposed requires solving a system of linear equations whose dimension increases exponentially with the number of cells. Since such a system is essentially intractable for large networks, we propose a fixed point algorithm to compute approximate base station loads based on the notion of average interference. Numerical results validate the accuracy of both modeling techniques. The modeling approach presented in this paper is essential for accurate characterization of cell throughput as well as base station energy consumption under varying load conditions.
{"title":"Aggregation of variables in load models for interference-coupled cellular data networks","authors":"A. Fehske, G. Fettweis","doi":"10.1109/ICC.2012.6363999","DOIUrl":"https://doi.org/10.1109/ICC.2012.6363999","url":null,"abstract":"In order to meet increasing traffic demands, future generations of cellular networks are characterized by decreasing cell sizes at full frequency reuse. Due to inevitable inter-cell interference, load conditions in neighboring cells can no longer be considered independent. Unfortunately, the adequate flow level model for such a setup is analytically intractable. Utilizing aggregation techniques, which were originally proposed to analyze large state models in economics, we propose a framework to compute the average base station loads based on an approximation of the joint stationary distribution of the number of active flows in all cells. The technique proposed requires solving a system of linear equations whose dimension increases exponentially with the number of cells. Since such a system is essentially intractable for large networks, we propose a fixed point algorithm to compute approximate base station loads based on the notion of average interference. Numerical results validate the accuracy of both modeling techniques. The modeling approach presented in this paper is essential for accurate characterization of cell throughput as well as base station energy consumption under varying load conditions.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129264419","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-06-10DOI: 10.1109/ICC.2012.6364711
D. D. Zenobio, K. Steenhaut, M. Celidonio, E. Sergio, Y. Verbelen
Much has been written about the benefits of wireless sensors which enable measurements in harsh or hermetic environments. However, the problem concerning battery replacement is still open. This paper presents a new solution for a wireless self-powered sensors network, which allows the harvesting of energy from the action of a turbine wheel rotating in the path of a fluid stream environment. This new family of devices can find application in water/gas smart metering systems, subject of very large interest today. Furthermore, the proposed approach suggests a wireless network planning designed to eliminate problems related to a large cell radio architecture.
{"title":"A self-powered wireless sensor for water/gas metering systems","authors":"D. D. Zenobio, K. Steenhaut, M. Celidonio, E. Sergio, Y. Verbelen","doi":"10.1109/ICC.2012.6364711","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364711","url":null,"abstract":"Much has been written about the benefits of wireless sensors which enable measurements in harsh or hermetic environments. However, the problem concerning battery replacement is still open. This paper presents a new solution for a wireless self-powered sensors network, which allows the harvesting of energy from the action of a turbine wheel rotating in the path of a fluid stream environment. This new family of devices can find application in water/gas smart metering systems, subject of very large interest today. Furthermore, the proposed approach suggests a wireless network planning designed to eliminate problems related to a large cell radio architecture.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129364087","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-06-10DOI: 10.1109/ICC.2012.6364264
N. Abuali, A. Taha
In this paper we present a joint resource allocation and optimal relay selection scheme that meets the data rate QoS requirement of traffic in OFDMA networks. The proposed scheme selects the relay that best utilizes the attainable data rate for all subcarriers, as opposed to existing works which are based on selecting the optimal relay independently per single subcarrier. The scheme is further designed as a finite horizon Markov Decision Process (MDP). Simulation results show that the proposed scheme outperforms representative existing schemes in terms of the network total throughput and end-to-end outage probability.
{"title":"An MDP-based model for optimal relay selection in OFDMA cooperative networks","authors":"N. Abuali, A. Taha","doi":"10.1109/ICC.2012.6364264","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364264","url":null,"abstract":"In this paper we present a joint resource allocation and optimal relay selection scheme that meets the data rate QoS requirement of traffic in OFDMA networks. The proposed scheme selects the relay that best utilizes the attainable data rate for all subcarriers, as opposed to existing works which are based on selecting the optimal relay independently per single subcarrier. The scheme is further designed as a finite horizon Markov Decision Process (MDP). Simulation results show that the proposed scheme outperforms representative existing schemes in terms of the network total throughput and end-to-end outage probability.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129434712","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
扫码关注我们
求助内容：
应助结果提醒方式：