Pub Date : 2014-04-06DOI: 10.1109/WCNC.2014.6952687
Nadine Abbas, Z. Dawy, Hazem M. Hajj, S. Sharafeddine
Heterogeneous networks are expected to play a major role towards meeting the exploding traffic demand over cellular systems. Particularly, existing WiFi hotspots will be dynamically utilized to offload the traffic of cellular mobile subscribers. This will be further facilitated by forthcoming advances in mobile device capabilities that will include the ability to operate multiple wireless interfaces simultaneously. To this end, we focus in this work on cellular/WiFi heterogeneous networks with traffic splitting where a mobile device can utilize existing cellular and WiFi links simultaneously to achieve various performance gains. We propose a multi-objective approach for traffic splitting that captures the tradeoffs between throughput maximization on one hand and battery energy minimization on the other hand. We evaluate the proposed approach using parameters determined via experimental measurements using Samsung Galaxy SIII mobile devices. Results are presented for various scenarios in order to quantify and analyze the throughput-energy tradeoffs of traffic splitting in cellular/WiFi heterogeneous networks.
{"title":"Energy-throughput tradeoffs in cellular/WiFi heterogeneous networks with traffic splitting","authors":"Nadine Abbas, Z. Dawy, Hazem M. Hajj, S. Sharafeddine","doi":"10.1109/WCNC.2014.6952687","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6952687","url":null,"abstract":"Heterogeneous networks are expected to play a major role towards meeting the exploding traffic demand over cellular systems. Particularly, existing WiFi hotspots will be dynamically utilized to offload the traffic of cellular mobile subscribers. This will be further facilitated by forthcoming advances in mobile device capabilities that will include the ability to operate multiple wireless interfaces simultaneously. To this end, we focus in this work on cellular/WiFi heterogeneous networks with traffic splitting where a mobile device can utilize existing cellular and WiFi links simultaneously to achieve various performance gains. We propose a multi-objective approach for traffic splitting that captures the tradeoffs between throughput maximization on one hand and battery energy minimization on the other hand. We evaluate the proposed approach using parameters determined via experimental measurements using Samsung Galaxy SIII mobile devices. Results are presented for various scenarios in order to quantify and analyze the throughput-energy tradeoffs of traffic splitting in cellular/WiFi heterogeneous networks.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"51 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":"130510527","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.6952513
Chungang Yang, Kun Guo, Min Sheng, Jiangdong Li, Jian Yue
The deployment of smallcell eNodeBs (SeNBs), overlaid on existing macrocell eNodeB (MeNB) is widely accepted as a key solution for improving spectral efficiency (SE). However, both SeNB and MeNB may suffer significant performance degradation due to inter/intra-tier interference. Meanwhile, the energy efficiency (EE) is another promising requirement especially when SeNB/MeNB are densely deployed. In this paper, a utility function with an α-adjustable parameter is proposed to achieve an optimal tradeoff between EE and SE. Then, an energy-aware capacity offload between the MeNB and multiple SeNBs is formulated as a Nash bargaining game, which is significantly simplified during the following analysis. To attain a win-win optimality for both the relatively involved SeNBs and MeNB, an energy-aware trigger of source-MeNB, interference-related right selected target-SeNB, and mutual interference compensation are all provided in this paper, which help to attain more dimensions of diversities and gains. Finally, simulation results show the improved performance of our proposed scheme.
{"title":"Energy-efficient capacity offload to smallcells with interference compensation","authors":"Chungang Yang, Kun Guo, Min Sheng, Jiangdong Li, Jian Yue","doi":"10.1109/WCNC.2014.6952513","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6952513","url":null,"abstract":"The deployment of smallcell eNodeBs (SeNBs), overlaid on existing macrocell eNodeB (MeNB) is widely accepted as a key solution for improving spectral efficiency (SE). However, both SeNB and MeNB may suffer significant performance degradation due to inter/intra-tier interference. Meanwhile, the energy efficiency (EE) is another promising requirement especially when SeNB/MeNB are densely deployed. In this paper, a utility function with an α-adjustable parameter is proposed to achieve an optimal tradeoff between EE and SE. Then, an energy-aware capacity offload between the MeNB and multiple SeNBs is formulated as a Nash bargaining game, which is significantly simplified during the following analysis. To attain a win-win optimality for both the relatively involved SeNBs and MeNB, an energy-aware trigger of source-MeNB, interference-related right selected target-SeNB, and mutual interference compensation are all provided in this paper, which help to attain more dimensions of diversities and gains. Finally, simulation results show the improved performance of our proposed scheme.","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":"128860668","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.6952817
Ahmed Amari, N. Achir, P. Mühlethaler, A. Laouiti
In this paper we propose an optimized broadcasting mechanism which uses very limited signaling overhead. The main objective is to select the most appropriate relay nodes according to a given cost function. Basically, after receiving a broadcast packet each potential relay node computes a binary code according to a given cost function. Then, each node starts a sequence of transmit/listen intervals following this code. In other words, each 0 corresponds to a listening interval and each 1 to a transmit interval. During this active acknowledgment signaling period, each receiver applies the following rule: if it detects a signal during any of its listening intervals, it quits the selection process, since a better relay has also captured the packet. Finally, we split the transmission range into several sectors and we propose that all the nodes within the same sector use the same CDMA orthogonal spreading codes to transmit their signals. The CDMA codes used in two different sectors are orthogonal, which guarantees that the packet is broadcast in all possible directions.
{"title":"Optimized broadcast scheme for mobile ad hoc networks","authors":"Ahmed Amari, N. Achir, P. Mühlethaler, A. Laouiti","doi":"10.1109/WCNC.2014.6952817","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6952817","url":null,"abstract":"In this paper we propose an optimized broadcasting mechanism which uses very limited signaling overhead. The main objective is to select the most appropriate relay nodes according to a given cost function. Basically, after receiving a broadcast packet each potential relay node computes a binary code according to a given cost function. Then, each node starts a sequence of transmit/listen intervals following this code. In other words, each 0 corresponds to a listening interval and each 1 to a transmit interval. During this active acknowledgment signaling period, each receiver applies the following rule: if it detects a signal during any of its listening intervals, it quits the selection process, since a better relay has also captured the packet. Finally, we split the transmission range into several sectors and we propose that all the nodes within the same sector use the same CDMA orthogonal spreading codes to transmit their signals. The CDMA codes used in two different sectors are orthogonal, which guarantees that the packet is broadcast in all possible directions.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"42 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":"123167394","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.6952865
Saeed R. Khosravirad, L. Szczecinski, F. Labeau
We analyze HARQ transmission over a fading channel with the help of a relay node. In the absence of the channel state information (CSI) at the transmitters, we establish the problem of maximizing the overall throughput of HARQ transmission by optimizing the variable transmission rate. We present a closed form of the throughput with respect to the transmission rates and use the well-known Dynamic Programming technique along with the necessary simplifications on the problem to find the optimal set of transmission rates for both the Source node and the Relay node in source-relay-destination scenario. We show that such an approach yields a significant increase in throughput compared to fixed-rate HARQ.
{"title":"Rate allocation for HARQ in relay-based cooperative transmission","authors":"Saeed R. Khosravirad, L. Szczecinski, F. Labeau","doi":"10.1109/WCNC.2014.6952865","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6952865","url":null,"abstract":"We analyze HARQ transmission over a fading channel with the help of a relay node. In the absence of the channel state information (CSI) at the transmitters, we establish the problem of maximizing the overall throughput of HARQ transmission by optimizing the variable transmission rate. We present a closed form of the throughput with respect to the transmission rates and use the well-known Dynamic Programming technique along with the necessary simplifications on the problem to find the optimal set of transmission rates for both the Source node and the Relay node in source-relay-destination scenario. We show that such an approach yields a significant increase in throughput compared to fixed-rate HARQ.","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":"123174068","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.6952315
P. Jayasinghe, L. S. Jayasinghe, M. Juntti, M. Latva-aho
This paper investigates optimal relay selection schemes for orthogonal space-time block coded multiple-input multiple-output system with non-coherent amplify-and-forward relays, where channel state information is not available at the source and relays. The source-relay and relay-destination channels undergo Rayleigh and Rician fading, respectively. Two possible relay selection schemes are proposed, and both are statistically characterised by deriving exact closed form expression for the cumulative distribution function and probability density function of the instantaneous signal-to-noise ratio (SNR) at the destination. In the first relay selection method, maximizing instantaneous SNR at the destination is considered to select the best relay. In the second scheme, maximizing relay-destination channel is considered. The derived statistical results are used to analyse the performance of the system with outage probability, average bit error rate and ergodic capacity. Finally, we compare both relay selection schemes with respect to the relay pool size and Rician factor.
{"title":"Relay selection on dual hop AF MIMO with OSTBC over asymmetric fading channels","authors":"P. Jayasinghe, L. S. Jayasinghe, M. Juntti, M. Latva-aho","doi":"10.1109/WCNC.2014.6952315","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6952315","url":null,"abstract":"This paper investigates optimal relay selection schemes for orthogonal space-time block coded multiple-input multiple-output system with non-coherent amplify-and-forward relays, where channel state information is not available at the source and relays. The source-relay and relay-destination channels undergo Rayleigh and Rician fading, respectively. Two possible relay selection schemes are proposed, and both are statistically characterised by deriving exact closed form expression for the cumulative distribution function and probability density function of the instantaneous signal-to-noise ratio (SNR) at the destination. In the first relay selection method, maximizing instantaneous SNR at the destination is considered to select the best relay. In the second scheme, maximizing relay-destination channel is considered. The derived statistical results are used to analyse the performance of the system with outage probability, average bit error rate and ergodic capacity. Finally, we compare both relay selection schemes with respect to the relay pool size and Rician factor.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"46 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":"123391582","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.6952478
E. Ciftcioglu, Antonios Michaloliakos, K. Psounis, T. L. Porta, A. Yener
In this paper, we consider Quality-of-Information (QoI) aware transmission policies for a dynamic environment. In particular, we focus on the time-varying nature of the observation quality of the environment in practical networks which leads to uncertainty in satisfying QoI requirements specified by end users. The goal of this paper is to meet QoI requests from end users with minimum resources. Specifically, power is allocated dynamically depending on observation accuracies and QoI requirements. We formulate a dynamic scheme for scheduling with the objective of minimizing the energy consumption at the network while satisfying constraints on outage probability for QoI. Lyapunov stability arguments are used to define a policy based on the instantaneous observation qualities and QoI requirement satisfaction levels. Numerical results demonstrate that significant improvements in delivered QoI are realized with identical power expenditure using our QoI-aware resource allocation algorithm compared with traditional maximum-rate schedulers.
{"title":"Power minimization with quality-of-information outages","authors":"E. Ciftcioglu, Antonios Michaloliakos, K. Psounis, T. L. Porta, A. Yener","doi":"10.1109/WCNC.2014.6952478","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6952478","url":null,"abstract":"In this paper, we consider Quality-of-Information (QoI) aware transmission policies for a dynamic environment. In particular, we focus on the time-varying nature of the observation quality of the environment in practical networks which leads to uncertainty in satisfying QoI requirements specified by end users. The goal of this paper is to meet QoI requests from end users with minimum resources. Specifically, power is allocated dynamically depending on observation accuracies and QoI requirements. We formulate a dynamic scheme for scheduling with the objective of minimizing the energy consumption at the network while satisfying constraints on outage probability for QoI. Lyapunov stability arguments are used to define a policy based on the instantaneous observation qualities and QoI requirement satisfaction levels. Numerical results demonstrate that significant improvements in delivered QoI are realized with identical power expenditure using our QoI-aware resource allocation algorithm compared with traditional maximum-rate schedulers.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"20 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":"121537175","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.6953078
K. Rostamzadeh, H. Nicanfar, S. Gopalakrishnan, Victor C. M. Leung
Reliable, secure, private and fast communication in vehicular networks (VNets) is extremely challenging due to the highly mobile nature of these networks. Contact time between vehicles is very limited and topology is constantly changing. Trusted communication in VNets is of crucial importance because without trust, all efforts for minimizing the delay or maximizing the reliability could be voided. In this paper, we propose a trust-based framework for communication in VNets that is capable of accommodating traffic from different applications. Our scheme assigns a trust value to each road segment and one to each neighborhood, instead of each car. Thus it scales up easily and is completely distributed. Experimental results demonstrate that this framework outperforms other well-known routing protocols since it routes the messages via trusted vehicles.
{"title":"A context-aware trust-based communication framework for VNets","authors":"K. Rostamzadeh, H. Nicanfar, S. Gopalakrishnan, Victor C. M. Leung","doi":"10.1109/WCNC.2014.6953078","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6953078","url":null,"abstract":"Reliable, secure, private and fast communication in vehicular networks (VNets) is extremely challenging due to the highly mobile nature of these networks. Contact time between vehicles is very limited and topology is constantly changing. Trusted communication in VNets is of crucial importance because without trust, all efforts for minimizing the delay or maximizing the reliability could be voided. In this paper, we propose a trust-based framework for communication in VNets that is capable of accommodating traffic from different applications. Our scheme assigns a trust value to each road segment and one to each neighborhood, instead of each car. Thus it scales up easily and is completely distributed. Experimental results demonstrate that this framework outperforms other well-known routing protocols since it routes the messages via trusted vehicles.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"64 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":"121552358","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.6952369
Yu-Chung Chen, Hung-Yun Hsieh
In this paper, we investigate the problem of joint coordinated resource allocation and power control for LTE-A heterogeneous networks (HetNets) with low-power remote radio heads (RRHs). The scenario we consider is the configuration when RRHs share the same cell ID with the macro BS such that coordinated multi-point (CoMP) operations among transmission points can be performed in a finer granularity without undesirably triggering frequent handover operations. We first formulate a mixed-integer non-linear (MINLP) optimization problem involving multiple transmission points and a set of users demanding fair service. To reduce problem complexity, we transform the formulation into a coordinated scheduling problem with transmission power control. We then propose a two-phase iterative algorithm involving sub-channel resource allocation and co-channel power allocation for solving the target problem. Simulation results show that RRHs with CoMP operations do provide a promising approach for enhancing the performance of users in the macrocell and the proposed algorithm can effectively solve the problem with noticeable performance gain.
{"title":"Joint resource allocation and power control for CoMP transmissions in LTE-A HetNets with RRHs","authors":"Yu-Chung Chen, Hung-Yun Hsieh","doi":"10.1109/WCNC.2014.6952369","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6952369","url":null,"abstract":"In this paper, we investigate the problem of joint coordinated resource allocation and power control for LTE-A heterogeneous networks (HetNets) with low-power remote radio heads (RRHs). The scenario we consider is the configuration when RRHs share the same cell ID with the macro BS such that coordinated multi-point (CoMP) operations among transmission points can be performed in a finer granularity without undesirably triggering frequent handover operations. We first formulate a mixed-integer non-linear (MINLP) optimization problem involving multiple transmission points and a set of users demanding fair service. To reduce problem complexity, we transform the formulation into a coordinated scheduling problem with transmission power control. We then propose a two-phase iterative algorithm involving sub-channel resource allocation and co-channel power allocation for solving the target problem. Simulation results show that RRHs with CoMP operations do provide a promising approach for enhancing the performance of users in the macrocell and the proposed algorithm can effectively solve the problem with noticeable performance gain.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"4 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":"126394405","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.6952726
Ghayet El Mouna Zhioua, Jun Zhang, H. Labiod, N. Tabbane, S. Tabbane
In this work, we investigate upon the potential of considering the Intelligent Transportation Systems (ITS) for cellular traffic offloading as an alternative to Wi-Fi and femtoCells approaches. We propose an analytical study based on an optimization problem formulation called VOPP where the objective is to elect the maximum number of data flows that could be routed to the downloaders through the Vehicular Network (VANET). VOPP considers the link availability between the infrastructure and the downloader, the medium contention, interferences, data volume, gateways capacity and the channel aggregation to evaluate the VANET capacity to support additional traffics. Numerical results of our analytical approach show that the data offloading fraction is closely tied to the data volume of the flows and to the vehicles positions and VANET topology.
{"title":"VOPP: A VANET offloading potential prediction model","authors":"Ghayet El Mouna Zhioua, Jun Zhang, H. Labiod, N. Tabbane, S. Tabbane","doi":"10.1109/WCNC.2014.6952726","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6952726","url":null,"abstract":"In this work, we investigate upon the potential of considering the Intelligent Transportation Systems (ITS) for cellular traffic offloading as an alternative to Wi-Fi and femtoCells approaches. We propose an analytical study based on an optimization problem formulation called VOPP where the objective is to elect the maximum number of data flows that could be routed to the downloaders through the Vehicular Network (VANET). VOPP considers the link availability between the infrastructure and the downloader, the medium contention, interferences, data volume, gateways capacity and the channel aggregation to evaluate the VANET capacity to support additional traffics. Numerical results of our analytical approach show that the data offloading fraction is closely tied to the data volume of the flows and to the vehicles positions and VANET topology.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"8 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":"122240572","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.6952169
Matthieu De Mari, E. Strinati, M. Debbah
Performance of heterogeneous network is strongly limited by the interference due to multiple access points operating in the same geographical area, with overlapping service coverage. The common understanding is that interference, classically processed as additive noise, compromises the transmission and therefore must be ideally avoided or at least strongly limited. However, recent investigations in the domain of information theory and successive interference cancellation (SIC) techniques have proved that interference may not necessarily be treated as an opponent, but may become an ally. In this paper, we propose a novel interference aware resource management algorithm, where the system may only control its interference perception. In a system consisting of a couple of downlink users and access points with overlapping coverage, we aim to define the most spectral-efficient way to process interference at each receiver. Based on a 3-regimes interference classifier, both users in the system may either treat interference as noise, orthogonalize transmissions so that interference may be avoided, or cancel interference out of the received signal via SIC-based techniques. Our study shows that, when aiming at maximizing total spectral efficiency, ignoring or avoiding interference is not always the best option. Based on our theoritical study, we propose an interference classification algorithm, with only 2 admissible regimes for each user. Finally, we assess its notable performance improvement by simulation results.
{"title":"Two-regimes interference classifier: An interference-aware resource allocation algorithm","authors":"Matthieu De Mari, E. Strinati, M. Debbah","doi":"10.1109/WCNC.2014.6952169","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6952169","url":null,"abstract":"Performance of heterogeneous network is strongly limited by the interference due to multiple access points operating in the same geographical area, with overlapping service coverage. The common understanding is that interference, classically processed as additive noise, compromises the transmission and therefore must be ideally avoided or at least strongly limited. However, recent investigations in the domain of information theory and successive interference cancellation (SIC) techniques have proved that interference may not necessarily be treated as an opponent, but may become an ally. In this paper, we propose a novel interference aware resource management algorithm, where the system may only control its interference perception. In a system consisting of a couple of downlink users and access points with overlapping coverage, we aim to define the most spectral-efficient way to process interference at each receiver. Based on a 3-regimes interference classifier, both users in the system may either treat interference as noise, orthogonalize transmissions so that interference may be avoided, or cancel interference out of the received signal via SIC-based techniques. Our study shows that, when aiming at maximizing total spectral efficiency, ignoring or avoiding interference is not always the best option. Based on our theoritical study, we propose an interference classification algorithm, with only 2 admissible regimes for each user. Finally, we assess its notable performance improvement by simulation results.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"16 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":"121126972","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
扫码关注我们
求助内容：
应助结果提醒方式：