Pub Date : 2013-06-18DOI: 10.1109/CWIT.2013.6621588
A. Khandani
Current wireless systems are one-way (similar to walkie-talkies), meaning that disjoint time or frequency segments are used to transmit and to receive. Realization of two-way wireless has challenged the research community for many years. This article1 establishes the theory and presents practical realization of two-way (true full-duplex) wireless. In contrast to the widely accepted beliefs, it is shown that two-way wireless is not only feasible, but is fairly simple, with virtually no degradation in signal-to-noise-ratio2. The innovation is in the antenna design and multiple levels for cancelling self-interference. Methods are developed to support Multiple-Input Multiple-Output (MIMO) two-way transmission, and asynchronous two-way links (useful in networking applications). The developed hardware uses off-the-shelf components, antennas have a simple structure, are omnidirectional (can be directional, if needed), do not suffer from bandwidth limitations, have a small size/spacing, and the increase in overall complexity is minimal. It is shown that two-way wireless can do more than doubling the rate. In particular: 1) Facilitates wireless networking. In particular, the ability to handle asynchronous users enables superimposing a half-duplex, low bit rate, low power, easy to detect network for control signaling superimposed (physical overlay, rather than logical) on top of the network of primary full-duplex data links. The superimposed links are separated from the primary full-duplex data links in the code domain, and use time multiplexing plus Carrier Sense Multiple Access (CSMA) among themselves. However, the conventional problems of CSMA are avoided as control links operate in parallel with primary full-duplex data links. The physical layer of control links is designed such that full-duplex data links can detect and cancel the interference caused by the superimposed control links. 2) Enhances security through desirable jamming. 3) Provides the ground to realize unconditional security (beyond computational or information theoretical security), using a simple method introduced in this article. 4) Facilitates multi-node distributed & collaborative signaling, including realization of Network Information Theoretic setups, and cognitive wireless. 5) Exploiting feedback, it improves point-to-point throughput, and enables ultra low power transmission. 6) Doubles the point-to-point throughput.
{"title":"Two-way (true full-duplex) wireless","authors":"A. Khandani","doi":"10.1109/CWIT.2013.6621588","DOIUrl":"https://doi.org/10.1109/CWIT.2013.6621588","url":null,"abstract":"Current wireless systems are one-way (similar to walkie-talkies), meaning that disjoint time or frequency segments are used to transmit and to receive. Realization of two-way wireless has challenged the research community for many years. This article1 establishes the theory and presents practical realization of two-way (true full-duplex) wireless. In contrast to the widely accepted beliefs, it is shown that two-way wireless is not only feasible, but is fairly simple, with virtually no degradation in signal-to-noise-ratio2. The innovation is in the antenna design and multiple levels for cancelling self-interference. Methods are developed to support Multiple-Input Multiple-Output (MIMO) two-way transmission, and asynchronous two-way links (useful in networking applications). The developed hardware uses off-the-shelf components, antennas have a simple structure, are omnidirectional (can be directional, if needed), do not suffer from bandwidth limitations, have a small size/spacing, and the increase in overall complexity is minimal. It is shown that two-way wireless can do more than doubling the rate. In particular: 1) Facilitates wireless networking. In particular, the ability to handle asynchronous users enables superimposing a half-duplex, low bit rate, low power, easy to detect network for control signaling superimposed (physical overlay, rather than logical) on top of the network of primary full-duplex data links. The superimposed links are separated from the primary full-duplex data links in the code domain, and use time multiplexing plus Carrier Sense Multiple Access (CSMA) among themselves. However, the conventional problems of CSMA are avoided as control links operate in parallel with primary full-duplex data links. The physical layer of control links is designed such that full-duplex data links can detect and cancel the interference caused by the superimposed control links. 2) Enhances security through desirable jamming. 3) Provides the ground to realize unconditional security (beyond computational or information theoretical security), using a simple method introduced in this article. 4) Facilitates multi-node distributed & collaborative signaling, including realization of Network Information Theoretic setups, and cognitive wireless. 5) Exploiting feedback, it improves point-to-point throughput, and enables ultra low power transmission. 6) Doubles the point-to-point throughput.","PeriodicalId":398936,"journal":{"name":"2013 13th Canadian Workshop on Information Theory","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127483292","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 : 2013-06-18DOI: 10.1109/CWIT.2013.6621618
Linyan Liu, M. Safari, S. Hranilovic
In this paper, a rate-adaptive free-space optical (FSO) communication system using systematic Raptor codes is investigated based on experimental data measured over a 1.87 km terrestrial FSO link in different weather conditions. Using Raptor codes, the FSO communication system can adapt to the channel gain fluctuations caused by atmospheric turbulence and/or adverse weather conditions. To alleviate the burden of synchronizing between transmitter and receiver, messages are packetized and sent in sequence. For each packet, a cyclic-redundancy code (CRC) is added resulting in an effective packet erasure channel (PEC). Using experimental data and on-off-keying (OOK) modulation, the performance of the rate-adaptive FSO system is evaluated at different signaling rates. While an uncoded FSO system fails to efficiently operate during adverse weather conditions, the rate-adaptive technique provides reliable FSO communication under clear and rainy weather conditions.
{"title":"Systematic raptor codes for atmospheric optical channels","authors":"Linyan Liu, M. Safari, S. Hranilovic","doi":"10.1109/CWIT.2013.6621618","DOIUrl":"https://doi.org/10.1109/CWIT.2013.6621618","url":null,"abstract":"In this paper, a rate-adaptive free-space optical (FSO) communication system using systematic Raptor codes is investigated based on experimental data measured over a 1.87 km terrestrial FSO link in different weather conditions. Using Raptor codes, the FSO communication system can adapt to the channel gain fluctuations caused by atmospheric turbulence and/or adverse weather conditions. To alleviate the burden of synchronizing between transmitter and receiver, messages are packetized and sent in sequence. For each packet, a cyclic-redundancy code (CRC) is added resulting in an effective packet erasure channel (PEC). Using experimental data and on-off-keying (OOK) modulation, the performance of the rate-adaptive FSO system is evaluated at different signaling rates. While an uncoded FSO system fails to efficiently operate during adverse weather conditions, the rate-adaptive technique provides reliable FSO communication under clear and rainy weather conditions.","PeriodicalId":398936,"journal":{"name":"2013 13th Canadian Workshop on Information Theory","volume":"6 8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127092273","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 : 2013-06-18DOI: 10.1109/CWIT.2013.6621612
Ahmed Badr, A. Khisti, Wai-tian Tan, J. Apostolopoulos
We revisit two classes of previously proposed robust streaming-erasure codes - MIDAS codes and PRC codes - which guarantee streaming recovery over a class of packet erasure channels. We propose a modified construction for each class using diagonally-interleaved MDS codes. Our proposed codes have near identical performance over deterministic erasure channels, but only require a field size that grows polynomially in the delay. In contrast the previous constructions require that the field size increase exponentially with the delay. We also evaluate the performance of the proposed codes over Gilbert-Elliott channels and show that some penalty does result when finite field size is considered.
{"title":"Robust streaming erasure codes using MDS constituent codes","authors":"Ahmed Badr, A. Khisti, Wai-tian Tan, J. Apostolopoulos","doi":"10.1109/CWIT.2013.6621612","DOIUrl":"https://doi.org/10.1109/CWIT.2013.6621612","url":null,"abstract":"We revisit two classes of previously proposed robust streaming-erasure codes - MIDAS codes and PRC codes - which guarantee streaming recovery over a class of packet erasure channels. We propose a modified construction for each class using diagonally-interleaved MDS codes. Our proposed codes have near identical performance over deterministic erasure channels, but only require a field size that grows polynomially in the delay. In contrast the previous constructions require that the field size increase exponentially with the delay. We also evaluate the performance of the proposed codes over Gilbert-Elliott channels and show that some penalty does result when finite field size is considered.","PeriodicalId":398936,"journal":{"name":"2013 13th Canadian Workshop on Information Theory","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123530693","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 : 2013-06-18DOI: 10.1109/CWIT.2013.6621604
Xiaobo Guo, L. Dong, Ying Li, Lifeng Wang
In this paper, the effective capacity of multiple-input multiple-output (MIMO) maximal ratio combining (MRC) system is studied. By considering constant power loading, a closed-form expression for the effective capacity is derived. While for variable power loading, restricted by the average power, optimal power loading scheme and associated effective capacity is given. Adaptive modulation is used for both constant and variable power loading, and the superiority of variable power loading versus constant power loading is demonstrated by the computer simulations.
{"title":"Effective capacity of MIMO MRC system with constant and variable power loading","authors":"Xiaobo Guo, L. Dong, Ying Li, Lifeng Wang","doi":"10.1109/CWIT.2013.6621604","DOIUrl":"https://doi.org/10.1109/CWIT.2013.6621604","url":null,"abstract":"In this paper, the effective capacity of multiple-input multiple-output (MIMO) maximal ratio combining (MRC) system is studied. By considering constant power loading, a closed-form expression for the effective capacity is derived. While for variable power loading, restricted by the average power, optimal power loading scheme and associated effective capacity is given. Adaptive modulation is used for both constant and variable power loading, and the superiority of variable power loading versus constant power loading is demonstrated by the computer simulations.","PeriodicalId":398936,"journal":{"name":"2013 13th Canadian Workshop on Information Theory","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129830017","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 : 2013-06-18DOI: 10.1109/CWIT.2013.6621599
J. Ho, Jin Meng, E. Yang
This paper investigates the validity of Shannon's separation theorem in the finite block length regime. Under optimal tradeoffs between source rate and channel block error probability obtained from finite block length analysis, noisy channel quantizers based on joint source-channel coding principles are shown to outperform the separate quantizer designed via Lloyd-Max in terms of end-to-end distortion. Numerical results for the scalar case under the binary symmetric channel and discrete-input memoryless channel demonstrate that the separation of source and channel coding no longer holds in the finite block length regime, but the advantages of joint designs may be large or small depending on the system configuration.
{"title":"On separation of source and channel coding in the finite block length regime","authors":"J. Ho, Jin Meng, E. Yang","doi":"10.1109/CWIT.2013.6621599","DOIUrl":"https://doi.org/10.1109/CWIT.2013.6621599","url":null,"abstract":"This paper investigates the validity of Shannon's separation theorem in the finite block length regime. Under optimal tradeoffs between source rate and channel block error probability obtained from finite block length analysis, noisy channel quantizers based on joint source-channel coding principles are shown to outperform the separate quantizer designed via Lloyd-Max in terms of end-to-end distortion. Numerical results for the scalar case under the binary symmetric channel and discrete-input memoryless channel demonstrate that the separation of source and channel coding no longer holds in the finite block length regime, but the advantages of joint designs may be large or small depending on the system configuration.","PeriodicalId":398936,"journal":{"name":"2013 13th Canadian Workshop on Information Theory","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116997216","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 : 2013-06-18DOI: 10.1109/CWIT.2013.6621600
Kianoush Hosseini, Wei Yu, R. Adve
Coordinated intercell interference management is essential in dense heterogeneous networks with limited backhaul capacity. This paper proposes a cluster-based hierarchical cooperative transmission and resource allocation scheme with proportionally fair objective in a cellular network where both the macro base station (BS) and the small cell access-points (SCAs) are equipped with multiple antennas and share the entire available bandwidth. As the first step, SCAs form clusters based on their pairwise distances where each cluster comprised of adjacent SCAs which are potentially strong interferers. Clustering enables intra-cluster coordinated transmission and inter-cluster coordinated resource allocation. Specifically, SCAs within each cluster form a network multiple-input multiple-output (MIMO) system, share the users' data symbols, and cancel intra-cluster interference via zero-forcing spatial multiplexing. Further, a distributed power control scheme is devised for the purpose of mitigating inter-cluster interference without exchanging users' data signals. We show that clustering facilitates intra-cluster coordination by enabling data exchange and channel training with reasonable backhaul communication within each cluster. We also show that the proposed inter-cluster power control scheme can further improve the network-wide utility.
{"title":"Cluster based coordinated beamforming and power allocation for MIMO heterogeneous networks","authors":"Kianoush Hosseini, Wei Yu, R. Adve","doi":"10.1109/CWIT.2013.6621600","DOIUrl":"https://doi.org/10.1109/CWIT.2013.6621600","url":null,"abstract":"Coordinated intercell interference management is essential in dense heterogeneous networks with limited backhaul capacity. This paper proposes a cluster-based hierarchical cooperative transmission and resource allocation scheme with proportionally fair objective in a cellular network where both the macro base station (BS) and the small cell access-points (SCAs) are equipped with multiple antennas and share the entire available bandwidth. As the first step, SCAs form clusters based on their pairwise distances where each cluster comprised of adjacent SCAs which are potentially strong interferers. Clustering enables intra-cluster coordinated transmission and inter-cluster coordinated resource allocation. Specifically, SCAs within each cluster form a network multiple-input multiple-output (MIMO) system, share the users' data symbols, and cancel intra-cluster interference via zero-forcing spatial multiplexing. Further, a distributed power control scheme is devised for the purpose of mitigating inter-cluster interference without exchanging users' data signals. We show that clustering facilitates intra-cluster coordination by enabling data exchange and channel training with reasonable backhaul communication within each cluster. We also show that the proposed inter-cluster power control scheme can further improve the network-wide utility.","PeriodicalId":398936,"journal":{"name":"2013 13th Canadian Workshop on Information Theory","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120956627","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 : 2013-06-18DOI: 10.1109/CWIT.2013.6621591
Louis Tan, A. Khisti, E. Soljanin
We study the problem of broadcasting a binary source over a two-receiver erasure broadcast channel with source-channel bandwidth mismatch under a Hamming distortion measure. Given the distortion constraints of both users, we establish a lower bound for the minimum latency required and show that this bound is at least as tight as the one obtained from the source-channel separation theorem. Our derivation involves adapting an outer bound given by Reznic et al. (2006) for the related quadratic Gaussian source broadcast problem. The key step in our outer bound is to replace the entropy power inequality used by Reznic et al. with a suitable inequality for erasure broadcast channels. For the special case in which the user with the better channel requires lossless reconstruction, we present a coding scheme based on a hybrid digital-analog transmission technique and numerically evaluate both inner and outer bounds.
{"title":"Distortion bounds for broadcasting a binary source over binary erasure channels","authors":"Louis Tan, A. Khisti, E. Soljanin","doi":"10.1109/CWIT.2013.6621591","DOIUrl":"https://doi.org/10.1109/CWIT.2013.6621591","url":null,"abstract":"We study the problem of broadcasting a binary source over a two-receiver erasure broadcast channel with source-channel bandwidth mismatch under a Hamming distortion measure. Given the distortion constraints of both users, we establish a lower bound for the minimum latency required and show that this bound is at least as tight as the one obtained from the source-channel separation theorem. Our derivation involves adapting an outer bound given by Reznic et al. (2006) for the related quadratic Gaussian source broadcast problem. The key step in our outer bound is to replace the entropy power inequality used by Reznic et al. with a suitable inequality for erasure broadcast channels. For the special case in which the user with the better channel requires lossless reconstruction, we present a coding scheme based on a hybrid digital-analog transmission technique and numerically evaluate both inner and outer bounds.","PeriodicalId":398936,"journal":{"name":"2013 13th Canadian Workshop on Information Theory","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124565028","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 : 2013-06-18DOI: 10.1109/CWIT.2013.6621609
Saed Daoud, A. Ghrayeb
In this paper, the asymptotic performance of multiuser opportunistic cooperative system over frequency selective fading channels is investigated. Specifically, we consider a system comprising multiple sources, multiple relays with best relay selection, and a single destination. At the selected relay, a decode-and-forward (DF) relaying with a combining scheme is employed to enhance the bandwidth efficiency. Minimum mean squared error (MMSE) single carrier frequency domain equalization (SC-FDE) is assumed at the receivers (the relays and the destination). For this system, we invoke the matched filter bound (MFB) to derive the asymptotic outage probability with the aim of revealing the maximum diversity order that can be achieved by such systems. We use this bound to derive a limit on the code rate that the transmitters should use to be able to achieve the maximum diversity possible for a given number of sources using MMSE SC-FDE. We provide numerical examples that validate the analytical results.
{"title":"On the asymptotic performance of multiuser opportunistic df cooperative systems over frequency selective fading channels using MMSE SC-FDE","authors":"Saed Daoud, A. Ghrayeb","doi":"10.1109/CWIT.2013.6621609","DOIUrl":"https://doi.org/10.1109/CWIT.2013.6621609","url":null,"abstract":"In this paper, the asymptotic performance of multiuser opportunistic cooperative system over frequency selective fading channels is investigated. Specifically, we consider a system comprising multiple sources, multiple relays with best relay selection, and a single destination. At the selected relay, a decode-and-forward (DF) relaying with a combining scheme is employed to enhance the bandwidth efficiency. Minimum mean squared error (MMSE) single carrier frequency domain equalization (SC-FDE) is assumed at the receivers (the relays and the destination). For this system, we invoke the matched filter bound (MFB) to derive the asymptotic outage probability with the aim of revealing the maximum diversity order that can be achieved by such systems. We use this bound to derive a limit on the code rate that the transmitters should use to be able to achieve the maximum diversity possible for a given number of sources using MMSE SC-FDE. We provide numerical examples that validate the analytical results.","PeriodicalId":398936,"journal":{"name":"2013 13th Canadian Workshop on Information Theory","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131582839","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 : 2013-06-18DOI: 10.1109/CWIT.2013.6621614
S. Dhakal, T. Sexton, S. Hranilovic
We propose a new decoding algorithm for sparse space codes (SSC) transmission in an open-loop under-determined MIMO channel. The basis pursuit detector algorithm is combined with the sum-product algorithm to facilitate an iterative decoding using the LDPC based outer codes and the SSC based inner codes. In addition, a novel idea on multiuser detection using SSC codes is presented for an uplink MIMO channel.
{"title":"Iterative decoding and multiuser communication using sparse space codes for MIMO channels","authors":"S. Dhakal, T. Sexton, S. Hranilovic","doi":"10.1109/CWIT.2013.6621614","DOIUrl":"https://doi.org/10.1109/CWIT.2013.6621614","url":null,"abstract":"We propose a new decoding algorithm for sparse space codes (SSC) transmission in an open-loop under-determined MIMO channel. The basis pursuit detector algorithm is combined with the sum-product algorithm to facilitate an iterative decoding using the LDPC based outer codes and the SSC based inner codes. In addition, a novel idea on multiuser detection using SSC codes is presented for an uplink MIMO channel.","PeriodicalId":398936,"journal":{"name":"2013 13th Canadian Workshop on Information Theory","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126312463","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 : 2013-06-18DOI: 10.1109/CWIT.2013.6621601
Oleg Petelin, R. Adve
This paper presents a distributed algorithm for optimizing a given dynamic frequency allocation in open-access femtocell networks. This approach builds on previous work which mitigates interference by assigning physical resource blocks (PRBs) to femtocell access points (FAPs) through a graph-coloring algorithm. The algorithm presented in this paper further optimizes this graph coloring in a distributed manner, using automatic negotiation for PRBs between interfering FAPs. The major advantage of this approach is increased frequency reuse within the cellular network. The performance of this algorithm is simulated in the context of the LTE standard. The impact of regular-versus-fractional graph coloring on frequency allocation is also investigated.
{"title":"Distributed resource allocation in femtocell networks","authors":"Oleg Petelin, R. Adve","doi":"10.1109/CWIT.2013.6621601","DOIUrl":"https://doi.org/10.1109/CWIT.2013.6621601","url":null,"abstract":"This paper presents a distributed algorithm for optimizing a given dynamic frequency allocation in open-access femtocell networks. This approach builds on previous work which mitigates interference by assigning physical resource blocks (PRBs) to femtocell access points (FAPs) through a graph-coloring algorithm. The algorithm presented in this paper further optimizes this graph coloring in a distributed manner, using automatic negotiation for PRBs between interfering FAPs. The major advantage of this approach is increased frequency reuse within the cellular network. The performance of this algorithm is simulated in the context of the LTE standard. The impact of regular-versus-fractional graph coloring on frequency allocation is also investigated.","PeriodicalId":398936,"journal":{"name":"2013 13th Canadian Workshop on Information Theory","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126814334","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
扫码关注我们
求助内容：
应助结果提醒方式：