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

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

筛选
英文 中文
Matching game approach for charging scheduling in vehicle-to-grid networks 车网充电调度的匹配博弈方法
2017 IEEE International Conference on Communications (ICC) Pub Date : 2017-05-21 DOI: 10.1109/ICC.2017.7997149
Guanhua Qiao, S. Leng, M. Zeng, Yan Zhang
{"title":"Matching game approach for charging scheduling in vehicle-to-grid networks","authors":"Guanhua Qiao, S. Leng, M. Zeng, Yan Zhang","doi":"10.1109/ICC.2017.7997149","DOIUrl":"https://doi.org/10.1109/ICC.2017.7997149","url":null,"abstract":"This paper study a new paradigm of heterogeneous charging stations (CSs) for the excellent charging services of Electric Vehicles (EVs) in a dense urban environment. When a large number of EVs are driving on the roads, their travel demands and charging activities have significant impact on the charging management of multiple CSs including large-CSs (LCSs) and small-CSs (SCSs). The problem of charging scheduling can be formulated as a two-side Hospital/Residents (HR) matching game. In this matching game, we not only consider the economic interest of multiple CSs and charging experience of EVs but also utilize the natural advantages of SCSs to balance the traffic on the roads around LCSs. Furthermore, a two-stage scheme that is composed of distributed HR admission scheme and centralized HR reassignment scheme is proposed to reduce the computational complexity of the matching process. Simulation results indicate that the proposed algorithms can effectively offer the scheduling management among multiple CSs while providing good satisfaction to EV drivers.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"73 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87330534","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
A hierarchical approach for the selection of optical ground stations maximizing the data transfer from low-earth observation satellites 利用近地观测卫星数据传输最大化的光学地面站分层选择方法
2017 IEEE International Conference on Communications (ICC) Pub Date : 2017-05-21 DOI: 10.1109/ICC.2017.7996550
Mikael Capelle, Marie-José Huguet, Nicolas Jozefowiez, X. Olive
{"title":"A hierarchical approach for the selection of optical ground stations maximizing the data transfer from low-earth observation satellites","authors":"Mikael Capelle, Marie-José Huguet, Nicolas Jozefowiez, X. Olive","doi":"10.1109/ICC.2017.7996550","DOIUrl":"https://doi.org/10.1109/ICC.2017.7996550","url":null,"abstract":"For space industries, free-space optical communications are becoming a mature technology, but the impact of their use to download observations from spatial imagery systems has still to be evaluated. Unlike current radio-frequency technology, freespace optical communications are strongly impacted by weather conditions, and most notably by clouds. In order to cope with the later, it is necessary to achieve ground station diversity, i.e. having a network of optical ground stations able to receive data from satellites. In this paper, we aim to find a subset of a given number of ground stations maximizing the amount of data that can be downloaded from a low-earth orbiting satellite to the Earth during its missions. We present a Mixed Integer Linear Program model and a hierarchical method based on an exhaustive enumeration of the sets of stations and on a dynamic programming algorithm to solve it. The efficiency of this method is evaluated on several instances based on real ground station networks and on cloud cover throughout the last twenty years.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"43 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86704442","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
Fundamental limits on latency in cloud- and cache-aided HetNets 在云和缓存辅助的HetNets中延迟的基本限制
2017 IEEE International Conference on Communications (ICC) Pub Date : 2017-05-21 DOI: 10.1109/ICC.2017.7996346
Jaber Kakar, S. Gherekhloo, Z. Awan, A. Sezgin
{"title":"Fundamental limits on latency in cloud- and cache-aided HetNets","authors":"Jaber Kakar, S. Gherekhloo, Z. Awan, A. Sezgin","doi":"10.1109/ICC.2017.7996346","DOIUrl":"https://doi.org/10.1109/ICC.2017.7996346","url":null,"abstract":"Hybrid architectures are generally composed of a cyber cloud with additional support of edge caching. By utilizing the benefits associated with cloud computing and caching, powerful enhanced interference management techniques can be readily utilized — that among others — also results in low-latency transmission. In this paper, we study the impact of cloud and edge processing on the latency for a heterogenous network (HetNet) consisting of two users and two transmitters. We define an information-theoretic metric, the delivery time per bit (DTB), that captures the delivery latency. We establish bounds on the DTB as a function of cache size, backhaul capacity and wireless channel parameters. We show the optimality on the DTB for various channel regimes.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"416 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86841750","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}
引用次数: 20
Training-based synchronization for quantity-based modulation in inverse Gaussian channels 反高斯信道中基于数量调制的基于训练的同步
2017 IEEE International Conference on Communications (ICC) Pub Date : 2017-05-21 DOI: 10.1109/ICC.2017.7996905
B. Hsu, Po-Chun Chou, Chia-han Lee, Ping-Cheng Yeh
{"title":"Training-based synchronization for quantity-based modulation in inverse Gaussian channels","authors":"B. Hsu, Po-Chun Chou, Chia-han Lee, Ping-Cheng Yeh","doi":"10.1109/ICC.2017.7996905","DOIUrl":"https://doi.org/10.1109/ICC.2017.7996905","url":null,"abstract":"In time-slotted molecular communication systems, clock synchronization between transmitter and receiver is crucial. In this paper, training-based synchronization schemes in a molecular communication system with quantity-based modulation are proposed by utilizing the information of arrival times of molecules. For timing offset estimation, three estimators are proposed, including maximum likelihood estimation (MLE), unbiased linear estimation (ULE), and iterative ULE. For clock skew estimation, two algorithms, arithmetic mean estimation and weighted mean estimation, are proposed. Simulation results demonstrate that the proposed estimators are effective.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"1 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82979917","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
Bandit strategies for blindly attacking networks 盲目攻击网络的强盗策略
2017 IEEE International Conference on Communications (ICC) Pub Date : 2017-05-21 DOI: 10.1109/ICC.2017.7996834
Saidhiraj Amuru, R. Buehrer, M. Schaar
{"title":"Bandit strategies for blindly attacking networks","authors":"Saidhiraj Amuru, R. Buehrer, M. Schaar","doi":"10.1109/ICC.2017.7996834","DOIUrl":"https://doi.org/10.1109/ICC.2017.7996834","url":null,"abstract":"Can we optimally attack networks (in terms of disrupting the ability of the nodes in the network from communicating) when the network topology is unknown? In this paper, we show that it is not always possible to do so when the network topology is unknown a priori. Specifically, we develop multi armed bandit-based techniques that enable the attacker to learn the best network attack strategies and also discuss the potential limitations that the attacker faces in such blind scenarios.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"37 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80733339","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
Sampling-based tracking of time-varying channels for millimeter wave-band communications 基于采样的毫米波波段时变信道跟踪
2017 IEEE International Conference on Communications (ICC) Pub Date : 2017-05-21 DOI: 10.1109/ICC.2017.7996518
J. Yoo, Jisu Bae, Sun Hong Lim, Sunwoo Kim, J. Choi, B. Shim
{"title":"Sampling-based tracking of time-varying channels for millimeter wave-band communications","authors":"J. Yoo, Jisu Bae, Sun Hong Lim, Sunwoo Kim, J. Choi, B. Shim","doi":"10.1109/ICC.2017.7996518","DOIUrl":"https://doi.org/10.1109/ICC.2017.7996518","url":null,"abstract":"In this paper, we propose a new recursive sparse channel recovery algorithm which can track time-varying support of angular domain channel response vector in mobility scenario for millimeter wave-band communications. We model the angle of departure (AoD) and the angle of arrival (AoA) using discrete state Markov random process and derive joint estimation of the time-varying support and amplitude of the angular domain channel vector. Using sequential Monte Carlo (SMC) method, the proposed channel estimation scheme tracks the support by drawing the samples from a posteriori distribution of the support indices while capturing the dynamics of time-varying amplitude using Kalman filter. Our simulation results show that the proposed algorithm yields significantly better tracking performance than the existing compressed sensing schemes.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"28 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89965261","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
Transmit antenna selection schemes for MISO-NOMA cooperative downlink transmissions with hybrid SWIPT protocol 基于混合SWIPT协议的MISO-NOMA协同下行传输的发射天线选择方案
2017 IEEE International Conference on Communications (ICC) Pub Date : 2017-05-21 DOI: 10.1109/ICC.2017.7997005
Tri Nhu Do, D. B. D. Costa, T. Duong, Beongku An
{"title":"Transmit antenna selection schemes for MISO-NOMA cooperative downlink transmissions with hybrid SWIPT protocol","authors":"Tri Nhu Do, D. B. D. Costa, T. Duong, Beongku An","doi":"10.1109/ICC.2017.7997005","DOIUrl":"https://doi.org/10.1109/ICC.2017.7997005","url":null,"abstract":"In this paper, we investigate outage performance and diversity gain of transmit antenna selection (TAS) schemes in two-user multiple-input single-output non-orthogonal multiple access (MISO-NOMA) cooperative downlink transmissions. To this end, two TAS criteria, namely Criterion I and Criterion II, are proposed, which select an antenna that experiences the best fading condition of the channel from the source to the far user and to the near user, respectively. Additionally, considering the near user as a relay to help improve the reliability of the far user, hybrid simultaneous wireless information and power transfer (SWIPT) architecture is adopted to power the near user's relaying operation. Tight closed-form approximate expressions for the outage probability (OP) of both users are derived. Numerical results reveal that Criterion I and II achieve, respectively, the diversity order of K + 1 and 2 at the far user, and 1 and K at the near user, where K denotes the number of transmit antennas at the base station.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"2 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91488314","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}
引用次数: 25
CryptMDB: A practical encrypted MongoDB over big data CryptMDB:一个实用的大数据加密MongoDB
2017 IEEE International Conference on Communications (ICC) Pub Date : 2017-05-21 DOI: 10.1109/ICC.2017.7997105
Guowen Xu, Yanzhi Ren, Hongwei Li, Dongxiao Liu, Yuan-Shun Dai, Kan Yang
{"title":"CryptMDB: A practical encrypted MongoDB over big data","authors":"Guowen Xu, Yanzhi Ren, Hongwei Li, Dongxiao Liu, Yuan-Shun Dai, Kan Yang","doi":"10.1109/ICC.2017.7997105","DOIUrl":"https://doi.org/10.1109/ICC.2017.7997105","url":null,"abstract":"In big data era, data are usually stored in databases for easy access and utilization, which are now woven into every aspect of our lives. However, traditional relational databases cannot address users' demands for quick data access and calculating, since they cannot process data in a distributed way. To tackle this problem, non-relational databases such as MongoDB have emerged up and been applied in various Scenarios. Nevertheless, it should be noted that most MongoDB products fail to consider user's data privacy. In this paper, we propose a practical encrypted MongoDB (i.e., CryptMDB). Specifically, we utilize an additive homomorphic asymmetric cryptosystem to encrypt user's data and achieve strong privacy protection. Security analysis indicates that the CryptMDB can achieve confidentiality of user's data and prevent adversaries from illegally gaining access to the database. Furthermore, extensive experiments demonstrate that the CryptMDB achieves better efficiency than existing relational database in terms of data access and calculating.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"1 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82335416","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
QUIC: Better for what and for whom? QUIC:对什么更好，对谁更好?
2017 IEEE International Conference on Communications (ICC) Pub Date : 2017-05-21 DOI: 10.1109/ICC.2017.7997281
Sarah Cook, B. Mathieu, Patrick Truong, I. Hamchaoui
{"title":"QUIC: Better for what and for whom?","authors":"Sarah Cook, B. Mathieu, Patrick Truong, I. Hamchaoui","doi":"10.1109/ICC.2017.7997281","DOIUrl":"https://doi.org/10.1109/ICC.2017.7997281","url":null,"abstract":"Many applications nowadays use HTTP. HTTP/2, standardised in February 2015, is an improvment of HTTP/1.1. However it is still running on top of TCP/TLS and can thus suffer from performance issues, such as the number of RTTs for the handshake phase and the Head of Line blocking. Google proposed the QUIC (Quick UDP Internet Connection) protocol, an user level protocol, running on top of UDP, to solve those issues. Google argues that the response time (Page Load Time) is shorter and thus the end-user experience better. First papers evaluated the intrinsic performances of QUIC, but none compared QUIC with the network, the website structure and the involved actors in mind. In this paper, we present the results of our evaluation, performed on a local testbed as well as on Internet, and our analysis to identify in which conditions QUIC is of interest, which actors can benefit from having QUIC deployed in the network and what impacts QUIC can lead to.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"36 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78227988","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}
引用次数: 66
Throughput maximization and resource optimization in NFV-enabled networks nfv网络中的吞吐量最大化和资源优化
2017 IEEE International Conference on Communications (ICC) Pub Date : 2017-05-21 DOI: 10.1109/ICC.2017.7996514
Zichuan Xu, W. Liang, A. Galis, Yu Ma
{"title":"Throughput maximization and resource optimization in NFV-enabled networks","authors":"Zichuan Xu, W. Liang, A. Galis, Yu Ma","doi":"10.1109/ICC.2017.7996514","DOIUrl":"https://doi.org/10.1109/ICC.2017.7996514","url":null,"abstract":"Network function virtualization (NFV) has been emerging as a new paradigm to enable elastic and inexpensive network services in modern computer networks, through deploying flexible virtualized network functions (VNFs) running in virtual computing platforms. Different VNFs can be chained together to form different service chains, to meet various user data routing demands for different network services. In this paper we consider provisioning network services in an NFV-enabled network that consists of data centers for implementing VNF instances of service chains and switches. We study the throughput maximization problem with the aim to admit as many user requests as possible while minimizing the implementation cost of the requests, assuming that limited numbers of instances of each service chain have been stored in data centers. We first propose an optimal algorithm for the problem if all requests have identical packet rates; otherwise, we devise two approximation algorithms with probable approximation ratios, depending on whether the packet traffic of each request is splittable. We finally conduct experiments to evaluate the performance of the proposed algorithms by simulations. Experimental results show that the proposed algorithms achieve at least 15% more throughput than that of a greedy algorithm.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"24 1","pages":"1-7"},"PeriodicalIF":0.0,"publicationDate":"2017-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78450615","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}
引用次数: 28
首页 上一页 下一页 尾页
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学术官方微信