Pub Date : 2012-11-29DOI: 10.1109/ICC.2012.6364428
G. P. Alkmim, D. Batista, N. Fonseca
Network virtualization is a promising technique for building the Internet of the future since it enables the introduction of new features into network elements at low cost. An open issue in virtualization is how to search for an efficient mapping of virtual network elements onto those of the existing physical network. Mapping is an NP-hard problem and existing solutions take long time to find a solution. This paper presents four new approximated algorithms based on two integer linear programming formulations that runs fast and, also, consider various real network characteristics, which is neglected by other proposals in the literature.
{"title":"Approximated algorithms for mapping virtual networks on network substrates","authors":"G. P. Alkmim, D. Batista, N. Fonseca","doi":"10.1109/ICC.2012.6364428","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364428","url":null,"abstract":"Network virtualization is a promising technique for building the Internet of the future since it enables the introduction of new features into network elements at low cost. An open issue in virtualization is how to search for an efficient mapping of virtual network elements onto those of the existing physical network. Mapping is an NP-hard problem and existing solutions take long time to find a solution. This paper presents four new approximated algorithms based on two integer linear programming formulations that runs fast and, also, consider various real network characteristics, which is neglected by other proposals in the literature.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120956307","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-11-29DOI: 10.1109/ICC.2012.6364543
Kihong Park, Mohamed-Slim Alouini
In this paper, we study a two-hop half-duplex relaying network with one source, one destination, and three amplify-and-forward (AF) relays equipped with M antennas each. We consider alternate transmission to compensate for the inherent loss of capacity pre-log factor 1/2 in half duplex mode, where source transmit message to two relays and the other relay alternately. The inter-relay interference caused by alternate transmission is aligned to make additional degrees of freedom (DOFs). It is shown that the proposed scheme enables us to exploit 3M/4 DOFs compared with the M/2 DOFs of conventional AF relaying. More specifically, suboptimal linear filter designs for a source and three relays are proposed to maximize the achievable sum-rate. We verify using some selected numerical results that the proposed filter designs give significant improvement of the sum-rate over a naive filter and conventional relaying schemes.
{"title":"Alternate MIMO relaying with three AF relays using interference alignment","authors":"Kihong Park, Mohamed-Slim Alouini","doi":"10.1109/ICC.2012.6364543","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364543","url":null,"abstract":"In this paper, we study a two-hop half-duplex relaying network with one source, one destination, and three amplify-and-forward (AF) relays equipped with M antennas each. We consider alternate transmission to compensate for the inherent loss of capacity pre-log factor 1/2 in half duplex mode, where source transmit message to two relays and the other relay alternately. The inter-relay interference caused by alternate transmission is aligned to make additional degrees of freedom (DOFs). It is shown that the proposed scheme enables us to exploit 3M/4 DOFs compared with the M/2 DOFs of conventional AF relaying. More specifically, suboptimal linear filter designs for a source and three relays are proposed to maximize the achievable sum-rate. We verify using some selected numerical results that the proposed filter designs give significant improvement of the sum-rate over a naive filter and conventional relaying schemes.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":"2014 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116912757","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-11-29DOI: 10.1109/ICC.2012.6363814
Ze Wang, M. Ma
Secure group communication for large wireless sensor networks sparkles the research on efficient key distribution and key management mechanism. By a self-healing key distribution scheme, even if during a certain session, some broadcast messages are lost due to network faults, the users are capable of recovering the lost session keys on their own without requesting additional information exchange with the group manager. However, some self-healing key distribution schemes are unable to prevent collusion attacks effectively. In this paper, a general self-healing session key distribution approach is devised to thwart collusion attacks. Furthermore, an effective collusion resilient key distribution scheme is proposed for the secure group communication in wireless sensor networks.
{"title":"A collusion-resilient self-healing key distribution scheme for wireless sensor networks","authors":"Ze Wang, M. Ma","doi":"10.1109/ICC.2012.6363814","DOIUrl":"https://doi.org/10.1109/ICC.2012.6363814","url":null,"abstract":"Secure group communication for large wireless sensor networks sparkles the research on efficient key distribution and key management mechanism. By a self-healing key distribution scheme, even if during a certain session, some broadcast messages are lost due to network faults, the users are capable of recovering the lost session keys on their own without requesting additional information exchange with the group manager. However, some self-healing key distribution schemes are unable to prevent collusion attacks effectively. In this paper, a general self-healing session key distribution approach is devised to thwart collusion attacks. Furthermore, an effective collusion resilient key distribution scheme is proposed for the secure group communication in wireless sensor networks.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":"159 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115750246","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-11-29DOI: 10.1109/ICC.2012.6364091
A. Sideris, E. Pallis, C. Skianis, V. Zacharopoulos
This paper discusses a Distributed Network Quality of Service (NQoS) provision approach in decentralized interactive DVB-T systems (IDVB-T), enabling for scalable and fault tolerant operation. The paper describes the design and overall architecture of a regenerative IDVB-T infrastructure, where network resource allocation and service classification processes are performed at local level within each intermediate distribution node (Cell Main Node CMN), setting the basis for a CMN-to-CMN NQoS provision. Validity of the proposed approach is experimentally verified, and the test-results are compared against the aggregated and federated NQoS provision approaches, indicating similar performance but better scalability and fault-tolerant design.
本文讨论了分布式交互式DVB-T系统(IDVB-T)中的分布式网络服务质量(NQoS)提供方法，使其能够实现可扩展和容错操作。本文描述了再生式IDVB-T基础设施的设计和总体架构，其中网络资源分配和服务分类过程在每个中间分布节点(Cell Main node CMN)的本地级别执行，为CMN到CMN NQoS提供奠定了基础。实验验证了该方法的有效性，并将测试结果与聚合和联邦NQoS提供方法进行了比较，结果表明该方法具有相似的性能，但具有更好的可扩展性和容错设计。
{"title":"Distributed NQoS provision in interactive DVB-T systems","authors":"A. Sideris, E. Pallis, C. Skianis, V. Zacharopoulos","doi":"10.1109/ICC.2012.6364091","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364091","url":null,"abstract":"This paper discusses a Distributed Network Quality of Service (NQoS) provision approach in decentralized interactive DVB-T systems (IDVB-T), enabling for scalable and fault tolerant operation. The paper describes the design and overall architecture of a regenerative IDVB-T infrastructure, where network resource allocation and service classification processes are performed at local level within each intermediate distribution node (Cell Main Node CMN), setting the basis for a CMN-to-CMN NQoS provision. Validity of the proposed approach is experimentally verified, and the test-results are compared against the aggregated and federated NQoS provision approaches, indicating similar performance but better scalability and fault-tolerant design.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134414993","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-11-29DOI: 10.1109/ICC.2012.6363655
Wei Chen, M. Rodrigues, I. Wassell
Compressive sensing (CS), a new sampling paradigm, has recently found several applications in wireless sensor networks (WSNs). In this paper, we investigate the design of novel sensing matrices which lead to good expected-case performance - a typical performance indicator in practice - rather than the conventional worst-case performance that is usually employed when assessing CS applications. In particular, we show that tight frames perform much better than the common CS Gaussian matrices in terms of the reconstruction average mean squared error (MSE). We also showcase the benefits of tight frames in two WSN applications, which involve: i) robustness to data sample losses; and ii) reduction of the communication cost.
{"title":"On the benefit of using tight frames for robust data transmission and compressive data gathering in wireless sensor networks","authors":"Wei Chen, M. Rodrigues, I. Wassell","doi":"10.1109/ICC.2012.6363655","DOIUrl":"https://doi.org/10.1109/ICC.2012.6363655","url":null,"abstract":"Compressive sensing (CS), a new sampling paradigm, has recently found several applications in wireless sensor networks (WSNs). In this paper, we investigate the design of novel sensing matrices which lead to good expected-case performance - a typical performance indicator in practice - rather than the conventional worst-case performance that is usually employed when assessing CS applications. In particular, we show that tight frames perform much better than the common CS Gaussian matrices in terms of the reconstruction average mean squared error (MSE). We also showcase the benefits of tight frames in two WSN applications, which involve: i) robustness to data sample losses; and ii) reduction of the communication cost.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129006118","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-11-29DOI: 10.1109/ICC.2012.6363857
A. Schmidt, W. Gerstacker
In this paper, we consider two-way relaying in a physical layer network coded system in a scenario where transmissions are subject to frequency-selective fading. Physical Layer Network Coding (PNC) enabled single-carrier transmission systems operating in flat fading environments have been subjected to scrutiny extensively, yet approaches for tackling the problem of extending them to environments causing multi-path fading are quite limited. We present three equalization schemes that can be used at the relay nodes to retrieve the data to be relayed in the presence of intersymbol interference (ISI). The most basic scheme jointly estimates both data streams and combines them afterwards. Furthermore, a scheme that already combines state and transition probabilities inside the trellis diagram is devised. Finally, we present a complexity-reduced algorithm where state combinations that yield the same bit to be relayed can be combined into a single state. All of the three algorithms can be regarded as different types of a decode-and-forward (DF) scheme.
{"title":"Trellis-based equalization schemes for physical layer network coding","authors":"A. Schmidt, W. Gerstacker","doi":"10.1109/ICC.2012.6363857","DOIUrl":"https://doi.org/10.1109/ICC.2012.6363857","url":null,"abstract":"In this paper, we consider two-way relaying in a physical layer network coded system in a scenario where transmissions are subject to frequency-selective fading. Physical Layer Network Coding (PNC) enabled single-carrier transmission systems operating in flat fading environments have been subjected to scrutiny extensively, yet approaches for tackling the problem of extending them to environments causing multi-path fading are quite limited. We present three equalization schemes that can be used at the relay nodes to retrieve the data to be relayed in the presence of intersymbol interference (ISI). The most basic scheme jointly estimates both data streams and combines them afterwards. Furthermore, a scheme that already combines state and transition probabilities inside the trellis diagram is devised. Finally, we present a complexity-reduced algorithm where state combinations that yield the same bit to be relayed can be combined into a single state. All of the three algorithms can be regarded as different types of a decode-and-forward (DF) scheme.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123818382","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-11-29DOI: 10.1109/ICC.2012.6364129
Zehua Wang, Cheng-Ying Li, Y. Chen
Opportunistic data forwarding draws more and more attention in the research community of wireless network after the initial work ExOR was published. However, as far as we know, all existing opportunistic data forwarding only use the nodes which are included in the forwarder list in the entire forwarding progress. In fact, even if a node is not a listed forwarder in the forwarder list, but it is on the direction from source node to destination node, and when it successfully overhears some packets by opportunity, the node actually can be utilized in the opportunistic data forwarding progress. In this paper, we propose the local cooperative relay for opportunistic data forwarding in mobile ad-hoc networks. In general, three contributions we have in this paper, 1) we open more node to participate in the opportunistic data forwarding even though the nodes are not included in the forwarder list, 2) we propose the procedure to select the best local relay node, namely the helper-node, from many candidates but require no inner communication between them, 3) the helper-node is selected just when it is needed, and the such real time selection can tolerate and bridge vulnerable links in mobile networks.
{"title":"Local cooperative relay for opportunistic data forwarding in mobile ad-hoc networks","authors":"Zehua Wang, Cheng-Ying Li, Y. Chen","doi":"10.1109/ICC.2012.6364129","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364129","url":null,"abstract":"Opportunistic data forwarding draws more and more attention in the research community of wireless network after the initial work ExOR was published. However, as far as we know, all existing opportunistic data forwarding only use the nodes which are included in the forwarder list in the entire forwarding progress. In fact, even if a node is not a listed forwarder in the forwarder list, but it is on the direction from source node to destination node, and when it successfully overhears some packets by opportunity, the node actually can be utilized in the opportunistic data forwarding progress. In this paper, we propose the local cooperative relay for opportunistic data forwarding in mobile ad-hoc networks. In general, three contributions we have in this paper, 1) we open more node to participate in the opportunistic data forwarding even though the nodes are not included in the forwarder list, 2) we propose the procedure to select the best local relay node, namely the helper-node, from many candidates but require no inner communication between them, 3) the helper-node is selected just when it is needed, and the such real time selection can tolerate and bridge vulnerable links in mobile networks.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129133212","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-11-29DOI: 10.1109/ICC.2012.6364344
Boyuan Zhang, Changcheng Huang, James Yan
By simultaneously providing live video and audio contents to millions of users around the world, peer-to-peer live video streaming (P2P LVS) has become one of the most popular Internet applications in recent years. However, current P2P LVS software has problems such as non-smooth playback and long start-up delay for end users. To address these issues, we design a P2P-based multi-bit Trie structure, called Bottom-Up Trie (BU-Trie), for distributing P2P live contents. Different from other approaches, BU-Trie is a Trie formed and built inversely from leaf nodes (or child nodes) back to the root node (or parent node). This architecture consists of two phases: a diffusion phase and a swarming phase. The main design goal of the diffusion phase is to group the local peers together by discovering physical locations of peers, and design the paths for fast distributing live streams from the source node to end users. The objective of the swarming phase is to find an optimal way for exchanging the video stream chunks within a local group. We propose an algorithm called Most Popular Chunk First (MPCF) and apply it for the swarming phase for efficient chunk exchange. Performance evaluation of the proposed BU-Trie shows that, when compared to other approaches, the sequential throughput of video chunks is increased. The inter-domain traffic, the traffic between different Internet service providers (ISPs), is reduced as well. Such a reduction would benefit carriers economically.
P2P视频流(peer-to-peer live video streaming, P2P LVS)通过向全球数百万用户同时提供实时视频和音频内容，已成为近年来最受欢迎的互联网应用之一。然而，目前的P2P LVS软件对终端用户来说存在播放不流畅、启动延迟长等问题。为了解决这些问题，我们设计了一个基于P2P的多比特树结构，称为自底向上树(BU-Trie)，用于分发P2P实时内容。与其他方法不同的是，BU-Trie是从叶节点(或子节点)反向构建到根节点(或父节点)的Trie。该体系结构由两个阶段组成:扩散阶段和群集阶段。扩散阶段的主要设计目标是通过发现节点的物理位置将本地节点分组在一起，并设计从源节点到最终用户快速分发实时流的路径。蜂群阶段的目标是找到在本地组内交换视频流块的最佳方法。我们提出了一种称为最受欢迎的块优先(MPCF)算法，并将其应用于群集阶段，以实现高效的块交换。性能评估表明，与其他方法相比，所提出的BU-Trie方法提高了视频块的顺序吞吐量。域间流量，即不同互联网服务提供商(isp)之间的流量，也减少了。这样的削减将使航空公司在经济上受益。
{"title":"Bottom-up trie structure for P2P live streaming","authors":"Boyuan Zhang, Changcheng Huang, James Yan","doi":"10.1109/ICC.2012.6364344","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364344","url":null,"abstract":"By simultaneously providing live video and audio contents to millions of users around the world, peer-to-peer live video streaming (P2P LVS) has become one of the most popular Internet applications in recent years. However, current P2P LVS software has problems such as non-smooth playback and long start-up delay for end users. To address these issues, we design a P2P-based multi-bit Trie structure, called Bottom-Up Trie (BU-Trie), for distributing P2P live contents. Different from other approaches, BU-Trie is a Trie formed and built inversely from leaf nodes (or child nodes) back to the root node (or parent node). This architecture consists of two phases: a diffusion phase and a swarming phase. The main design goal of the diffusion phase is to group the local peers together by discovering physical locations of peers, and design the paths for fast distributing live streams from the source node to end users. The objective of the swarming phase is to find an optimal way for exchanging the video stream chunks within a local group. We propose an algorithm called Most Popular Chunk First (MPCF) and apply it for the swarming phase for efficient chunk exchange. Performance evaluation of the proposed BU-Trie shows that, when compared to other approaches, the sequential throughput of video chunks is increased. The inter-domain traffic, the traffic between different Internet service providers (ISPs), is reduced as well. Such a reduction would benefit carriers economically.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129301346","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-11-29DOI: 10.1109/ICC.2012.6364385
T. Nguyen, Aria Nosratinia, D. Divsalar
This paper addresses the design of a protograph-based LDPC code which can approach the independent and uniformly distributed (i.u.d.) capacity of partial response channels. We propose a method to calculate the iterative decoding threshold of a joint graph between a protograph and the state structure of a partial response channel using the extrinsic information transfer (EXIT) chart. We then describe a simple method to search for a protograph code whose threshold is close to the i.u.d. capacity limit. This new class of codes is needed because experiments show a protograph that is capacity approaching in the AWGN channel may not perform well in partial response channels. In particular, protographs with punctured nodes are often used to produce good AWGN codes, but they perform poorly with the BCJR equalizer. Numerical results support our analysis.
本文讨论了一种基于原型的LDPC码的设计，该码可以接近部分响应信道的独立和均匀分布(i.u.d)容量。提出了一种利用外在信息传递(extrinsic information transfer, EXIT)图计算原图与部分响应信道状态结构之间的联合图的迭代解码阈值的方法。然后，我们描述了一种简单的方法来搜索其阈值接近输液器容量限制的原型代码。由于实验表明，在AWGN信道中容量接近的原型可能在部分响应信道中表现不佳，因此需要这种新型编码。特别是，带有穿刺节点的原型通常用于生成良好的AWGN代码，但它们在BCJR均衡器上表现不佳。数值结果支持了我们的分析。
{"title":"Protograph-based LDPC codes for partial response channels","authors":"T. Nguyen, Aria Nosratinia, D. Divsalar","doi":"10.1109/ICC.2012.6364385","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364385","url":null,"abstract":"This paper addresses the design of a protograph-based LDPC code which can approach the independent and uniformly distributed (i.u.d.) capacity of partial response channels. We propose a method to calculate the iterative decoding threshold of a joint graph between a protograph and the state structure of a partial response channel using the extrinsic information transfer (EXIT) chart. We then describe a simple method to search for a protograph code whose threshold is close to the i.u.d. capacity limit. This new class of codes is needed because experiments show a protograph that is capacity approaching in the AWGN channel may not perform well in partial response channels. In particular, protographs with punctured nodes are often used to produce good AWGN codes, but they perform poorly with the BCJR equalizer. Numerical results support our analysis.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130286662","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-07-01DOI: 10.1109/ISIT.2012.6283568
Jun Zhang, Chao-Kai Wen, Shi Jin, Xiqi Gao, Kai‐Kit Wong
In this paper, we investigate the asymptotic mutual information expression and the capacity-achieving input covariance matrices for the coordinated multi-point multiple-input multiple-output (MIMO) antenna channels. In particular, it is considered that the numbers of antennas at the transmitter and receiver approach to infinity with a fixed ratio. Our derivations are based on novel techniques from large dimensional random matrix theory. In contrast to previous studies, we consider a general model in which the correlation matrices are generally nonnegative definite and the channel entries are non-Gaussian distributed. We show that the asymptotic capacity is invariant to all types of fading distribution. As such, the asymptotic mutual information expression is robust and has wide applicability.
{"title":"On asymptotic capacity of coordinated multi-point MIMO channels","authors":"Jun Zhang, Chao-Kai Wen, Shi Jin, Xiqi Gao, Kai‐Kit Wong","doi":"10.1109/ISIT.2012.6283568","DOIUrl":"https://doi.org/10.1109/ISIT.2012.6283568","url":null,"abstract":"In this paper, we investigate the asymptotic mutual information expression and the capacity-achieving input covariance matrices for the coordinated multi-point multiple-input multiple-output (MIMO) antenna channels. In particular, it is considered that the numbers of antennas at the transmitter and receiver approach to infinity with a fixed ratio. Our derivations are based on novel techniques from large dimensional random matrix theory. In contrast to previous studies, we consider a general model in which the correlation matrices are generally nonnegative definite and the channel entries are non-Gaussian distributed. We show that the asymptotic capacity is invariant to all types of fading distribution. As such, the asymptotic mutual information expression is robust and has wide applicability.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127764098","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
扫码关注我们
求助内容：
应助结果提醒方式：