{"title":"Three-Tier Hierarchical Model of Dynamic Spectrum Sharing Based on Hybrid Authorization Using Geolocation Database and Cognitive Radio","authors":"Huijuan Jiang, Tianyu Wang, Shaowei Wang","doi":"10.1109/ICC.2018.8422854","DOIUrl":"https://doi.org/10.1109/ICC.2018.8422854","url":null,"abstract":"Dynamic spectrum sharing~(DSS) has been envisioned as a promising approach to address the imminent shortage of spectrum resources caused by the exploding growth of wireless traffic. Contrast to the existing DSS approaches which are either based on individual authorization using a geolocation database, such as Licensed Shared Access and Spectrum Access System, or general authorization using spectrum sensing techniques, such as Collective Use of Spectrum, in this paper, we propose a three-tier hierarchical model of DSS based on hybrid authorization, in which primary licensees~(PLs) and secondary licensees~(SLs) register with a geolocation database to guarantee predictable quality-of-service, and tertiary licensees~(TLs) opportunistically access the small spectrum holes in time and space to further improve the spectrum usage. We provide a mathematical analysis of the optimal access strategy for each type of licensees in the proposed hierarchical model, such that the weighted sum throughput of SLs and TLs is maximized while the PL throughput is guaranteed. Simulation results show that the proposed hierarchical approach can highly increase the system performance, compared to the current database-driven approaches.","PeriodicalId":387855,"journal":{"name":"2018 IEEE International Conference on Communications (ICC)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133861276","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}
L. Bedogni, L. Bononi, R. Canegallo, Fabio Carbone, M. D. Felice, E. Franchi, Federico Montori, Luca Perilli, T. S. Cinotti, A. Trotta
{"title":"Dual-Mode Wake-Up Nodes for IoT Monitoring Applications: Measurements and Algorithms","authors":"L. Bedogni, L. Bononi, R. Canegallo, Fabio Carbone, M. D. Felice, E. Franchi, Federico Montori, Luca Perilli, T. S. Cinotti, A. Trotta","doi":"10.1109/ICC.2018.8422173","DOIUrl":"https://doi.org/10.1109/ICC.2018.8422173","url":null,"abstract":"Internet of Things (IoTs)-based monitoring applications usually involve large-scale deployments of battery-enabled sensor nodes providing measurements at regular intervals. In order to guarantee the service continuity over time, the energy-efficiency of the networked system should be maximized. In this paper, we address such issue via a combination of novel hardware/software solutions including new classes of Wake-up radio IoT Nodes (WuNs) and novel data- and hardware-driven network management algorithms. Three main contributions are provided. First, we present the design and prototype implementation of WuN nodes able to support two different energy-saving modes; such modes can be configured via software, and hence dynamically tuned. Second, we show by experimental measurements that the optimal policy strictly depends on the application requirements. Third, we move from the node design to the network design, and we devise proper orchestration algorithms which select both the optimal set of WuN to wake-up and the proper energy-saving mode for each WuN, so that the application lifetime is maximized, while the redundancy of correlated measurements is minimized. The proposed solutions are extensively evaluated via OMNeT++ simulations under different IoT scenarios and requirements of the monitoring applications.","PeriodicalId":387855,"journal":{"name":"2018 IEEE International Conference on Communications (ICC)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134300964","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}
Pengfei Wang, Boya Di, Hongliang Zhang, Xiaolin Hou, Lingyang Song
{"title":"Cellular V2X Communications in Unlicensed Spectrum for 5G Networks","authors":"Pengfei Wang, Boya Di, Hongliang Zhang, Xiaolin Hou, Lingyang Song","doi":"10.1109/ICC.2018.8422690","DOIUrl":"https://doi.org/10.1109/ICC.2018.8422690","url":null,"abstract":"With the increasing demand for vehicular data transmission, limited dedicated cellular spectrum becomes a bottleneck to satisfy the requirements of cellular vehicle-to-everything (V2X) users. To address this issue, we study the coexistence problem between cellular V2X users and vehicular ad-hoc network (VANET) users over the unlicensed spectrum. To facilitate the coexistence, we design an energy sensing based spectrum sharing scheme, where cellular V2X users are able to access the unlicensed channels fairly, thereby reducing the collisions of data transmission. In order to maximize the number of active cellular V2X users, we formulate the scheduling and resource allocation problem as a two-sided many-to-many matching with peer effects. A dynamic vehicle-resource matching algorithm (DV-RMA) is then proposed to solve this problem. Simulation results show that the proposed scheme outperforms the existing approaches in supporting the massive connectivity.","PeriodicalId":387855,"journal":{"name":"2018 IEEE International Conference on Communications (ICC)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131627750","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}
Dimitrios Zorbas, Georgios Z. Papadopoulos, C. Douligeris
{"title":"Local or Global Radio Channel Blacklisting for IEEE 802.15.4-TSCH Networks?","authors":"Dimitrios Zorbas, Georgios Z. Papadopoulos, C. Douligeris","doi":"10.1109/ICC.2018.8423007","DOIUrl":"https://doi.org/10.1109/ICC.2018.8423007","url":null,"abstract":"The IEEE 802.15.4 Time Slotted Channel Hopping (TSCH) networks suffer considerably from the high interference caused by the presence of nearby external devices, such as from the presence of IEEE 802.11b/g/n Access Points. Frequency hopping and blacklisting of radio channels that temporarily or consistently present bad performance are the two main approaches to cope with interference and increase the chances of successful packet delivery. However, the blacklisting of a number of channels and the scheduling of transmissions so that two or more neighboring links do not use the same frequency at the same time is a challenging problem, since in ieee TSCH many parallel transmissions may occur. Blacklisting algorithms may be applied either locally or globally in IEEE 802.15.4 networks. In this paper, we first present the weaknesses of a localized blacklisting solution presented in the literature for multi-hop networks, and we propose a new distributed solution to overcome these issues. Both analytical and simulation evaluation under heavy interference show the superiority of the proposed scheme. In particular, the packet delivery ratio is improved while achieving minimum delay.","PeriodicalId":387855,"journal":{"name":"2018 IEEE International Conference on Communications (ICC)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132967217","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}
M. Wakaiki, Katsuya Suto, K. Koiwa, Kang‐Zhi Liu, T. Zanma
{"title":"Model Predictive Cell Zooming for Energy-Harvesting Small Cell Networks","authors":"M. Wakaiki, Katsuya Suto, K. Koiwa, Kang‐Zhi Liu, T. Zanma","doi":"10.1109/ICC.2018.8422093","DOIUrl":"https://doi.org/10.1109/ICC.2018.8422093","url":null,"abstract":"This paper addresses the real-time control of transmission power for small cell base stations (SBSs) exploiting energy- harvesting sources. We employ model predictive control and optimize an objective function that contains the number of users with a given quality of experience and the average state of charge. We first determine the number of active SBSs in the viewpoint of energy efficiency and then approximate the objective function. Finally, we illustrate the proposed method through a numerical example, comparing it with a static method based on statistical information.","PeriodicalId":387855,"journal":{"name":"2018 IEEE International Conference on Communications (ICC)","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130755331","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}
Xianfu Chen, Pei Liu, Hang Liu, Celimuge Wu, Yusheng Ji
{"title":"Multipath Transmission Scheduling in Millimeter Wave Cloud Radio Access Networks","authors":"Xianfu Chen, Pei Liu, Hang Liu, Celimuge Wu, Yusheng Ji","doi":"10.1109/ICC.2018.8422564","DOIUrl":"https://doi.org/10.1109/ICC.2018.8422564","url":null,"abstract":"Millimeter wave (mmWave) communications provide great potential for next-generation cellular networks to meet the demands of fast-growing mobile data traffic with plentiful spectrum available. However, in a mmWave cellular system, the shadowing and blockage effects lead to the intermittent connectivity, and the handovers are more frequent. This paper investigates an \"all- mmWave\" cloud radio access network (cloud-RAN), in which both the fronthaul and the radio access links operate at mmWave. To address the intermittent transmissions, we allow the mobile users (MUs) to establish multiple connections to the central unit over the remote radio heads (RRHs). Specifically, we propose a multipath transmission framework by leveraging the \"all- mmWave\" cloud-RAN architecture, which makes decisions of the RRH association and the packet transmission scheduling according to the time- varying network statistics, such that a MU experiences the minimum queueing delay and packet drops. The joint RRH association and transmission scheduling problem is formulated as a Markov decision process (MDP). Due to the problem size, a low-complexity online learning scheme is put forward, which requires no a priori statistic information of network dynamics. Simulations show that our proposed scheme outperforms the state-of- art baselines, in terms of average queue length and average packet dropping rate.","PeriodicalId":387855,"journal":{"name":"2018 IEEE International Conference on Communications (ICC)","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131053350","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}
Qingqing Cheng, Diep N. Nguyen, E. Dutkiewicz, M. Mueck
{"title":"Protecting Operational Information of Incumbent and Secondary Users in FCC Spectrum Access System","authors":"Qingqing Cheng, Diep N. Nguyen, E. Dutkiewicz, M. Mueck","doi":"10.1109/ICC.2018.8422847","DOIUrl":"https://doi.org/10.1109/ICC.2018.8422847","url":null,"abstract":"Both Federal Communications Commission (FCC) and European Telecommunications Standards Institute (ETSI) support dynamic spectrum access (DSA) as an enabling technology for spectrum sharing. To effectively realize DSA in practice, users (from both defense and civil sectors) are required to share their (radio) operational information. That risks exposing their security, privacy, and business plan to unintended agents. In this paper, taking FCC's spectrum access system (SAS) as a study case, we propose a privacy-preserving scheme for DSA by leveraging encryption and obfuscation methods (PSEO). To implement PSEO, we propose an interference calculation scheme that allows users to calculate interference budget without revealing their operation information (e.g., antenna height, transmit power, location...), referred to as blind interference calculation method (BICM). BICM also reduces the computing overhead of PSEO, compared with FCC's SAS by moving interference budgeting tasks to local users and calculating it in an offline manner. Extensive detailed analysis and simulations show that our proposed PSEO is able to better protect all users' operational privacy, guaranteeing efficient spectrum utilization with less online overhead, compared with state of the art approaches.","PeriodicalId":387855,"journal":{"name":"2018 IEEE International Conference on Communications (ICC)","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132874894","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}
Jian Zhao, Kam Kong, X. Hei, Yazhou Tu, Xiaojiang Du
{"title":"A Visible Light Channel Based Access Control Scheme for Wireless Insulin Pump Systems","authors":"Jian Zhao, Kam Kong, X. Hei, Yazhou Tu, Xiaojiang Du","doi":"10.1109/ICC.2018.8422827","DOIUrl":"https://doi.org/10.1109/ICC.2018.8422827","url":null,"abstract":"Smart personal insulin pumps have been widely adopted by type 1 diabetes. However, many wireless insulin pump systems lack security mechanisms to protect them from malicious attacks. In previous works, the read-write attacks over RF channels can be launched stealthily and could jeopardize patients' lives. Protecting patients from such attacks is urgent. To address this issue, we propose a novel visible light channel based access control scheme for wireless infusion insulin pumps. This scheme employs an infrared photodiode sensor as a receiver in an insulin pump, and an infrared LED as an emitter in a doctor's reader (USB) to transmit a PIN/shared key to authenticate the doctor's USB. The evaluation results demonstrate that our scheme can reliably pass the authentication process with a low false accept rate (0.05% at a distance of 5cm).","PeriodicalId":387855,"journal":{"name":"2018 IEEE International Conference on Communications (ICC)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133505180","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}
{"title":"Reliable and Privacy-Preserving Selective Data Aggregation for Fog-Based IoT","authors":"Cheng Huang, Dongxiao Liu, Jianbing Ni, Rongxing Lu, Xuemin Shen","doi":"10.1109/ICC.2018.8422445","DOIUrl":"https://doi.org/10.1109/ICC.2018.8422445","url":null,"abstract":"Internet of Things (IoT) is reshaping our daily lives by bridging the gaps between physical and digital world. To enable ubiquitous sensing, seamless connection and real-time processing for IoT applications, fog computing is considered as a key component in a heterogeneous IoT architecture, which deploys storage and computing resources to network edges. However, the fog-based IoT architecture can lead to various security and privacy risks, such as compromised fog nodes that may impede developments of IoT by attacking the data collection and gathering period. In this paper, we propose a novel privacy-preserving and reliable scheme for the fog-based IoT to address the data privacy and reliability challenges of the selective data aggregation service. Specifically, homomorphic proxy re-encryption and proxy re-authenticator techniques are respectively utilized to deal with the data privacy and reliability issues of the service, which supports data aggregation over selective data types for any type-driven applications. We define a new threat model to formalize the non-collusive and collusive attacks of compromised fog nodes, and it is demonstrated that the proposed scheme can prevent both non-collusive and collusive attacks in our model. In addition, performance evaluations show the efficiency of the scheme in terms of computational costs and communication overheads.","PeriodicalId":387855,"journal":{"name":"2018 IEEE International Conference on Communications (ICC)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133719526","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}
{"title":"UAV-Aided Wireless Communication Design with Propulsion Energy Constraint","authors":"Subin Eom, Hoon Lee, Junhee Park, Inkyu Lee","doi":"10.1109/ICC.2018.8422583","DOIUrl":"https://doi.org/10.1109/ICC.2018.8422583","url":null,"abstract":"This paper studies unmanned aerial vehicle (UAV) aided wireless communication systems where a UAV serves uplink communications of multiple ground nodes by flying the area of the interest. We aim to maximize the minimum average rate of the UAV by jointly optimizing the UAV trajectory and the ground nodes' uplink transmit power. However, this problem is shown to be non-convex in general, and thus existing convex optimization techniques and algorithms cannot be directly applied. By employing the successive convex approximation (SCA) techniques, we present an efficient algorithm which is guaranteed to converge to at least a local optimal point for the non-convex problems. To this end, proper convex approximations are derived for the non-convex constraints. Numerical results demonstrate the proposed algorithm performs better than baseline scheme.","PeriodicalId":387855,"journal":{"name":"2018 IEEE International Conference on Communications (ICC)","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115433885","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}