2014 IEEE Global Communications Conference最新文献

筛选
英文 中文
SmartCar: Smart charging and driving control for electric vehicles in the smart grid SmartCar:智能电网中电动汽车的智能充电和驾驶控制
2014 IEEE Global Communications Conference Pub Date : 2014-12-01 DOI: 10.1109/GLOCOM.2014.7037217
Lei Rao, Jianguo Yao
{"title":"SmartCar: Smart charging and driving control for electric vehicles in the smart grid","authors":"Lei Rao, Jianguo Yao","doi":"10.1109/GLOCOM.2014.7037217","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7037217","url":null,"abstract":"Electric vehicle (EV) is the next-generation vehicle powered by electricity. Keeping EVs charged and ready to go will require a tight integration and coordination of an infrastructure of equipment connected to the power grid for vehicle charging and a new IT management system for monitoring, analyzing and controlling the vehicle charging. Smart grid technologies have brought opportunities to solve challenges in the EV ecosystem. Both academia and industry have been seeking technologies and applications to optimize an EV driver's driving cost. However, it still remains an open problem of how to handle the driving demand uncertainty and the electricity price uncertainty for EV charging. To address this challenge, we model the driving cost minimization problem and formulate it as an optimization problem. While the driver demand and the electricity price are varying with time, we leverage the Model Predictive Control (MPC) based method to design a dynamic charging (controlling when to charge and how much to charge) and driving (controlling the switching between electric driven mode and gasoline driven mode during the driving process) control scheme. Performance evaluation results demonstrate the effectiveness and cost efficiency of our approach.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"84 1","pages":"2709-2714"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90830423","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
Reciprocity calibration methods for massive MIMO based on antenna coupling 基于天线耦合的大规模MIMO互易校准方法
2014 IEEE Global Communications Conference Pub Date : 2014-12-01 DOI: 10.1109/GLOCOM.2014.7037384
Joao Vieira, F. Rusek, F. Tufvesson
{"title":"Reciprocity calibration methods for massive MIMO based on antenna coupling","authors":"Joao Vieira, F. Rusek, F. Tufvesson","doi":"10.1109/GLOCOM.2014.7037384","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7037384","url":null,"abstract":"In this paper we consider time-division-duplex (TDD) reciprocity calibration of a massive MIMO system. The calibration of a massive MIMO system can be done entirely at the base station (BS) side by sounding the BS antennas one-by-one while receiving with the other BS antennas. With an M antenna BS, this generates M(M - 1) signals that can be used for calibration purposes. In this paper we study several least-squares (LS) based estimators, differing in the number of received signals that are being used. We compare the performance of the estimators, and we conclude that is possible to accurately calibrate an entire BS antenna array using the mutual coupling between antennas as the main propagation mechanism.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"74 1","pages":"3708-3712"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90842779","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}
引用次数: 79
On optimum time division multiple access for energy harvesting channels 能量收集信道的最优时分多址
2014 IEEE Global Communications Conference Pub Date : 2014-12-01 DOI: 10.1109/GLOCOM.2014.7037566
Juan Liu, H. Dai, Wei Chen
{"title":"On optimum time division multiple access for energy harvesting channels","authors":"Juan Liu, H. Dai, Wei Chen","doi":"10.1109/GLOCOM.2014.7037566","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7037566","url":null,"abstract":"In this paper, we consider a multiple access channel, where multiple users equipped with energy harvesting batteries communicate to an access point. The users are supposed to share the channel via Time Division Multiple Access (TDMA). In many existing works, it is commonly assumed that the users' energy harvesting processes and storage status are known to all the users before transmissions. In practice, such knowledge may not be readily available. To avoid excessive overhead for realtime information exchange, we consider the scenario where the users schedule their individual transmissions according to the users' statistical energy harvesting profiles. We first show that in the case when each node has an infinite-capacity battery, equal-power TDMA is optimal for throughput maximization. Using Markov chain modeling, we then study the system performance for the finite-capacity battery case under the equal-power TDMA framework. We also consider an equal-time TDMA scheme, which assigns equal-length subslots to each user. It is found that equal-power TDMA always outperforms equal-time TDMA in the infinite-capacity battery case, while equal-time TDMA exhibits compatible or even slightly better performance in some scenarios when the batteries have finite capacities.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"11 1","pages":"4801-4806"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90465791","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
A survey of two kinds of complementary coded CDMA wireless communications 两种互补编码CDMA无线通信的综述
2014 IEEE Global Communications Conference Pub Date : 2014-12-01 DOI: 10.1109/GLOCOM.2014.7036852
Siyue Sun, Shuai Han, Qiyue Yu, W. Meng, Cheng Li
{"title":"A survey of two kinds of complementary coded CDMA wireless communications","authors":"Siyue Sun, Shuai Han, Qiyue Yu, W. Meng, Cheng Li","doi":"10.1109/GLOCOM.2014.7036852","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7036852","url":null,"abstract":"In this article, we present a comprehensive survey of existing literature in the area of complementary coded CDMA (CC-CDMA) technique for wireless communications to provide an introduction and overview to the field. According to the kinds of independent sub-channels, we divide the existing CC-CDMA solutions into two categories: time division multiplex (TDM) and frequency division multiplex (FDM) CC-CDMA systems. Then we compared them in terms of resistance of multiuser interference and multi-path interference, implementation complexity and spread and spectrum efficiency.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"4 1","pages":"468-472"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87192407","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
Sum-rate maximization for spectrum-sharing cognitive multiple access channels without successive interference cancellation 无连续干扰抵消的频谱共享认知多址信道和速率最大化
2014 IEEE Global Communications Conference Pub Date : 2014-12-01 DOI: 10.1109/GLOCOM.2014.7037274
Xin Kang, Hon-Fah Chong, Yeow-Khiang Chia, Sumei Sun
{"title":"Sum-rate maximization for spectrum-sharing cognitive multiple access channels without successive interference cancellation","authors":"Xin Kang, Hon-Fah Chong, Yeow-Khiang Chia, Sumei Sun","doi":"10.1109/GLOCOM.2014.7037274","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7037274","url":null,"abstract":"In this paper, the sum-rate of a cognitive multiple access channel (C-MAC) is studied, where a secondary network (SN) with multiple secondary users (SUs) transmitting to a secondary base station (SBS) shares the spectrum band with a primary user (PU). An interference power constraint (IPC) is imposed on the SN to protect the PU. Under the IPC and the individual transmit power constraint (TPC) imposed on each SU, we investigate the power allocation strategies to maximize the sum-rate of the C-MAC without successive interference cancellation (SIC). We prove that the optimal solution must be at the extreme points of the feasible region. We show that Dynamic Time Division Multiple Access (D-TDMA) is optimal with high probability when the number of SUs is large. Furthermore, we show through simulations that the optimal power allocation to maximize the sum-rate of the C-MAC with SIC is optimal or near-optimal for our setting when D-TDMA is not optimal.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"878 1","pages":"3057-3061"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76991424","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
Impact of feedback delays on EESM-based wideband link adaptation: Modeling and analysis 反馈延迟对基于eesm的宽带链路自适应的影响:建模与分析
2014 IEEE Global Communications Conference Pub Date : 2014-12-01 DOI: 10.1109/GLOCOM.2014.7037425
Jobin Francis, N. Mehta
{"title":"Impact of feedback delays on EESM-based wideband link adaptation: Modeling and analysis","authors":"Jobin Francis, N. Mehta","doi":"10.1109/GLOCOM.2014.7037425","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7037425","url":null,"abstract":"In orthogonal frequency division multiplexing (OFDM) systems, such as long term evolution (LTE) and WiMAX, a codeword is transmitted over a group of subcarriers. Since the subcarriers see different channel gains in a frequency-selective channel, the modulation and coding scheme (MCS) of the codeword must be selected based on the vector of signal-to-noise-ratios (SNRs) of these subcarriers. Exponential effective SNR mapping (EESM) simplifies this problem by mapping the vector of SNRs into a single, equivalent flat-fading SNR. We develop a new analytical framework to characterize the throughput of EESM-based rate adaptation in such wideband channels in the presence of feedback delays, which make the choice of the MCS partially outdated by the time data transmission takes place. To this end, we first propose a novel bivariate gamma distribution to model the joint statistics of EESM at the times of estimation and data transmission. We then derive a novel expression for the throughput as a function of feedback delay. Our framework works for both correlated and independent subcarriers and for various multiple antenna diversity modes, and is accurate over a wide range of delays.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"3 1","pages":"3952-3957"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78289712","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
Cognitive radio based adaptive SON for LTE-A heterogeneous networks 基于认知无线电的LTE-A异构网络自适应SON
2014 IEEE Global Communications Conference Pub Date : 2014-12-01 DOI: 10.1109/GLOCOM.2014.7037502
Fei Qi, Songlin Sun, B. Rong, R. Hu, Y. Qian
{"title":"Cognitive radio based adaptive SON for LTE-A heterogeneous networks","authors":"Fei Qi, Songlin Sun, B. Rong, R. Hu, Y. Qian","doi":"10.1109/GLOCOM.2014.7037502","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7037502","url":null,"abstract":"This paper presents a novel scheme of adaptive self-organization network (SON) by integrating cognitive radio (CR) with inter-cell interference coordination (ICIC) for LTE-A heterogeneous networks (HetNets). Particularly, we take advantage of the spectrum sensing function from CR and the radio resource layering function from ICIC. Our work addresses the issues of smart low-power node (SLPN) development, which associates appropriate sectorization with radio resource allocation during the self-organization process. We further develop a Hungary algorithm based self-organization strategy to improve the SLPN adaptive optimization. Simulation results show that our proposed scheme can achieve considerable gain in terms of throughput and coverage, with extra rewards of high flexibility and low complexity in HetNet SON.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"1 1","pages":"4412-4417"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76313903","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}
引用次数: 10
iCoMe: A novel incentivized cooperative mobile resource management mechanism iCoMe:一种新型的激励合作移动资源管理机制
2014 IEEE Global Communications Conference Pub Date : 2014-12-01 DOI: 10.1109/GLOCOM.2014.7037597
Hamed Shah-Mansouri, V. Wong
{"title":"iCoMe: A novel incentivized cooperative mobile resource management mechanism","authors":"Hamed Shah-Mansouri, V. Wong","doi":"10.1109/GLOCOM.2014.7037597","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7037597","url":null,"abstract":"In this paper, we present a novel cooperative resource management mechanism in mobile cloud computing environment. This mechanism is based on cooperation between mobile devices using their short range radio technology such as WiFi with the goal of maximizing the revenue of the cellular service provider. Users with poor cellular link quality connect with nearby devices through their WiFi interface. The service provider provides incentives to mobile devices to motivate them to contribute in such cooperative scheme. We first formulate the resource management problem as a mixed integer linear programming model. The optimal solution has an NP-hard complexity. To tackle the complexity of the problem, we then propose iCoMe, which is an Incentivized Cooperative MobilE resource management mechanism. The resource management problem in iCoMe is solved distributively by the service provider and mobile devices. We prove that iCoMe has a polynomial time computational complexity. Simulation results confirm the close to optimal performance of iCoMe. Results also show that our proposed mechanism considerably increases the revenue of the service provider compared to non-cooperative schemes.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"11 1","pages":"4996-5001"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75741792","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
Service time prediction based dynamic resource allocation for device-to-device communication underlaying cellular networks 基于服务时间预测的蜂窝网络设备间通信动态资源分配
2014 IEEE Global Communications Conference Pub Date : 2014-12-01 DOI: 10.1109/GLOCOM.2014.7037586
Jun Zheng, Renpeng Chen, Yuan Zhang
{"title":"Service time prediction based dynamic resource allocation for device-to-device communication underlaying cellular networks","authors":"Jun Zheng, Renpeng Chen, Yuan Zhang","doi":"10.1109/GLOCOM.2014.7037586","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7037586","url":null,"abstract":"Resource allocation is a critical issue in device-to-device (D2D) communication underlying cellular networks. Existing work only considers static resource allocation, which cannot well address the dynamic resource allocation problem in a real cellular network. This paper studies dynamic resource allocation for D2D communication and proposes a service time prediction based dynamic resource allocation mechanism for a cellular network system. The proposed allocation mechanism considers different service types, and introduces the concept of \"utility\" as a metric to reflect the performance of a user or the system, and takes into account service time prediction in spectral resource allocation. Specifically, it enables the base station to predict the service time of a new user and the remaining service time of existing users in the system, and take into account the predicted service time and remaining service time in calculating the utility gain caused by a new user. Based on the estimated utility gain, the base station will select the physical resource block (PRB) with the largest utility gain every time it allocates a PRB to the new user. Simulation results show that the proposed dynamic allocation mechanism can significantly improve the system performance in terms of the system utility and the number of users successfully admitted to the system.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"7 1","pages":"4928-4934"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74731228","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}
引用次数: 10
RSU deployment scheme with power control for highway message propagation in VANETs 基于功率控制的高速公路信息传播RSU部署方案
2014 IEEE Global Communications Conference Pub Date : 2014-12-01 DOI: 10.1109/GLOCOM.2014.7036802
Jun Tao, Li-Min Zhu, Xiaoxiao Wang, Jian He, Y. Liu
{"title":"RSU deployment scheme with power control for highway message propagation in VANETs","authors":"Jun Tao, Li-Min Zhu, Xiaoxiao Wang, Jian He, Y. Liu","doi":"10.1109/GLOCOM.2014.7036802","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7036802","url":null,"abstract":"Nowadays, message propagation has been one of the major tasks of Vehicular Ad-Hoc Networks (VANETs). The main obstacle of message propagation, which relies on the data forwarding among vehicles, is the frequent change in network topology, as the intermittent link between the vehicles will degrade the performance of message propagation. Hence, RSUs are deployed to extend vehicle coverage and improve network performance in VANETs. However, non-optimal RSU deployment may result in greater power consumption and lower quality of network performance. In this paper, we study the vehicle mobility characteristics along the highway and propose a Cluster-based RSU Deployment (CRD) scheme with the Traffic-Aware Power Control (TAPC) method to maximize the network performance, as well as minimizing the energy consumption of RSUs. Moreover, we develop a data propagation algorithm, Data-Driven Message Propagation (DDMP), to improve the performance of message propagation in RSU-assisted VANETs. The performance of the proposed scheme is analytically evaluated by comparing performance in with and without our scheme scenarios. Through extensive simulations, with the aid of our scheme, the performance of message propagation is improved significantly, in terms of the propagation latency and the power consumption.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"7 1","pages":"169-174"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74749908","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}
引用次数: 23
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学术官方微信