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

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

筛选
英文 中文
Throughput-optimized cross-layer routing for cognitive radio networks 认知无线网络的吞吐量优化跨层路由
2012 1st IEEE International Conference on Communications in China (ICCC) Pub Date : 2012-11-26 DOI: 10.1109/ICCChina.2012.6356982
Minghao Zhan, Pinyi Ren, Chao Zhang, Fan Li
{"title":"Throughput-optimized cross-layer routing for cognitive radio networks","authors":"Minghao Zhan, Pinyi Ren, Chao Zhang, Fan Li","doi":"10.1109/ICCChina.2012.6356982","DOIUrl":"https://doi.org/10.1109/ICCChina.2012.6356982","url":null,"abstract":"Cognitive radio (CR) is a promising technology to solve the spectrum scarcity problem by enabling secondary users (SU) to utilize the spectrum holes of primary users (PU) caused by static spectrum allocation. However, SUs need to avoid the interference to PUs, imposing new challenges in routing protocol designs and throughput improvement in CR networks (CRN). In this paper we propose a cross-layer channel assignment and routing (CCAR) algorithm. Specifically, our CCAR algorithm aims at throughput maximization while addressing the interference avoidance issue in CRNs. Solving for the optimal solution towards throughput maximization is a NP problem. In contrast, we simplify this optimization problem by taking advantage of the correlation of data flow and routing information across the network nodes. Then, further making use of the adjacent hop interference (AHI) Information, we develop a heuristic approach to obtain a suboptimal solution. Theoretical analysis and simulation results show that our proposed CCAR algorithm can achieve polynomial complexity at the cost of only 20% throughput loss as compared to the optimal solution.","PeriodicalId":154082,"journal":{"name":"2012 1st IEEE International Conference on Communications in China (ICCC)","volume":"22 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113997354","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}
引用次数: 4
Fast semi-blind channel estimation for MIMO-OFDM systems with virtual carriers 带有虚拟载波的MIMO-OFDM系统快速半盲信道估计
2012 1st IEEE International Conference on Communications in China (ICCC) Pub Date : 2012-11-26 DOI: 10.1109/ICCChina.2012.6356907
Jung-Lang Yu, Wan-Ru Kuo
{"title":"Fast semi-blind channel estimation for MIMO-OFDM systems with virtual carriers","authors":"Jung-Lang Yu, Wan-Ru Kuo","doi":"10.1109/ICCChina.2012.6356907","DOIUrl":"https://doi.org/10.1109/ICCChina.2012.6356907","url":null,"abstract":"Novel blind and semi-blind subspace channel estimations are proposed for multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) systems in the presence of virtual carriers (VC). Slow convergence rate is a drawback of subspace method in deriving the noise/signal subspaces from the second-order statistics of received signals, especially when the dimension of received signals is large. In this paper, the block matrix scheme is proposed to generate a group of sub-vectors from each OFDM symbols. The dimension of sub-vectors is reduced and the number of equivalent signals is increased, and therefore, the convergence rate of channel estimation is enhanced. The semi-blind method is also developed by incorporating the subspace technology with pilot information. Computer simulations show that the proposed blind and semiblind methods converge very well in channel estimation and equalization.","PeriodicalId":154082,"journal":{"name":"2012 1st IEEE International Conference on Communications in China (ICCC)","volume":"7 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":"131361322","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
Location assisted routing with network coding in vehicular delay tolerant networks 基于网络编码的车辆容错网络位置辅助路由
2012 1st IEEE International Conference on Communications in China (ICCC) Pub Date : 2012-11-26 DOI: 10.1109/ICCChina.2012.6356967
Tzu-Chieh Tsai, Chieh-Cheng Chen
{"title":"Location assisted routing with network coding in vehicular delay tolerant networks","authors":"Tzu-Chieh Tsai, Chieh-Cheng Chen","doi":"10.1109/ICCChina.2012.6356967","DOIUrl":"https://doi.org/10.1109/ICCChina.2012.6356967","url":null,"abstract":"This paper proposed a routing protocol integrating both the characteristic of the flooding-based protocol and forwarding-based protocol. The basic idea of our protocol is to let message be forwarded to the nodes moving toward or closer to destination. When nodes contact with each other, our approach will utilize the path of the node, node's moving direction and velocity to estimate the probability to reach the destination of the message. At the same time, we exploit network coding to transmit coded block instead of message fragment in order to avoid sending redundant replication. In this way, data transport is more reliable and more robust to packet losses or delays. From the results of simulation, we could see that our protocol has enhanced performance, especially for the bandwidth consumption compared to other protocols.","PeriodicalId":154082,"journal":{"name":"2012 1st IEEE International Conference on Communications in China (ICCC)","volume":"14 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":"132796340","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
Peak-to-average ratio reduction with Tone Reservation in multi-user and MIMO OFDM 多用户和MIMO OFDM中带音调保留的峰均比降低
2012 1st IEEE International Conference on Communications in China (ICCC) Pub Date : 2012-11-26 DOI: 10.1109/ICCChina.2012.6356910
W. Henkel, Abdul Wakeel, Maja Taseska
{"title":"Peak-to-average ratio reduction with Tone Reservation in multi-user and MIMO OFDM","authors":"W. Henkel, Abdul Wakeel, Maja Taseska","doi":"10.1109/ICCChina.2012.6356910","DOIUrl":"https://doi.org/10.1109/ICCChina.2012.6356910","url":null,"abstract":"We extend Tone Reservation for peak-to-average ratio reduction in MIMO-multiuser OFDM scenarios. First, we consider a multi-user BC (broadcast) situation where a precoding is applied at every carrier. This is considered to be a very demanding situation for peak-to-average ratio reduction. Tellado's Tone Reservation, however, is especially suited for this situation, as well. It reserves all spatial dimensions of the reserved carriers and has hence not to take into account possible implications resulting from precoding. Secondly, for a point-to-point (pt2pt) MIMO-OFDM scenario, we assume that the last eigenchannel is too weak to be used for transmission, thus, reserving it will offer redundancy for peak-to-average ratio reduction. The algorithm in both cases completely operates in time domain and is shown to additionally profit from multiple spatial dimensions when iteratively only the highest peak spatial components are processed.","PeriodicalId":154082,"journal":{"name":"2012 1st IEEE International Conference on Communications in China (ICCC)","volume":"50 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":"132922419","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
Partial expansion sphere decoder with reduced branching factor for MIMO systems MIMO系统分支因子减小的部分展开球解码器
2012 1st IEEE International Conference on Communications in China (ICCC) Pub Date : 2012-11-26 DOI: 10.1109/ICCChina.2012.6356937
Shuangshuang Han, C. Tellambura
{"title":"Partial expansion sphere decoder with reduced branching factor for MIMO systems","authors":"Shuangshuang Han, C. Tellambura","doi":"10.1109/ICCChina.2012.6356937","DOIUrl":"https://doi.org/10.1109/ICCChina.2012.6356937","url":null,"abstract":"Multiple-input multiple-output (MIMO) detection could be modeled to a tree search problem. This paper proposes one sphere decoder algorithm called partial expansion sphere decoder (PESD) by pruning the search tree using a reduced branching factor. The main idea of the proposed PESD is to reduce the detection complexity by decreasing the branching factor for the search tree. The trade-off between the performance and complexity can be easily controlled by the branching factor. In order to further improve the PESD, a hybrid PESD is proposed by combining the full enumeration for the first several layers of the search tree and the proposed PESD. The simulation results demonstrate that the PESD achieves a flexible trade-off depending on the branching factor and shows that the hybrid PESD obtains performance gains than the pure PESD with the same branching factor.","PeriodicalId":154082,"journal":{"name":"2012 1st IEEE International Conference on Communications in China (ICCC)","volume":"43 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":"133690525","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
Collaborative data dissemination in cognitive VANETs with sensing-throughput tradeoff 基于感知-吞吐量权衡的认知vanet协同数据传播
2012 1st IEEE International Conference on Communications in China (ICCC) Pub Date : 2012-11-26 DOI: 10.1109/ICCChina.2012.6356860
Tianyu Wang, Lingyang Song, Zhu Han
{"title":"Collaborative data dissemination in cognitive VANETs with sensing-throughput tradeoff","authors":"Tianyu Wang, Lingyang Song, Zhu Han","doi":"10.1109/ICCChina.2012.6356860","DOIUrl":"https://doi.org/10.1109/ICCChina.2012.6356860","url":null,"abstract":"Vehicular ad hoc networks (VANETs) have recently received considerable attentions for both safety and commercial applications. In this paper, we address popular content distribution (PCD) in VANETs, in which a popular file is downloaded by a group of on-board units (OBUs) passing by a roadside unit (RSU). Due to high speeds and channel fadings, the OBUs may not finish downloading the entire file from the RSU, but only possess several content pieces. In this paper, we propose a cooperative approach using coalitional graph game to establish a peer-to-peer (P2P) network among the OBUs, in which content pieces are exchanged to complete the file downloading process. Further, we adopt cognitive radio (CR) technique for implementing vehicle-to-vehicle (V2V) transmissions. Simulation results show that the proposed algorithm enjoys a better performance in various conditions, compared to the non-cooperative approach, where OBUs randomly response to content requests from other OBUs.","PeriodicalId":154082,"journal":{"name":"2012 1st IEEE International Conference on Communications in China (ICCC)","volume":"26 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":"123963980","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}
引用次数: 12
An analytical approach for evaluating the correlation properties of subchannel fading for carrier aggregation 一种评估载波聚合子信道衰落相关特性的分析方法
2012 1st IEEE International Conference on Communications in China (ICCC) Pub Date : 2012-11-26 DOI: 10.1109/ICCChina.2012.6356867
Ruonan Zhang, Yang Zhang, Zhimeng Zhong, Stan X. Lu, Lin X. Cai
{"title":"An analytical approach for evaluating the correlation properties of subchannel fading for carrier aggregation","authors":"Ruonan Zhang, Yang Zhang, Zhimeng Zhong, Stan X. Lu, Lin X. Cai","doi":"10.1109/ICCChina.2012.6356867","DOIUrl":"https://doi.org/10.1109/ICCChina.2012.6356867","url":null,"abstract":"Carrier aggregation (CA) has been proposed as a key feature of the 4G cellular networks to achieve the very high data rates. It is known that the correlation between the subchannels, including both small- and large-scale fading, is critical in determining the performance gain we can obtain from the multicarrier transmission. However, due to the prohibitively high complexity and cost in simultaneously probing multiple non-contiguous subchannels by a channel sounder, this issue is less explored yet. In this paper, we develop an analytical model to study the correlation of the small-scale fading (SSF) between two arbitrarily separated subchannels. We first propose a new propagation model for the Nakagami-m fading of the subchannels, based on the delay spread property and exponential power decaying of the multipath components (MPCs). Then the level-cross-rate (LCR) of the subchannel received power with respect to frequency is defined and derived. Third, a Markov chain describing the variation of the received power among different subchannels is proposed, based on which the correlation coefficient between two subchannels is obtained. The developed analytical model and the acquired new insights on the subchannel correlation could provide further understanding on the spatial and frequency properties of the multicarrier channels, and help to guide the efficient designs of the CA communication systems.","PeriodicalId":154082,"journal":{"name":"2012 1st IEEE International Conference on Communications in China (ICCC)","volume":"11 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":"125145978","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
DTMB-GPS software receiver for urban and indoor positioning DTMB-GPS软件接收机，用于城市和室内定位
2012 1st IEEE International Conference on Communications in China (ICCC) Pub Date : 2012-11-26 DOI: 10.1109/ICCChina.2012.6356944
Hong Wu, Yao Chen, N. Zhang, Kun Xiang, Yingxin Zhao
{"title":"DTMB-GPS software receiver for urban and indoor positioning","authors":"Hong Wu, Yao Chen, N. Zhang, Kun Xiang, Yingxin Zhao","doi":"10.1109/ICCChina.2012.6356944","DOIUrl":"https://doi.org/10.1109/ICCChina.2012.6356944","url":null,"abstract":"This paper presents realization of positioning based on DTMB (Digital Television Terrestrial Multimedia Broadcasting) and GPS (Global Positioning System) in urban or indoor environment by means of a Software Defined Radio (SDR). DTMB signal's unique feature in super-frame is analyzed and a new correlation method without generating local PN sequence is proposed. Double delta correlator and Kalman filter are used in multipath mitigation, solution smoothing and position prediction. Real scenario tests have been performed to verify the validation of the hybrid positioning system combining DTMB and GPS, showing fast and reliable performance under GPS limited conditions.","PeriodicalId":154082,"journal":{"name":"2012 1st IEEE International Conference on Communications in China (ICCC)","volume":"12 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":"130197870","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
Capacity region of Gaussian cognitive broadcast channel in low-interference-gain regime 低干扰增益条件下高斯认知广播信道的容量区域
2012 1st IEEE International Conference on Communications in China (ICCC) Pub Date : 2012-11-26 DOI: 10.1109/ICCChina.2012.6356885
Shiyong Yang, Tao Jiang, Yang Cao
{"title":"Capacity region of Gaussian cognitive broadcast channel in low-interference-gain regime","authors":"Shiyong Yang, Tao Jiang, Yang Cao","doi":"10.1109/ICCChina.2012.6356885","DOIUrl":"https://doi.org/10.1109/ICCChina.2012.6356885","url":null,"abstract":"In this paper, we consider the Gaussian cognitive broadcast channel in which the primary user communicate to the primary receivers and the cognitive user has noncausal knowledge of the primary radio's codeword and wishes to communicate to two receivers. We characterize the largest rate region at which the cognitive user could reliably communicate under the constraints that no rate degradation is created for the primary user, and the primary receiver uses a single-user decoder just as it would be in the absence of the cognitive radio. We determine the capacity region of the Gaussian cognitive broadcast channel in the low-interference-gain regime.","PeriodicalId":154082,"journal":{"name":"2012 1st IEEE International Conference on Communications in China (ICCC)","volume":"70 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":"122289093","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
Energy-efficient multicast with deadlines in wireless networks via lazy rate scheduling 基于延迟速率调度的无线网络节能组播
2012 1st IEEE International Conference on Communications in China (ICCC) Pub Date : 2012-11-26 DOI: 10.1109/ICCChina.2012.6356914
Yanan Bao, Xiaolei Wang, Sheng Zhou, Z. Niu
{"title":"Energy-efficient multicast with deadlines in wireless networks via lazy rate scheduling","authors":"Yanan Bao, Xiaolei Wang, Sheng Zhou, Z. Niu","doi":"10.1109/ICCChina.2012.6356914","DOIUrl":"https://doi.org/10.1109/ICCChina.2012.6356914","url":null,"abstract":"In this paper, we consider the problem of providing QoS (Quality of Service) guaranteed data download services in wireless networks with high energy-efficiency. To guarantee the QoS, a transmission deadline is set for each request, before which the whole data should be received by the user. To attain high energy-efficiency, multicast technique is adopted. Traditionally, the multicast rate is constant and independent of the number of users served in one session. However, we show that when we change the transmission rate dynamically according to current state, such as user numbers, more transmission energy can be saved. We design the optimal rate scheduling algorithm for the offline case when non-causal information about user arrivals is available. We show that the optimal rate scheduling scheme can save energy by 15%. For the online scheduling problem when only causal information is available, we propose several heuristic lazy transmission schemes based on DP (Dynamic Programming) results. Simulation results show that with these heuristic schemes, up to 10% transmission energy can be saved.","PeriodicalId":154082,"journal":{"name":"2012 1st IEEE International Conference on Communications in China (ICCC)","volume":"20 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":"133653668","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学术官方微信