{"title":"Design of Ultrasonic Wireless Power Transfer System","authors":"K. Nagaya, Jiang Liu, S. Shimamoto","doi":"10.1109/GCWkshps45667.2019.9024399","DOIUrl":"https://doi.org/10.1109/GCWkshps45667.2019.9024399","url":null,"abstract":"We designed a wireless power transmission (WPT) system using airborne ultrasonic waves and measured the received power characteristics of the system. Ultrasonic WPT is evaluated from these characteristics. We support the future development of ultrasonic WPT by presenting the details of the components (generator, amplifier, transducer, rectifier) that make up this system, with a detailed discussion. It has also been shown that when multiple transducer-rectifier circuits (passive sources) are used at the receiver, they can be connected in parallel to add all the signals and efficiently supply power to the load. Finally, we discussed the potential of near-field WPT as well as vibration energy harvesting.","PeriodicalId":210825,"journal":{"name":"2019 IEEE Globecom Workshops (GC Wkshps)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126414783","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":"Optimal Patrolling Trajectory Design for Multi-UAV Wireless Servicing and Battery Swapping","authors":"Xiao Zhang, Lingjie Duan","doi":"10.1109/GCWkshps45667.2019.9024535","DOIUrl":"https://doi.org/10.1109/GCWkshps45667.2019.9024535","url":null,"abstract":"In terrestrial cellular networks, cell-edge users often suffer from poor channel conditions due to their long distances from ground base station. Unmanned Aerial Vehicle (UAV) patrolling can help to enhance the channel conditions of cell-edge users by flying close to them to provide wireless service. As a UAV's wireless coverage is limited and can only serve users closely, appropriate patrolling trajectory may significantly shorten the communication distance and thus is crucial for high-capacity performance. Existing work on UAV patrolling trajectory design overlooks the limit of UAV's patrolling time due to its limited battery capacity, and we should jointly design UAVs' trajectories and battery swapping at the station to serve cell-edge users for achieving sustainable patrolling. The design becomes more challenging for multi-UAV scenario and we study the problem of minimizing the maximum idle time for serving any cell-edge user. By partitioning the cell-edge into uniform arcs patrolled separately by individual UAV in a back and forth fashion, we present two patrolling algorithms, in which one restricts UAV to make round trip for battery swapping (round trip swapping) and the other performs better since it benefits from UAV flying from one endpoint of the arc to the other endpoint (closed loop swapping) by using battery swapping station as a relay. Further, we evenly distribute all UAVs and allow each UAV to fly in the same direction along the cell-edge and thus present a cyclic-based algorithm. We prove the lower bound of idle time for our problem, and show that partition algorithm based on closed loop swapping and cyclic-based algorithm can both achieve optimal idle time. Finally, we validate the theoretical results by simulations.","PeriodicalId":210825,"journal":{"name":"2019 IEEE Globecom Workshops (GC Wkshps)","volume":"172 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132191499","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":"A Scheduling Framework for Latency Optimization on 5G Mobile Edge Computing Infrastructures","authors":"B. Carpentieri, F. Palmieri","doi":"10.1109/GCWkshps45667.2019.9024380","DOIUrl":"https://doi.org/10.1109/GCWkshps45667.2019.9024380","url":null,"abstract":"Minimizing the latency in communications is assuming a paramount importance in 5G architectures, mainly for mission-critical applications associated to the IoT environment. However, the need of interacting with cloud-based applications introduces unacceptable delays essentially due to wide area transport activities over the Internet. Many solutions are emerging for facing this problem ranging from cloudlets to fog and edge computing architectures, pushing flexible virtualization environments nearer to the end devices, ideally within the base stations. Unfortunately, most of these infrastructures are managed by cloud providers in a network- oblivious way so that in presence of multiple nodes operating at the edge level in the same area no latency optimization strategies are taken into consideration. Accordingly, we present a novel latency- aware edge node selection framework based on a multi-objective bin packing problem transposed in the mobile edge computing scenario where the selection criterion is driven by both latency optimization and load balancing, managed according to a time slotted scheme.","PeriodicalId":210825,"journal":{"name":"2019 IEEE Globecom Workshops (GC Wkshps)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130050918","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":"On the Achievable Energy Efficiency in Dynamic Licensed Shared Access","authors":"S. Onidare, K. Navaie, Q. Ni","doi":"10.1109/GCWkshps45667.2019.9024483","DOIUrl":"https://doi.org/10.1109/GCWkshps45667.2019.9024483","url":null,"abstract":"The licensed shared access (LSA) promises to be a viable alternative solution to the well-reported spectrum underutilization. The higher priority of the incumbent in the spectrum sharing arrangement implies that the licensee's access to the spectrum can be revoked or restricted at any time. This has been observed to result in degradation of some critical performance metrics of the latter. In this paper, we investigate the effect of this on the energy efficiency (EE) of an LSA sharing between an airport incumbent and a mobile network operator licensee. We formulate expressions for the operating transmit power of the licensee when its spectrum access right is revoked/restricted in both the uplink and downlink transmission directions. We then propose a power allocation scheme that maximizes the EE of the licensee during these time intervals in which the licensee operating transmit power is constrained by the incumbent system's utilization of the spectrum. We further provide analytical discussions on how the achievable EE during this time compares to when the licensee's access to the spectrum is free of any restriction from the incumbent. The results obtained show that while the EE suffers degradation in the uplink when the licensee spectrum access right is restricted, there is no noticeable difference in the achievable EE in the downlink direction. Furthermore, in the uplink, the optimal power allocation provides better EE even than when the spectrum is free especially at lower transmit power and channel number, while in the downlink, the optimal power allocation EE is consistently better than the free spectrum EE.","PeriodicalId":210825,"journal":{"name":"2019 IEEE Globecom Workshops (GC Wkshps)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130429858","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":"Quantum Walk on Dimensionality Reduced Complete Bipartite Graphs with k Edges Removed","authors":"Chen-Fu Chiang, Aaron Gregory","doi":"10.1109/GCWkshps45667.2019.9024513","DOIUrl":"https://doi.org/10.1109/GCWkshps45667.2019.9024513","url":null,"abstract":"Due to scalability issue in current quantum technologies, many quantum algorithms can only be implemented for small size problems. Scalability remains a bottleneck for current quantum technologies. For solving real-life size hard problems in the near-term, we explore classes of search graphs that can be efficiently reduced to a implementable scale for many quantum algorithms. The reduced Hamiltonian preserves the dynamics of the original Hamiltonian. One of the quantum algorithms we choose for the reduced Hamiltonian is continuous time quantum walk (CTQW). We further show how to determine the correct value of the coupling factor of the underlying CTQW. With wrong couple factor values, the optimality (quadratic speedup) from CTQW might be lost. In this work, we extend the class of reducible graphs to complete bipartite graphs with random $k$ edges removed. We further demonstrate through mathematical proof and simulation experiment using IBM Qiskit to show that the quadratic speed-up is preserved for the CTQW.","PeriodicalId":210825,"journal":{"name":"2019 IEEE Globecom Workshops (GC Wkshps)","volume":"1982 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130449349","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}
R. Abbas, M. Shirvanimoghaddam, Tao Huang, Yonghui Li, B. Vucetic
{"title":"Performance Analysis of Short Analog Fountain Codes","authors":"R. Abbas, M. Shirvanimoghaddam, Tao Huang, Yonghui Li, B. Vucetic","doi":"10.1109/GCWkshps45667.2019.9024699","DOIUrl":"https://doi.org/10.1109/GCWkshps45667.2019.9024699","url":null,"abstract":"Analog fountain codes are a class of rateless codes that have been demonstrated to achieve near-capacity performance for asymptotically long blocks, without any channel state information at the transmitter side. Recently, a new design for these codes has been proposed aimed at improving its performance in the finite block length regime, dubbed short analog fountain codes (S-AFC). S-AFC was shown to score error rates orders of magnitude smaller than AFC for blocks of a few hundred bits long. S-AFC was also shown to achieve average block lengths close to the Polyanskiy-Poor and Verdu bound for high SNR and exhibits no error floors down to 10^-7. In this paper, we derive lower and upper bounds on the block error rate (BLER) of S-AFC. We verify these bounds through Monte Carlo simulations and provide all the proofs in the appendix.","PeriodicalId":210825,"journal":{"name":"2019 IEEE Globecom Workshops (GC Wkshps)","volume":"198 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132636549","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}
Azade Fotouhi, Ming Ding, L. G. Giordano, Mahbub Hassan, Jun Li, Zihuai Lin
{"title":"Joint Optimization of Access and Backhaul Links for UAVs Based on Reinforcement Learning","authors":"Azade Fotouhi, Ming Ding, L. G. Giordano, Mahbub Hassan, Jun Li, Zihuai Lin","doi":"10.1109/GCWkshps45667.2019.9024685","DOIUrl":"https://doi.org/10.1109/GCWkshps45667.2019.9024685","url":null,"abstract":"In this paper, we study the application of unmanned aerial vehicle (UAV) base stations (BSs) in order to improve the cellular network capacity. We consider flying BSs where BS equipments are mounted on UAVs, making it possible to move BSs freely in space. We study the optimization of UAVs' trajectory in a network with mobile users to improve the system throughput. We consider practical two-hop communications, i.e., the access link between a user and the UAV BS, and the backhaul link between the UAV BS and a macrocell BS plugged into the core network. We propose a reinforcement learning based algorithm to control the UAVs' mobility. Additionally, the proposed algorithm is subject to physical constraints of UAV mobility. Simulation results show that considering both the backhaul and access links in the UAV mobility optimization is highly effective in improving the system performance than only focusing on the access link.","PeriodicalId":210825,"journal":{"name":"2019 IEEE Globecom Workshops (GC Wkshps)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133107111","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":"3-D Placement of UAVs Based on SIR-Measured PSO Algorithm","authors":"Wentao Liu, Guanchong Niu, Qi Cao, Man-On Pun, Junting Chen","doi":"10.1109/GCWkshps45667.2019.9024696","DOIUrl":"https://doi.org/10.1109/GCWkshps45667.2019.9024696","url":null,"abstract":"This work studies the deployment of unmanned aerial vehicles (UAVs) as emergency access points to provide wireless services to users in a green field. Specifically, three fundamental design issues are explored under practical 3D air-to-ground (ATG) channel models, namely the minimum number of UAVs, their optimal deployment locations and the optimal transmit power allocation. To decouple these design goals, a particle swarm optimization (PSO)-based scheme in conjunction with the balanced Signal to Interference plus Noise Ratio (SINR) transmit power allocation is proposed. Exploiting the closed-form expressions of the SINR-balanced optimal power allocation and the resulting SINR, the proposed PSO-based scheme optimizes the UAV location generation by generation. Furthermore, a K-means clustering-based initialization scheme is developed to improve the performance of the proposed PSO-based scheme. Finally, a power fine-tuning scheme is devised to further reduce the total transmit power. Extensive simulation is performed to confirm the good performance of the proposed scheme.","PeriodicalId":210825,"journal":{"name":"2019 IEEE Globecom Workshops (GC Wkshps)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131884046","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":"Segment-Based Joint Caching and Recommendation Optimization for Mobile Video Transmission","authors":"Hongzhang Wang, Wenpeng Jing, X. Wen, Zhaoming Lu, Shuyue Zhao","doi":"10.1109/GCWkshps45667.2019.9024441","DOIUrl":"https://doi.org/10.1109/GCWkshps45667.2019.9024441","url":null,"abstract":"Mobile edge caching is able to reduce transmission latency and relieve the traffic load of backhaul links in the delivery of mobile video contents. However, the content caching remains a challenging problem considering the relatively limited cache capacity and the heterogeneous user demand. Recommendation system, with the ability to shape users' demand, can be leveraged to improve the performance of mobile edge caching efficiency. In this paper, the caching policies and recommendation strategies are designed for the cache-enabled wireless networks. Considering popularity difference among segments in a single video content, a more fine-grained segment-based proactive caching policy is introduced, which is different from the existing works that focus on content-level caching. Besides, the impact of recommendation system on users’ request patterns is taken into account. In order to effectively reduce the content transmission latency, a joint caching and recommendation optimization problem is formulated. Due to the NP-hard nature, the problem is divided into two convex subproblems and a heuristic iterative algorithm is proposed. Numerical simulation results show that the proposed algorithm outperforms the existing algorithms in terms of both average transmission latency and cache hit ratio.","PeriodicalId":210825,"journal":{"name":"2019 IEEE Globecom Workshops (GC Wkshps)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124338167","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}
Gary M. Graceffo, J. Talamonti, Logan Campbell, S. Ashrafi, A. Kowalevicz
{"title":"Hybrid RF & FSO for Defense and 5G Backhaul","authors":"Gary M. Graceffo, J. Talamonti, Logan Campbell, S. Ashrafi, A. Kowalevicz","doi":"10.1109/GCWkshps45667.2019.9024320","DOIUrl":"https://doi.org/10.1109/GCWkshps45667.2019.9024320","url":null,"abstract":"Both defense and commercial 5G networks require ultra-broadband capacity and low latency for new applications. This paper is a collaborative development between Raytheon and NxGen Partners to develop a low cost and high bandwidth backhaul application for both defense and telecom industries. The Raytheon technology uses a Free- Space Optical (FSO) Fabry-Perot Etalon receiver that eliminates the need for adaptive optics, coupling into Single Mode (SM) fiber and synchronized local timing. The NxGen technology uses multiple Orbital Angular Momentum (OAM) modes to (i) mux and de-mux orthogonal and independent optical channels, and (ii) create isolations in an RF Full Duplex backhaul.","PeriodicalId":210825,"journal":{"name":"2019 IEEE Globecom Workshops (GC Wkshps)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114781670","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}