发布求助
文献互助 智能选刊 最新文献

2012 1st IEEE International Conference on Communications in China (ICCC)最新文献

筛选
英文 中文
Opportunistic DF-AF selection relaying with optimal relay selection in Nakagami-m fading environments 中川衰落环境下具有最佳中继选择的机会DF-AF选择中继
2012 1st IEEE International Conference on Communications in China (ICCC) Pub Date : 2013-01-01 DOI: 10.1109/ICCChina.2012.6356958
Tian Zhang, Wei Chen, Z. Cao
{"title":"Opportunistic DF-AF selection relaying with optimal relay selection in Nakagami-m fading environments","authors":"Tian Zhang, Wei Chen, Z. Cao","doi":"10.1109/ICCChina.2012.6356958","DOIUrl":"https://doi.org/10.1109/ICCChina.2012.6356958","url":null,"abstract":"An opportunistic DF-AF selection relaying scheme with maximal received signal-to-noise ratio (SNR) at the destination is investigated in this paper. The outage probability of the opportunistic DF-AF selection relaying scheme over Nakagami-m fading channels is analyzed, and a closed-form solution is obtained. We perform asymptotic analysis of the outage probability in high SNR domain. The coding gain and the diversity order are obtained. For the purpose of comparison, the asymptotic analysis of opportunistic AF scheme in Nakagami-m fading channels is also performed by using the Squeeze Theorem. In addition, we prove that compared with the opportunistic DF scheme and opportunistic AF scheme, the opportunistic DF-AF selection relaying scheme has better outage performance.","PeriodicalId":154082,"journal":{"name":"2012 1st IEEE International Conference on Communications in China (ICCC)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116990519","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}
引用次数: 14
Performance analysis of vector OFDM with linear MMSE receiver 线性MMSE接收机矢量OFDM的性能分析
2012 1st IEEE International Conference on Communications in China (ICCC) Pub Date : 2012-11-26 DOI: 10.1109/ICCChina.2012.6356912
Yabo Li, I. Ngebani, X. Xia, A. Høst-Madsen
{"title":"Performance analysis of vector OFDM with linear MMSE receiver","authors":"Yabo Li, I. Ngebani, X. Xia, A. Høst-Madsen","doi":"10.1109/ICCChina.2012.6356912","DOIUrl":"https://doi.org/10.1109/ICCChina.2012.6356912","url":null,"abstract":"Vector OFDM (V-OFDM) for single transmit antenna systems is a general transmission scheme in which OFDM and Single-Carrier Frequency Domain Equalization (SC-FDE) can be considered as two extreme/special cases. Due to its flexibility, it has attracted more and more attention recently. So far all studies about V-OFDM assume the Maximum Likelihood (ML) receiver. In this paper, we investigate the performance of V-OFDM with linear Minimum Mean Square Error (MMSE) receiver. We first show that for linear MMSE receiver, all the vector blocks (VB) in V-OFDM have equal performance, this is different from V-OFDM with ML receiver, where different VBs may have different performances. Then, we analyze the diversity order of V-OFDM with linear MMSE receiver, and show that, regardless of the V-OFDM symbol length N, the diversity order can be represented as min{[M2_R], D} + 1, where M is the VB size, R is the spectrum efficiency in bits/symbol, and D is the maximum delay of the multipath channel.","PeriodicalId":154082,"journal":{"name":"2012 1st IEEE International Conference on Communications in China (ICCC)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124784645","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
Adaptive joint mapping generalised spatial modulation 自适应联合映射广义空间调制
2012 1st IEEE International Conference on Communications in China (ICCC) Pub Date : 2012-11-26 DOI: 10.1109/ICCChina.2012.6356939
Ning Ma, Anguo Wang, Changcai Han, Yuchu Ji
{"title":"Adaptive joint mapping generalised spatial modulation","authors":"Ning Ma, Anguo Wang, Changcai Han, Yuchu Ji","doi":"10.1109/ICCChina.2012.6356939","DOIUrl":"https://doi.org/10.1109/ICCChina.2012.6356939","url":null,"abstract":"Generalised spatial modulation (GSM) is a recently proposed transmission technology for Multiple-Input Multiple-Output (MIMO) wireless system, which extends the concept of spatial modulation (SM) and increases the spectral efficiency of SM. In this paper, a novel adaptive joint mapping scheme for GSM is presented. In adaptive joint mapping generalised spatial modulation (AJM-GSM) system, the input information bits are jointly mapped to a mapping table which indicates both the spatial constellation and the signal constellation. The mapping table is updated adaptively according to the channel state information, so the symbol error ratio (SER) performance of AJM-GSM is superior to GSM and SM. Monte Carlo simulations are carried out to validate the performance of AJM-GSM.","PeriodicalId":154082,"journal":{"name":"2012 1st IEEE International Conference on Communications in China (ICCC)","volume":"330 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129458744","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
Realistic storage of pending requests in Content-Centric Network routers 在以内容为中心的网络路由器中实际存储挂起的请求
2012 1st IEEE International Conference on Communications in China (ICCC) Pub Date : 2012-11-26 DOI: 10.1109/ICCChina.2012.6356864
Wei You, B. Mathieu, Patrick Truong, Jean-François Peltier, G. Simon
{"title":"Realistic storage of pending requests in Content-Centric Network routers","authors":"Wei You, B. Mathieu, Patrick Truong, Jean-François Peltier, G. Simon","doi":"10.1109/ICCChina.2012.6356864","DOIUrl":"https://doi.org/10.1109/ICCChina.2012.6356864","url":null,"abstract":"Content-Centric Networking (CCN) is a novel network paradigm, which aims at moving from the traditional host-to-host network model to a client-to-content one. This shift brings many benefits but also leads a big challenge on the hardware technologies for implementing CCN nodes. For example the Pending Interest Table, one critical component in a CCN node, is involved in every CCN message forwarding process, and needs to be updated every time a packet comes in. The implementation of this table requires a memory that is fast for short access time and also large enough for storing the pending Interests. Unfortunately today's memory technologies cannot meet these requirements with the current hash-based architecture. After highlighting this limitation, we present a distributed PIT architecture which is based on the Bloom filter structure. The evaluations validate that our solution can reduce the PIT table size and support higher packet arrival rate. Our solution allows to implement this component on today's fast memory like SRAM. Therefore this proposal can improve the content fetching performance and improve the quality of content delivered in CCN network.","PeriodicalId":154082,"journal":{"name":"2012 1st IEEE International Conference on Communications in China (ICCC)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129681140","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}
引用次数: 14
Limits of data stream compression under the L∞ norm L∞范数下数据流压缩的限制
2012 1st IEEE International Conference on Communications in China (ICCC) Pub Date : 2012-11-26 DOI: 10.1109/ICCChina.2012.6356909
Alexandru-Corneliu Arion, Hoyoung Jeung, K. Aberer
{"title":"Limits of data stream compression under the L∞ norm","authors":"Alexandru-Corneliu Arion, Hoyoung Jeung, K. Aberer","doi":"10.1109/ICCChina.2012.6356909","DOIUrl":"https://doi.org/10.1109/ICCChina.2012.6356909","url":null,"abstract":"As vast environmental monitoring projects continue to proliferate, the problem of efficient data representation becomes more and more significant. We tackle the fundamental question of what is the limit of lossy compression of a data stream under the L∞ norm. We describe a method to compute a conservative estimate of the entropy of a sequence of non-independent random variables underlying a data stream. We find experimentally that the conservative limit estimation lies as low as 1/5 of the best performing practical representation methods.","PeriodicalId":154082,"journal":{"name":"2012 1st IEEE International Conference on Communications in China (ICCC)","volume":"30 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120920125","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
A variable breadth based adaptive tree search algorithm for MIMO systems 一种基于变宽度的自适应树搜索算法
2012 1st IEEE International Conference on Communications in China (ICCC) Pub Date : 2012-11-26 DOI: 10.1109/ICCChina.2012.6356911
Jie Xiao, Pinyi Ren, Qinghe Du
{"title":"A variable breadth based adaptive tree search algorithm for MIMO systems","authors":"Jie Xiao, Pinyi Ren, Qinghe Du","doi":"10.1109/ICCChina.2012.6356911","DOIUrl":"https://doi.org/10.1109/ICCChina.2012.6356911","url":null,"abstract":"Near maximum-likelihood (ML) detections based on the tree search can approach the optimal performance with reduced complexity in Multiple-Input Multiple-Output (MIMO) systems. The breadth-first scheme is widely applied in practical systems for its stable and upper-bounded throughput. However, the major drawback of breadth-first detection is still the relatively high computational complexity. In this paper, we propose a variable breadth based adaptive tree search (VBA) scheme to further reduce the complexity. In particular, we introduce a variable metric constraint to dynamically regulate the searching breadth, which is determined by the accumulated metric of the partial zero-forcing (ZF) sequence at each layer of the searching tree during the adaptive candidate selection process. Simulation results and analysis show that the proposed algorithm can further reduce the detection complexity without degrading bit-error-rate (BER) performance.","PeriodicalId":154082,"journal":{"name":"2012 1st IEEE International Conference on Communications in China (ICCC)","volume":"183 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121938174","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
Cooperative spectrum sensing based on spatially-correlated Rayleigh shadowing 基于空间相关瑞利阴影的协同频谱感知
2012 1st IEEE International Conference on Communications in China (ICCC) Pub Date : 2012-11-26 DOI: 10.1109/ICCChina.2012.6356899
Yong Zhang, Zhong Chen, F. Gao, Xianda Zhang
{"title":"Cooperative spectrum sensing based on spatially-correlated Rayleigh shadowing","authors":"Yong Zhang, Zhong Chen, F. Gao, Xianda Zhang","doi":"10.1109/ICCChina.2012.6356899","DOIUrl":"https://doi.org/10.1109/ICCChina.2012.6356899","url":null,"abstract":"Cooperative spectrum sensing has been proposed to help raise the sensitivity requirement under the fading propagation in Cognitive Radio Network. In this paper, we introduce a new explanation that the best probability of detection or false alarm can be achieved from only parts of the cooperative secondary users under different scenarios. Specifically, we analyze from the new perspective of spatially-correlated shadowing and formulate the probability of detection as a function of the correlation coefficient. The simulation shows that, given a targeted cooperative probability of false alarm, the cooperative probability of detection decreases as correlation increases. The range of an appropriate distance between secondary users is derived based on the accuracy and sensitivity of the Cognitive Radio system. According to the correlation coefficient between two SUs, we can determine the cooperative SUs' set to get better performance of Cognitive Radio Network.","PeriodicalId":154082,"journal":{"name":"2012 1st IEEE International Conference on Communications in China (ICCC)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128188546","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}
引用次数: 3
Energy efficient base station deployment in green cellular networks with traffic variations 具有流量变化的绿色蜂窝网络中的节能基站部署
2012 1st IEEE International Conference on Communications in China (ICCC) Pub Date : 2012-11-26 DOI: 10.1109/ICCChina.2012.6356915
Yiqun Wu, Z. Niu
{"title":"Energy efficient base station deployment in green cellular networks with traffic variations","authors":"Yiqun Wu, Z. Niu","doi":"10.1109/ICCChina.2012.6356915","DOIUrl":"https://doi.org/10.1109/ICCChina.2012.6356915","url":null,"abstract":"In this paper, we study how to deploy base stations (BSs) in green cellular networks, where BSs can be switched off to save energy when traffic load is low. Unlike previous studies which deploy BSs only based on the peak traffic load, our BS deployment scheme is based on the whole traffic variation process. In particular, we consider a linear cellular network where BSs are regularly deployed and users are uniformly distributed. Given the traffic variation process and the performance constraint, we obtain the energy optimal BS density by evaluating the network energy consumption in an analytical way. Simulation results show that compared with the BS deployment scheme based on peak traffic load, the energy consumption of our scheme can be reduced by more than 20%, and the performance improvement depends on the detailed traffic variation process.","PeriodicalId":154082,"journal":{"name":"2012 1st IEEE International Conference on Communications in China (ICCC)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115914182","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}
引用次数: 26
A multi-dimentional traffic distributing algorithm for network cost optimization 一种网络成本优化的多维流量分配算法
2012 1st IEEE International Conference on Communications in China (ICCC) Pub Date : 2012-11-26 DOI: 10.1109/ICCChina.2012.6356896
Peng Gao, Dexiang Meng, Shoufeng Wang, Dongchen Zhang, Nan Cheng, Yi Zhan
{"title":"A multi-dimentional traffic distributing algorithm for network cost optimization","authors":"Peng Gao, Dexiang Meng, Shoufeng Wang, Dongchen Zhang, Nan Cheng, Yi Zhan","doi":"10.1109/ICCChina.2012.6356896","DOIUrl":"https://doi.org/10.1109/ICCChina.2012.6356896","url":null,"abstract":"It is of most concern by the operators who run multiple networks that how much traffic should each network carry to obtain the minimum cost for the operator. But it is left unanswered by current researches. A multi-dimensional traffic distributing algorithm for network cost optimization is proposed to obtain the optimal traffic distribution. In the proposed algorithm, multiple factors effecting traffic distribution are concerned, such as service types, network capacity, network coverage, network cost, user habit, and terminals. Evaluations prove that the proposed algorithm provides less network cost than load balancing scheme.","PeriodicalId":154082,"journal":{"name":"2012 1st IEEE International Conference on Communications in China (ICCC)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132419271","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
Network-welfare maximization for Cognitive Radio Networks via optimal matching 基于最优匹配的认知无线网络网络福利最大化
2012 1st IEEE International Conference on Communications in China (ICCC) Pub Date : 2012-11-26 DOI: 10.1109/ICCChina.2012.6356952
Yuan Wu, D. Tsang, L. Qian, L. Meng
{"title":"Network-welfare maximization for Cognitive Radio Networks via optimal matching","authors":"Yuan Wu, D. Tsang, L. Qian, L. Meng","doi":"10.1109/ICCChina.2012.6356952","DOIUrl":"https://doi.org/10.1109/ICCChina.2012.6356952","url":null,"abstract":"In this paper, we consider the network-welfare optimization for a Cognitive Radio Network (CRN) consisting of multiple Primary-Users (PUs) and multiple Secondary-Users (SUs). For each pair of PU and SU, the interaction between them is modeled as a Stackelberg game where the PU shares its licensed channel with the SU by charging the interference, and the SU is allowed to access the PU channel by paying the interference fee. The objective of the CRN thus is to maximize the network-welfare of all PUs and SUs by forming optimal pairs among them, which can be considered as a Maximum Weight Matching (MWM) problem on a bipartite graph. We first propose an efficient algorithm to quantify the optimal social welfare associated with each pair of PU and SU. Then, by exploiting the special structure of the MWM problem, we propose two algorithms, namely, a modified Belief Propagation (BP) algorithm and a heuristic algorithm based on Simulated Annealing (SA) to determine the optimal matching.","PeriodicalId":154082,"journal":{"name":"2012 1st IEEE International Conference on Communications in China (ICCC)","volume":"25 8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134413295","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
下一页 尾页
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学术文献互助群
群 号：604180095
Book学术官方微信