Pub Date : 2015-06-08DOI: 10.1109/ICCW.2015.7247266
Arash Shahmansoori, G. Seco-Granados, H. Wymeersch
Reliable and accurate localization of users is critical for many applications in wireless networks. In range-based localization, the position of a node (agent) can be estimated using distance measurements to nodes with known positions (anchors). Optimal power allocation of the anchors reduces positioning error and improves network lifetime and throughput. We formulate and solve a robust power allocation optimization problem with a constraint on the localization accuracy for multicast and unicast orthogonal frequency division multiplexing signals. The localization accuracy is expressed in terms of the expected squared position error bound, accounting for uncertainties in the wireless channel as well as in the agents' positions. Simulation results show that robust power allocation improves localization accuracy compared to non-robust power allocation, with only a limited power penalty.
{"title":"Robust power allocation for OFDM wireless network localization","authors":"Arash Shahmansoori, G. Seco-Granados, H. Wymeersch","doi":"10.1109/ICCW.2015.7247266","DOIUrl":"https://doi.org/10.1109/ICCW.2015.7247266","url":null,"abstract":"Reliable and accurate localization of users is critical for many applications in wireless networks. In range-based localization, the position of a node (agent) can be estimated using distance measurements to nodes with known positions (anchors). Optimal power allocation of the anchors reduces positioning error and improves network lifetime and throughput. We formulate and solve a robust power allocation optimization problem with a constraint on the localization accuracy for multicast and unicast orthogonal frequency division multiplexing signals. The localization accuracy is expressed in terms of the expected squared position error bound, accounting for uncertainties in the wireless channel as well as in the agents' positions. Simulation results show that robust power allocation improves localization accuracy compared to non-robust power allocation, with only a limited power penalty.","PeriodicalId":6464,"journal":{"name":"2015 IEEE International Conference on Communication Workshop (ICCW)","volume":"72 1","pages":"718-723"},"PeriodicalIF":0.0,"publicationDate":"2015-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83730513","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-06-08DOI: 10.1109/ICCW.2015.7247489
Gabor Hannak, M. Mayer, A. Jung, G. Matz, N. Goertz
We consider overloaded (non-orthogonal) code division multiple access multiuser wireless communication systems with many transmitting users and one central aggregation node, a typical scenario in e.g. machine-to-machine communications. The task of the central node is to detect the set of active devices and separate their data streams, whose number at any time instance is relatively small compared to the total number of devices in the system. We introduce a novel two-step detection procedure: the first step involves the simultaneous transmission of a pilot sequence used for identification of the active devices and the estimation of their respective channel coefficients. In the second step the payload is transmitted by all active devices and received synchronously at the central node. The first step reduces to a compressed sensing (CS) problem due to the relatively small number of simultaneously active devices. Using an efficient CS recovery scheme (approximate message passing), joint activity detection and channel estimation with high reliability is possible, even for extremely large-scale systems. This, in turn, reduces the data detection task to a simple overdetermined system of linear equations that is then solved by classical methods in the second step.
{"title":"Joint channel estimation and activity detection for multiuser communication systems","authors":"Gabor Hannak, M. Mayer, A. Jung, G. Matz, N. Goertz","doi":"10.1109/ICCW.2015.7247489","DOIUrl":"https://doi.org/10.1109/ICCW.2015.7247489","url":null,"abstract":"We consider overloaded (non-orthogonal) code division multiple access multiuser wireless communication systems with many transmitting users and one central aggregation node, a typical scenario in e.g. machine-to-machine communications. The task of the central node is to detect the set of active devices and separate their data streams, whose number at any time instance is relatively small compared to the total number of devices in the system. We introduce a novel two-step detection procedure: the first step involves the simultaneous transmission of a pilot sequence used for identification of the active devices and the estimation of their respective channel coefficients. In the second step the payload is transmitted by all active devices and received synchronously at the central node. The first step reduces to a compressed sensing (CS) problem due to the relatively small number of simultaneously active devices. Using an efficient CS recovery scheme (approximate message passing), joint activity detection and channel estimation with high reliability is possible, even for extremely large-scale systems. This, in turn, reduces the data detection task to a simple overdetermined system of linear equations that is then solved by classical methods in the second step.","PeriodicalId":6464,"journal":{"name":"2015 IEEE International Conference on Communication Workshop (ICCW)","volume":"33 1","pages":"2086-2091"},"PeriodicalIF":0.0,"publicationDate":"2015-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80281659","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-06-08DOI: 10.1109/ICCW.2015.7247221
Jun Zhang, C. Yuen, Chao-Kai Wen, Shi Jin, Kai‐Kit Wong, Hongbo Zhu
In this paper, we study the multiple-input multiple-output (MIMO) wiretap channel performing simultaneous wireless information and power transfer (SWIPT), where there are a multiple-antenna base station (BS), a multiple-antenna information decoding (ID) user, and a multiple-antenna energy harvesting (EH) user. The messages intended to the ID user need to be kept confidential to the EH user. The channels between BS and users are modeled as fading channels with different spatial correlations and line-of-sight (LoS) components. We assume that only statistical channel state information (CSI) is available at the BS. Our objective is to design the optimal transmit covariance matrix at the BS for maximizing the ergodic secrecy rate subject to the BS power constraint and the harvested energy requirement for the EH user. To this end, we present an approximation for the ergodic secrecy rate by using large dimensional random matrix theory and the method of Taylor series expansion. Based on this, an iterative algorithm is proposed to find the transmit covariance matrix. Simulation results are provided to verify the accuracy of the approximation and the performance of the design.
{"title":"Achievable ergodic secrecy rate for MIMO SWIPT wiretap channels","authors":"Jun Zhang, C. Yuen, Chao-Kai Wen, Shi Jin, Kai‐Kit Wong, Hongbo Zhu","doi":"10.1109/ICCW.2015.7247221","DOIUrl":"https://doi.org/10.1109/ICCW.2015.7247221","url":null,"abstract":"In this paper, we study the multiple-input multiple-output (MIMO) wiretap channel performing simultaneous wireless information and power transfer (SWIPT), where there are a multiple-antenna base station (BS), a multiple-antenna information decoding (ID) user, and a multiple-antenna energy harvesting (EH) user. The messages intended to the ID user need to be kept confidential to the EH user. The channels between BS and users are modeled as fading channels with different spatial correlations and line-of-sight (LoS) components. We assume that only statistical channel state information (CSI) is available at the BS. Our objective is to design the optimal transmit covariance matrix at the BS for maximizing the ergodic secrecy rate subject to the BS power constraint and the harvested energy requirement for the EH user. To this end, we present an approximation for the ergodic secrecy rate by using large dimensional random matrix theory and the method of Taylor series expansion. Based on this, an iterative algorithm is proposed to find the transmit covariance matrix. Simulation results are provided to verify the accuracy of the approximation and the performance of the design.","PeriodicalId":6464,"journal":{"name":"2015 IEEE International Conference on Communication Workshop (ICCW)","volume":"49 1","pages":"453-458"},"PeriodicalIF":0.0,"publicationDate":"2015-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80467895","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-06-08DOI: 10.1109/ICCW.2015.7247164
Khanh Nguyen, Luca Zappaterra, Hyeong-Ah Choi
Traffic demands of mobile radio network have been tremendously increasing in the recent years due to the enormous success of smartphones and their continuous feature evolution requiring higher data rates. Heterogeneous networks (HetNets) consisting of low-power small cells underlying the existing macro cells represent the preferred solution to increase the capacity of cellular systems by means of spatial spectrum reuse. Static uplink/downlink time-division duplexing (TDD) configurations of existing networks cannot satisfy the varying traffic patterns of large number of small cells, which vary among cells and over time. In this paper we propose and evaluate a centralized algorithm for dynamic TDD frame configuration to which operates on a cluster-based cellular network, maximize the network throughput and preserving fairness. Our algorithm is characterized by only O(n log n) time complexity (with n cells in the network), which allows for instantaneous network-wise reconfigurations minimizing overhead. The algorithm is proven to be optimal and time efficient. Extensive simulation results using realistic application traffic have shown the superiority the proposed solution against static TDD configurations of LTE systems. Throughput improvements up to 43% as well as reductions in queued traffic at cells up to 52% are obtained using separate utility functions designed for throughput maximization and fairness respectively.
{"title":"A centralized algorithm for dynamic TDD frame reconfigurations in synchronized HetNets","authors":"Khanh Nguyen, Luca Zappaterra, Hyeong-Ah Choi","doi":"10.1109/ICCW.2015.7247164","DOIUrl":"https://doi.org/10.1109/ICCW.2015.7247164","url":null,"abstract":"Traffic demands of mobile radio network have been tremendously increasing in the recent years due to the enormous success of smartphones and their continuous feature evolution requiring higher data rates. Heterogeneous networks (HetNets) consisting of low-power small cells underlying the existing macro cells represent the preferred solution to increase the capacity of cellular systems by means of spatial spectrum reuse. Static uplink/downlink time-division duplexing (TDD) configurations of existing networks cannot satisfy the varying traffic patterns of large number of small cells, which vary among cells and over time. In this paper we propose and evaluate a centralized algorithm for dynamic TDD frame configuration to which operates on a cluster-based cellular network, maximize the network throughput and preserving fairness. Our algorithm is characterized by only O(n log n) time complexity (with n cells in the network), which allows for instantaneous network-wise reconfigurations minimizing overhead. The algorithm is proven to be optimal and time efficient. Extensive simulation results using realistic application traffic have shown the superiority the proposed solution against static TDD configurations of LTE systems. Throughput improvements up to 43% as well as reductions in queued traffic at cells up to 52% are obtained using separate utility functions designed for throughput maximization and fairness respectively.","PeriodicalId":6464,"journal":{"name":"2015 IEEE International Conference on Communication Workshop (ICCW)","volume":"1 1","pages":"113-118"},"PeriodicalIF":0.0,"publicationDate":"2015-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83046308","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-06-08DOI: 10.1109/ICCW.2015.7247231
A. S. Cacciapuoti, M. Caleffi, L. Paura
Very recently, regulatory bodies worldwide have started to approve the dynamic access of unlicensed networks to the TV White Space spectrum. Hence, in the near future, multiple heterogeneous and unlicensed ad hoc networks will coexist within the same geographical area over shared TV White Space. Although heterogeneity and coexistence are not unique to TV White Space scenarios, their distinctive characteristics pose new and challenging issues. In this paper, the problem of the coexistence interference among multiple heterogeneous and secondary ad hoc networks in absence of secondary cooperation is addressed. Specifically, the optimal coexistence strategy, i.e., the coexistence strategy maximizing the expected throughput in presence of coexistence interference, is designed. More in detail, at first, an analytical framework is developed to model the channel selection process for an arbitrary SN as a decision process, where the reward models the data rate achievable on a channel and the cost models the communication overhead for assessing the coexistence interference. Then, we derive the closed-form expression of the expected throughput, which allows us to determine the optimal coexistence strategy. The theoretical analysis is finally validated through a case study.
{"title":"On the coexistence of cognitive radio ad hoc networks in TV White Space","authors":"A. S. Cacciapuoti, M. Caleffi, L. Paura","doi":"10.1109/ICCW.2015.7247231","DOIUrl":"https://doi.org/10.1109/ICCW.2015.7247231","url":null,"abstract":"Very recently, regulatory bodies worldwide have started to approve the dynamic access of unlicensed networks to the TV White Space spectrum. Hence, in the near future, multiple heterogeneous and unlicensed ad hoc networks will coexist within the same geographical area over shared TV White Space. Although heterogeneity and coexistence are not unique to TV White Space scenarios, their distinctive characteristics pose new and challenging issues. In this paper, the problem of the coexistence interference among multiple heterogeneous and secondary ad hoc networks in absence of secondary cooperation is addressed. Specifically, the optimal coexistence strategy, i.e., the coexistence strategy maximizing the expected throughput in presence of coexistence interference, is designed. More in detail, at first, an analytical framework is developed to model the channel selection process for an arbitrary SN as a decision process, where the reward models the data rate achievable on a channel and the cost models the communication overhead for assessing the coexistence interference. Then, we derive the closed-form expression of the expected throughput, which allows us to determine the optimal coexistence strategy. The theoretical analysis is finally validated through a case study.","PeriodicalId":6464,"journal":{"name":"2015 IEEE International Conference on Communication Workshop (ICCW)","volume":"26 1","pages":"509-513"},"PeriodicalIF":0.0,"publicationDate":"2015-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82236792","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-06-08DOI: 10.1109/ICCW.2015.7247407
E. Altman, F. Pellegrini, Huijuan Wang
In this paper we describe a model for the activation level of users in online dating platforms (ODPs). Such popular systems are conceived in order to match individuals from two groups of potential mates. The business of such platforms pivots around the customers' expectancy to get in contact with their future dates: upon the payment of a fee to the platform owner, ODPs provide specific tools to improve reach and visibility.However, ODPs require a critical number of active users in order to sustain their operations (and their business). Customers of the platform trade off on the price for being more visible and attract mates' contacts. A user becomes inactive if he or she is not contacted by others for some time: being contacted by potential mates acts as an activation signal. The aim of our analysis is to propose a game theoretical framework to capture such a complex activation problem in strategic form. We unveil the structure of Nash equilibria and we further derive a Stackelberg formulation. The latter is a hierarchical game where the platform owner aims at maximizing profits while preserving the ODP activity level above a critical epidemic threshold.
{"title":"Activation games in online dating platforms","authors":"E. Altman, F. Pellegrini, Huijuan Wang","doi":"10.1109/ICCW.2015.7247407","DOIUrl":"https://doi.org/10.1109/ICCW.2015.7247407","url":null,"abstract":"In this paper we describe a model for the activation level of users in online dating platforms (ODPs). Such popular systems are conceived in order to match individuals from two groups of potential mates. The business of such platforms pivots around the customers' expectancy to get in contact with their future dates: upon the payment of a fee to the platform owner, ODPs provide specific tools to improve reach and visibility.However, ODPs require a critical number of active users in order to sustain their operations (and their business). Customers of the platform trade off on the price for being more visible and attract mates' contacts. A user becomes inactive if he or she is not contacted by others for some time: being contacted by potential mates acts as an activation signal. The aim of our analysis is to propose a game theoretical framework to capture such a complex activation problem in strategic form. We unveil the structure of Nash equilibria and we further derive a Stackelberg formulation. The latter is a hierarchical game where the platform owner aims at maximizing profits while preserving the ODP activity level above a critical epidemic threshold.","PeriodicalId":6464,"journal":{"name":"2015 IEEE International Conference on Communication Workshop (ICCW)","volume":"31 1","pages":"1593-1599"},"PeriodicalIF":0.0,"publicationDate":"2015-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82454881","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-06-08DOI: 10.1109/ICCW.2015.7247604
Abdelrahman Arbi, T. O’Farrell
In this paper we evaluate the energy efficiency of a 5G radio access network (RAN) based on LTE technology when comparing two small cell deployment strategies to enhance the RAN capacity. Specifically, we compare densifying a 3-sector macrocell RAN with small cells against first upgrading to a 6-sector macrocell RAN before densifying with small cells. The latter strategy has been used in urban areas by 4G network operators. The energy consumption gain (ECG) is used as a figure of merit in this paper. The radio base station power consumption is estimated by using a realistic power consumption model. Our results show that deploying a small cell overlay in a 3-sector macrocell RAN is more energy efficient than deploying a small cell overlay in a 6-sector macrocell RAN even though the latter uses fewer small cells. Further energy savings can be achieved by implementing an adaptive sectorisation technique. An energy saving of 25% is achieved for 6-sectors when progressively decreasing the number of active sectors from 6 to 1 in accordance with the temporal average traffic load. Irrespective, the 3-sector option with or without incorporating the adaptive sectorisation technique is always more energy efficient.
{"title":"Energy efficiency in 5G access networks: Small cell densification and high order sectorisation","authors":"Abdelrahman Arbi, T. O’Farrell","doi":"10.1109/ICCW.2015.7247604","DOIUrl":"https://doi.org/10.1109/ICCW.2015.7247604","url":null,"abstract":"In this paper we evaluate the energy efficiency of a 5G radio access network (RAN) based on LTE technology when comparing two small cell deployment strategies to enhance the RAN capacity. Specifically, we compare densifying a 3-sector macrocell RAN with small cells against first upgrading to a 6-sector macrocell RAN before densifying with small cells. The latter strategy has been used in urban areas by 4G network operators. The energy consumption gain (ECG) is used as a figure of merit in this paper. The radio base station power consumption is estimated by using a realistic power consumption model. Our results show that deploying a small cell overlay in a 3-sector macrocell RAN is more energy efficient than deploying a small cell overlay in a 6-sector macrocell RAN even though the latter uses fewer small cells. Further energy savings can be achieved by implementing an adaptive sectorisation technique. An energy saving of 25% is achieved for 6-sectors when progressively decreasing the number of active sectors from 6 to 1 in accordance with the temporal average traffic load. Irrespective, the 3-sector option with or without incorporating the adaptive sectorisation technique is always more energy efficient.","PeriodicalId":6464,"journal":{"name":"2015 IEEE International Conference on Communication Workshop (ICCW)","volume":"15 1","pages":"2806-2811"},"PeriodicalIF":0.0,"publicationDate":"2015-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82613725","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-06-08DOI: 10.1109/ICCW.2015.7247256
F. Sanchez-Moya, V. Venkatasubramanian, P. Marsch, Ali Yaver
Network-facilitated device to device (D2D) communication is expected to play a central role in 5th generation cellular systems, as this allows to substantially reduce the end-to-end latency in mission-critical communication use cases, but also to obtain network and spectral efficiency improvements through the exploitation of proximity gains, hop gains and reuse gains in mobile broadband scenarios. The likely complement of evolved legacy standards with non-backward compatible radio interfaces in the 5G context will allow to design radio technology that natively and efficiently supports D2D from the very beginning. However, there are various fundamental design questions to be answered, focusing in this work on the question of how mode selection between D2D and device-infrastructure-device communication should ideally be conducted, as this will have a major impact on protocol stack design. We compare a fast, instantaneous SINR based mode selection (likely implemented on MAC level) against a typically assumed path-loss based slow mode selection (PDCP or RRC level). Through extensive simulation studies, it is shown that fast mode selection does allow to improve D2D performance without impairing cellular performance, but likely requires highly coordinated RRM, and it is thus needed to carefully consider whether the depicted gains would justify the likely more complicated and overhead-prone implementation of mode selection on MAC level.
{"title":"D2D mode selection and resource allocation with flexible UL/DL TDD for 5G deployments","authors":"F. Sanchez-Moya, V. Venkatasubramanian, P. Marsch, Ali Yaver","doi":"10.1109/ICCW.2015.7247256","DOIUrl":"https://doi.org/10.1109/ICCW.2015.7247256","url":null,"abstract":"Network-facilitated device to device (D2D) communication is expected to play a central role in 5th generation cellular systems, as this allows to substantially reduce the end-to-end latency in mission-critical communication use cases, but also to obtain network and spectral efficiency improvements through the exploitation of proximity gains, hop gains and reuse gains in mobile broadband scenarios. The likely complement of evolved legacy standards with non-backward compatible radio interfaces in the 5G context will allow to design radio technology that natively and efficiently supports D2D from the very beginning. However, there are various fundamental design questions to be answered, focusing in this work on the question of how mode selection between D2D and device-infrastructure-device communication should ideally be conducted, as this will have a major impact on protocol stack design. We compare a fast, instantaneous SINR based mode selection (likely implemented on MAC level) against a typically assumed path-loss based slow mode selection (PDCP or RRC level). Through extensive simulation studies, it is shown that fast mode selection does allow to improve D2D performance without impairing cellular performance, but likely requires highly coordinated RRM, and it is thus needed to carefully consider whether the depicted gains would justify the likely more complicated and overhead-prone implementation of mode selection on MAC level.","PeriodicalId":6464,"journal":{"name":"2015 IEEE International Conference on Communication Workshop (ICCW)","volume":"143 3 1","pages":"657-663"},"PeriodicalIF":0.0,"publicationDate":"2015-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80994766","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-06-08DOI: 10.1109/ICCW.2015.7247381
A. Chiumento, M. Bennis, C. Desset, A. Bourdoux, L. Perre, S. Pollin
With the constant increase in wireless handheld devices and the prospect of billions of connected machines one of the problems for future mobile networks, usually overlooked by the research community, is that more connected devices require proportionally more signalling overhead. Particularly, acquiring users' channel state information is necessary in order for the base station to assign frequency resources. Estimating this channel information with full resolution in frequency and in time is generally impossible and, thus, methods have to be implemented in order to reduce the overhead. In this paper, we propose a channel quality estimation method based on the concept of Gaussian Process Regression to predict users' channel states for varying user mobility profiles. Furthermore, we present a dual-control technique to determine which is the most appropriate prediction time for each user in order to keep the packet loss rate below a pre-defined threshold. The proposed dual-control technique is then analysed in a multicell network with proportional fair and maximum throughput scheduling mechanisms. Remarkably, it is shown that the presented approach allows for a reduction of the overall channel quality signalling by over 90% while keeping the packet loss below 5% with maximum throughput schedulers, as well as signalling reduction of 60% with proportional fair scheduling.
{"title":"Gaussian Process Regression for CSI and feedback estimation in LTE","authors":"A. Chiumento, M. Bennis, C. Desset, A. Bourdoux, L. Perre, S. Pollin","doi":"10.1109/ICCW.2015.7247381","DOIUrl":"https://doi.org/10.1109/ICCW.2015.7247381","url":null,"abstract":"With the constant increase in wireless handheld devices and the prospect of billions of connected machines one of the problems for future mobile networks, usually overlooked by the research community, is that more connected devices require proportionally more signalling overhead. Particularly, acquiring users' channel state information is necessary in order for the base station to assign frequency resources. Estimating this channel information with full resolution in frequency and in time is generally impossible and, thus, methods have to be implemented in order to reduce the overhead. In this paper, we propose a channel quality estimation method based on the concept of Gaussian Process Regression to predict users' channel states for varying user mobility profiles. Furthermore, we present a dual-control technique to determine which is the most appropriate prediction time for each user in order to keep the packet loss rate below a pre-defined threshold. The proposed dual-control technique is then analysed in a multicell network with proportional fair and maximum throughput scheduling mechanisms. Remarkably, it is shown that the presented approach allows for a reduction of the overall channel quality signalling by over 90% while keeping the packet loss below 5% with maximum throughput schedulers, as well as signalling reduction of 60% with proportional fair scheduling.","PeriodicalId":6464,"journal":{"name":"2015 IEEE International Conference on Communication Workshop (ICCW)","volume":"24 1","pages":"1440-1445"},"PeriodicalIF":0.0,"publicationDate":"2015-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81050040","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-06-08DOI: 10.1109/ICCW.2015.7247437
Hung T. Le, Hai N. Nguyen, N. P. Ngoc, A. Pham, H. L. Minh, T. Thang
In this paper, we focus on the bitrate adaptation issue of HTTP live video streaming. We first present a systematic approach that enables the client to choose the best video quality when deciding video bitrate for next several segments. After that, based on the concept of JND (Just Noticeable Difference), an adaptation method is proposed to meet the tradeoff between the requirements of buffer stability and smooth video quality. The experiment results show that our proposed method can provide smooth videos in terms of perceptual quality even under a small buffer size (i.e. 10s). To the best of our knowledge, this paper presents for the first time the way to use a perceptual quality metric for adaptivity in HTTP streaming.
{"title":"Quality-driven bitrate adaptation method for HTTP live-streaming","authors":"Hung T. Le, Hai N. Nguyen, N. P. Ngoc, A. Pham, H. L. Minh, T. Thang","doi":"10.1109/ICCW.2015.7247437","DOIUrl":"https://doi.org/10.1109/ICCW.2015.7247437","url":null,"abstract":"In this paper, we focus on the bitrate adaptation issue of HTTP live video streaming. We first present a systematic approach that enables the client to choose the best video quality when deciding video bitrate for next several segments. After that, based on the concept of JND (Just Noticeable Difference), an adaptation method is proposed to meet the tradeoff between the requirements of buffer stability and smooth video quality. The experiment results show that our proposed method can provide smooth videos in terms of perceptual quality even under a small buffer size (i.e. 10s). To the best of our knowledge, this paper presents for the first time the way to use a perceptual quality metric for adaptivity in HTTP streaming.","PeriodicalId":6464,"journal":{"name":"2015 IEEE International Conference on Communication Workshop (ICCW)","volume":"4 1","pages":"1771-1776"},"PeriodicalIF":0.0,"publicationDate":"2015-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83013024","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
扫码关注我们
求助内容：
应助结果提醒方式：