Pub Date : 2017-05-21DOI: 10.1109/ICC.2017.7996998
Aditya V. Padaki, R. Tandon, Jeffrey H. Reed
Adjacent channel interference caused by intermodulation distortion adversely affects the network operations in next generation heterogeneous and dynamic spectrum access networks. Multitudes of radio access technologies make the receivers susceptible to harmful interference due to nonlinear RF front ends. In this paper we analyze the intermodulation distortion arising from pairwise interactions of adjacent channel signals from a spectrum centric point of view and develop frameworks to ascertain the adjacent channel signals causing interference at a given desired channel. We further propose achievable schemes for interference avoidance and assess the scalability of the next generation Nonlinear Adjacent Channel Interference Networks. We further propose schemes for complete interference protection of incumbents with sensitive receiver requirements from secondary operations in adjacent channels in the spatio-temporal vicinity. This paper presents valuable insights on scalability and schemes for nonlinear adjacent channel interference avoidance in next generation shared spectrum networks.
{"title":"On scalability and interference avoidance in nonlinear adjacent channel interference networks","authors":"Aditya V. Padaki, R. Tandon, Jeffrey H. Reed","doi":"10.1109/ICC.2017.7996998","DOIUrl":"https://doi.org/10.1109/ICC.2017.7996998","url":null,"abstract":"Adjacent channel interference caused by intermodulation distortion adversely affects the network operations in next generation heterogeneous and dynamic spectrum access networks. Multitudes of radio access technologies make the receivers susceptible to harmful interference due to nonlinear RF front ends. In this paper we analyze the intermodulation distortion arising from pairwise interactions of adjacent channel signals from a spectrum centric point of view and develop frameworks to ascertain the adjacent channel signals causing interference at a given desired channel. We further propose achievable schemes for interference avoidance and assess the scalability of the next generation Nonlinear Adjacent Channel Interference Networks. We further propose schemes for complete interference protection of incumbents with sensitive receiver requirements from secondary operations in adjacent channels in the spatio-temporal vicinity. This paper presents valuable insights on scalability and schemes for nonlinear adjacent channel interference avoidance in next generation shared spectrum networks.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"77 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":"73148286","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}
Pub Date : 2017-05-21DOI: 10.1109/ICC.2017.7996384
D. Magrin, Marco Centenaro, L. Vangelista
Low-Power Wide Area Networks (LPWANs) are continuously gaining momentum as fundamental enablers of the Internet of Things (IoT) paradigm. These networks provide longrange coverage to end nodes, exploiting license-free frequency bands. The focus of this work is on one of the most prominent LPWAN technologies: LoRa™. We implemented a new ns-3 module to study the performance of a LoRa-based IoT network in a typical urban scenario. Simulation results show that a LoRa network can scale well, achieving packet success rates above 95% in presence of a number of end devices in the order of 104.
{"title":"Performance evaluation of LoRa networks in a smart city scenario","authors":"D. Magrin, Marco Centenaro, L. Vangelista","doi":"10.1109/ICC.2017.7996384","DOIUrl":"https://doi.org/10.1109/ICC.2017.7996384","url":null,"abstract":"Low-Power Wide Area Networks (LPWANs) are continuously gaining momentum as fundamental enablers of the Internet of Things (IoT) paradigm. These networks provide longrange coverage to end nodes, exploiting license-free frequency bands. The focus of this work is on one of the most prominent LPWAN technologies: LoRa™. We implemented a new ns-3 module to study the performance of a LoRa-based IoT network in a typical urban scenario. Simulation results show that a LoRa network can scale well, achieving packet success rates above 95% in presence of a number of end devices in the order of 104.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"9 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":"74743110","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}
Pub Date : 2017-05-21DOI: 10.1109/ICC.2017.7996334
Zijie Zheng, Lingyang Song, Zhu Han
In this paper, we propose a general pricing framework, helping the controller promote agents to achieve its objective, for a big data network with one controller and a large number of agents. The convergence of the framework is guaranteed for a general class of objective functions: a separable convex function for the controller and a convex function for each agent. Specially, the proposed framework can converge linearly, when the controller's objective is strongly convex, and the agents' objectives have a uniform Lipschitz gradient. The convergence, and especially the linear convergence is not dependent on the number of agents, which is important for a network with large size. Through numerical results, we apply our pricing framework in a wireless virtualized network to verify its fast convergence, where the pricing framework converges after just a few steps.
{"title":"Bridging the gap between big data and game theory: A general hierarchical pricing framework","authors":"Zijie Zheng, Lingyang Song, Zhu Han","doi":"10.1109/ICC.2017.7996334","DOIUrl":"https://doi.org/10.1109/ICC.2017.7996334","url":null,"abstract":"In this paper, we propose a general pricing framework, helping the controller promote agents to achieve its objective, for a big data network with one controller and a large number of agents. The convergence of the framework is guaranteed for a general class of objective functions: a separable convex function for the controller and a convex function for each agent. Specially, the proposed framework can converge linearly, when the controller's objective is strongly convex, and the agents' objectives have a uniform Lipschitz gradient. The convergence, and especially the linear convergence is not dependent on the number of agents, which is important for a network with large size. Through numerical results, we apply our pricing framework in a wireless virtualized network to verify its fast convergence, where the pricing framework converges after just a few steps.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"429 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":"77239369","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}
Pub Date : 2017-05-21DOI: 10.1109/ICC.2017.7996905
B. Hsu, Po-Chun Chou, Chia-han Lee, Ping-Cheng Yeh
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.
{"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}
Pub Date : 2017-05-21DOI: 10.1109/ICC.2017.7996518
J. Yoo, Jisu Bae, Sun Hong Lim, Sunwoo Kim, J. Choi, B. Shim
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.
{"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}
Pub Date : 2017-05-21DOI: 10.1109/ICC.2017.7996550
Mikael Capelle, Marie-José Huguet, Nicolas Jozefowiez, X. Olive
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.
{"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}
Pub Date : 2017-05-21DOI: 10.1109/ICC.2017.7996346
Jaber Kakar, S. Gherekhloo, Z. Awan, A. Sezgin
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.
{"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}
Pub Date : 2017-05-21DOI: 10.1109/ICC.2017.7997105
Guowen Xu, Yanzhi Ren, Hongwei Li, Dongxiao Liu, Yuan-Shun Dai, Kan Yang
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.
{"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}
Pub Date : 2017-05-21DOI: 10.1109/ICC.2017.7996514
Zichuan Xu, W. Liang, A. Galis, Yu Ma
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.
{"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}
Pub Date : 2017-05-21DOI: 10.1109/ICC.2017.7997149
Guanhua Qiao, S. Leng, M. Zeng, Yan Zhang
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.
{"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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：