2012 IEEE International Conference on Communications (ICC)最新文献

筛选
英文 中文
Alternate MIMO relaying with three AF relays using interference alignment 交替MIMO中继与三个自动对焦继电器使用干扰对准
2012 IEEE International Conference on Communications (ICC) Pub Date : 2012-11-29 DOI: 10.1109/ICC.2012.6364543
Kihong Park, Mohamed-Slim Alouini
{"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":null,"pages":null},"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}
引用次数: 5
Approximated algorithms for mapping virtual networks on network substrates 网络基板上虚拟网络映射的近似算法
2012 IEEE International Conference on Communications (ICC) Pub Date : 2012-11-29 DOI: 10.1109/ICC.2012.6364428
G. P. Alkmim, D. Batista, N. Fonseca
{"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":null,"pages":null},"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}
引用次数: 9
The value centric information and intelligence sharing scheme 以价值为中心的信息和情报共享方案
2012 IEEE International Conference on Communications (ICC) Pub Date : 2012-11-29 DOI: 10.1109/ICC.2012.6364804
Shinichi Doi, O. Kamatani, R. Kawamura
{"title":"The value centric information and intelligence sharing scheme","authors":"Shinichi Doi, O. Kamatani, R. Kawamura","doi":"10.1109/ICC.2012.6364804","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364804","url":null,"abstract":"The information in the network has been increasing, and it is dominated by a few heavy users. This imbalance is an insignificant problem if there is an abundance of network resources. Unfortunately, the available resources are not infinite. Thus we have to develop a future network architecture that considers resource starvation. We present Value-Centric Networking (VCN) which is based on Information Value. The main purpose of VCN is to maximize Information Value in the network, and thus support the entire society. We implement the VCN architecture concept in the form of a proxy server and confirmed that VCN operation forwarded the high information value streams passing through the proxy server faster than ordinary FIFO operation. In addition, we discuss the controversial issues of VCN, value definition and feasibility.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129338110","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}
引用次数: 0
Distributed NQoS provision in interactive DVB-T systems 交互式DVB-T系统中的分布式NQoS提供
2012 IEEE International Conference on Communications (ICC) Pub Date : 2012-11-29 DOI: 10.1109/ICC.2012.6364091
A. Sideris, E. Pallis, C. Skianis, V. Zacharopoulos
{"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":null,"pages":null},"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}
引用次数: 2
On the benefit of using tight frames for robust data transmission and compressive data gathering in wireless sensor networks 在无线传感器网络中使用紧凑帧进行稳健数据传输和压缩数据采集的好处
2012 IEEE International Conference on Communications (ICC) Pub Date : 2012-11-29 DOI: 10.1109/ICC.2012.6363655
Wei Chen, M. Rodrigues, I. Wassell
{"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":null,"pages":null},"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}
引用次数: 6
Local cooperative relay for opportunistic data forwarding in mobile ad-hoc networks 移动自组织网络中机会数据转发的本地协作中继
2012 IEEE International Conference on Communications (ICC) Pub Date : 2012-11-29 DOI: 10.1109/ICC.2012.6364129
Zehua Wang, Cheng-Ying Li, Y. Chen
{"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":null,"pages":null},"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}
引用次数: 15
Bottom-up trie structure for P2P live streaming 自底向上的三层结构P2P直播
2012 IEEE International Conference on Communications (ICC) Pub Date : 2012-11-29 DOI: 10.1109/ICC.2012.6364344
Boyuan Zhang, Changcheng Huang, James Yan
{"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":null,"pages":null},"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}
引用次数: 1
Protograph-based LDPC codes for partial response channels 部分响应通道的基于原型的LDPC代码
2012 IEEE International Conference on Communications (ICC) Pub Date : 2012-11-29 DOI: 10.1109/ICC.2012.6364385
T. Nguyen, Aria Nosratinia, D. Divsalar
{"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":null,"pages":null},"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}
引用次数: 17
Trellis-based equalization schemes for physical layer network coding 基于网格的物理层网络编码均衡方案
2012 IEEE International Conference on Communications (ICC) Pub Date : 2012-11-29 DOI: 10.1109/ICC.2012.6363857
A. Schmidt, W. Gerstacker
{"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":null,"pages":null},"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}
引用次数: 5
On asymptotic capacity of coordinated multi-point MIMO channels 协调多点MIMO信道的渐近容量
2012 IEEE International Conference on Communications (ICC) Pub Date : 2012-07-01 DOI: 10.1109/ISIT.2012.6283568
Jun Zhang, Chao-Kai Wen, Shi Jin, Xiqi Gao, Kai‐Kit Wong
{"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":null,"pages":null},"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}
引用次数: 1
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信