2021 IEEE 22nd International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM)最新文献

{"title":"Service Placement and Bandwidth Allocation for MEC-enabled Mobile Cloud Gaming","authors":"Tuo Cao, Zhuzhong Qian, Kun Wu, Mingxian Zhou, Yibo Jin","doi":"10.1109/WoWMoM51794.2021.00031","DOIUrl":"https://doi.org/10.1109/WoWMoM51794.2021.00031","url":null,"abstract":"Mobile cloud gaming (MCG), which is potential to deliver high-quality gaming experience to users anywhere and anytime, suffers from tremendous wide-area traffic and long network delays. Mobile edge computing (MEC), where cloud computing capabilities are pushed to the network edge, can help by providing gaming services in the proximity to users. However, since the quality of experience (QoE), i.e., the gaming experience, is easily impaired by long network delays and low frame rates, the performance of MEC-enabled MCG highly depends on the placement of gaming services and the allocation of related bandwidth. Furthermore, due to the erratic mobility of users, migrating services to follow such mobility decreases the impairment but incurs extra system cost, leading to the performance-cost tradeoff. To address these challenges, in this paper, we jointly investigate service placement and bandwidth allocation for MEC-enabled MCG. Considering the system dynamics, we propose to minimize the QoE impairment in a long time scope under a cost constraint for long-term migrations. To solve the problem, we develop an online two-layer iterative algorithm OnTrial. Rigorous theoretical analyses demonstrate that OnTrial achieves a near-optimal performance and bounds the potential violation of the migration cost constraint. Simulation results show that OnTrial outperforms other algorithms by at least 25% on the long-term QoE impairment.","PeriodicalId":131571,"journal":{"name":"2021 IEEE 22nd International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121261071","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 Truthful Auction Mechanism for Resource Allocation in Mobile Edge Computing","authors":"Bilian Wu, Xin Chen, Ying Chen, Yangguang Lu","doi":"10.1109/WoWMoM51794.2021.00015","DOIUrl":"https://doi.org/10.1109/WoWMoM51794.2021.00015","url":null,"abstract":"Offloading tasks from computing intensive mobile devices (MDs) to neighboring edge servers in the form of incentive mechanism can effectively reduce latency and increase utility in mobile edge computing (MEC). In this paper, we design an auction mechanism for a MEC system, and the system consists of multiple MDs and one service provider (SP). As the auctioneer, SP receives the bidding information from MDs, making resource allocation strategies by optimizing social welfare. An exact algorithm to solve social welfare maximization problem and a perturbation-based randomized allocation algorithm to achieve (1 − α) optimal social welfare approximation rate are proposed. Furthermore, we prove that the truthful random auction mechanism can achieves the auction properties, including individual rationality, incentive compatibility, weakly budget balance and computational efficiency in theory. Finally, simulation results show the effectiveness of the auction mechanism.","PeriodicalId":131571,"journal":{"name":"2021 IEEE 22nd International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127266267","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":"Effect of Antenna Orientation on the Air-to-Air Channel in Arbitrary 3D Space","authors":"N. C. Matson, Syed Muhammad Hashir, Sicheng Song, D. Rajan, J. Camp","doi":"10.1109/WoWMoM51794.2021.00055","DOIUrl":"https://doi.org/10.1109/WoWMoM51794.2021.00055","url":null,"abstract":"Unmanned Aerial Vehicles (UAVs) often lack the size, weight, and power to support large antenna arrays or a large number of radio chains. Despite such limitations, emerging applications that require the use of swarms, where UAVs form a pattern and coordinate towards a common goal, must have the capability to transmit in any direction in three-dimensional (3D) space from moment to moment. In this work, we design a measurement study to evaluate the role of antenna polarization diversity on UAV systems communicating in arbitrary 3D space. To do so, we construct flight patterns where one transmitting UAV is hovering at a high altitude (80 m) and a receiving UAV hovers at 114 different positions that span 3D space at a radial distance of approximately 20 m along equally-spaced elevation and azimuth angles. To understand the role of diverse antenna polarizations, both UAVs have a horizontally-mounted antenna and a vertically-mounted antenna—each attached to a dedicated radio chain—creating four wireless channels. With this measurement campaign, we seek to understand how to optimally select an antenna orientation and quantify the gains in such selections.","PeriodicalId":131571,"journal":{"name":"2021 IEEE 22nd International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133908010","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":"Extending the QUIC Protocol to Support Live Container Migration at the Edge","authors":"Luca Conforti, A. Virdis, C. Puliafito, E. Mingozzi","doi":"10.1109/WoWMoM51794.2021.00019","DOIUrl":"https://doi.org/10.1109/WoWMoM51794.2021.00019","url":null,"abstract":"In modern cloud and edge computing environments, services are typically provided as Virtual Machines (VMs). More recently, containers have been gaining momentum as a lightweight form of VMs. Container migration is used for several reasons, one of which being to maintain proximity between edge computing services and mobile users. When migrating containers, however, it is important to consider that they typically have ongoing communications with other endpoints, e.g., users’ applications. Moreover, in case of connection-oriented protocols, communicating endpoints share a state (i.e., the connection), which needs to be migrated as well. Connection-oriented protocols like TCP were not designed having connection migration in mind, thus their connections cannot survive a change of IP address or port number. On the other hand, the QUIC protocol provides a mechanism for client-side connection migration, i.e., when a client device changes IP address (e.g., after a wireless handover), QUIC transparently migrates ongoing connections to the new address. Nonetheless, server-side connection migration in QUIC is not yet implemented nor investigated. In this paper, we extend QUIC to support server-side connection migration when a container is migrated between hosts. More specifically, we design two different strategies to achieve this purpose. Besides, we describe a proof-of-concept implementation based on aioquic, a Python open-source implementation of QUIC. We also verify that our implementation does not break QUIC specification nor undermines aioquic interoperability. Finally, we evaluate our solution by testing both the considered strategies using different container migration techniques and against a no-migration scenario.","PeriodicalId":131571,"journal":{"name":"2021 IEEE 22nd International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"95 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130972531","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":"PhD Forum: Padding Overhead Reduction in Random Linear Coded Variable Size Media Streams","authors":"Maroua Taghouti","doi":"10.1109/WoWMoM51794.2021.00040","DOIUrl":"https://doi.org/10.1109/WoWMoM51794.2021.00040","url":null,"abstract":"Ubiquitous IoT allowed everything to be connected, thereby creating heterogeneous data transmissions in the network, ranging from small sensor packets to large video frames. This prevents error correction techniques from proper algebraic coding without padding the unequal-sized packets. Random Linear Network Coding (RLNC) for instance, generates unreasonable amounts of padding overhead in media distribution that can suppress its pervasive benefits. We propose a set of approaches that overcome this issue, while also reducing the decoding delays at the same time.","PeriodicalId":131571,"journal":{"name":"2021 IEEE 22nd International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131241229","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":"Performance Analysis of a Dual Terahertz/Ka Band Communication System for Satellite Mega-Constellations","authors":"Ali J. Alqaraghuli, Hussam Abdellatif, J. Jornet","doi":"10.1109/WoWMoM51794.2021.00058","DOIUrl":"https://doi.org/10.1109/WoWMoM51794.2021.00058","url":null,"abstract":"With the rise of satellite mega-constellations, high-data-rate and low-latency space-based internet is set to transform the lives of users in remote locations with no access to the fiber-optic infrastructure. While current commercial constellations are relying on microwaves, they are legally and technologically limited to only a few gigahertz of bandwidth, paralyzing the potential for ultra high data rate performance. In this paper, a dual terahertz/Ka-band communication system is proposed and studied as a solution. A space-Earth propagation model based on the International Telecommunication Union most recent recommendations is presented, and a mega-constellation of 8,320 small satellites in low Earth orbit is designed to test the dual-band performance for the uplink, downlink, and crosslink. Extensive simulations are performed using an in-house-developed orbital simulation tool to calculate data rates for each terahertz and Ka band links based on signal-to-noise ratio estimates with dynamic decision making to constantly provide the highest data rate possible. For links between Earth and space, the results show similar performance for terahertz and Ka-band communications, while terahertz significantly outperforms in inter-satellite links. Simulation results show that terahertz communication can be a good candidate for space-Earth and inter-satellite links as both an enhancement to existing microwave technology and as a stand-alone technology with the identified challenges addressed.","PeriodicalId":131571,"journal":{"name":"2021 IEEE 22nd International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"267 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134018220","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":"PhD Forum: LoRaWAN networks evaluation through extensive ns-3 simulations","authors":"Martina Capuzzo","doi":"10.1109/WoWMoM51794.2021.00039","DOIUrl":"https://doi.org/10.1109/WoWMoM51794.2021.00039","url":null,"abstract":"In Internet of Things (IoT) applications, hundreds of sensors collect and transmit data to a central gateway, allowing applications such as smart cities, smart home, and smart agriculture. Scalability and energy efficiency are two common requirements for this type of IoT systems that can be tackled by providing the sensor nodes with energy harvesting capabilities, so that they can operate even without batteries, exploiting the renewable energy sources, with a dramatic reduction in the manufacturing, management, and decommissioning costs. In this work, we outline our approach for network-wide and energy-aware performance optimization of energy harvesting IoT networks employing LoRaWAN, one of the most widespread technologies for the IoT. We describe a viable method to enable more efficient energy-aware operations on battery-less IoT devices, presenting promising preliminary results.","PeriodicalId":131571,"journal":{"name":"2021 IEEE 22nd International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132820379","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":"Context-Aware Fine-Grained Task Scheduling at Vehicular Edges: An Extreme Reinforcement Learning based Dynamic Approach","authors":"Shafkat Islam, S. Badsha, S. Sengupta","doi":"10.1109/WoWMoM51794.2021.00016","DOIUrl":"https://doi.org/10.1109/WoWMoM51794.2021.00016","url":null,"abstract":"Vehicular edge computing (VEC), being a novel computing paradigm, promises to provide divergent vehicular edge services, both functional (e.g., charging route prediction, emergency messages, etc.) and infotainment (e.g. video gaming applications, featured movie series, etc.), at the network edge while satisfying application-specific QoS requirements. Vehicles usually send these service requests to nearest roadside units (RSUs), which contain mobile edge servers, according to the functional requirements or the vehicle owner preferences. However, the VEC server’s virtual resources may fall short compared to the unbounded amount of real-time service requests (infotainment/functional) during rush hours. This limitation entails VEC servers to fail to meet the stringent latency requirements which may create unwanted malfunction event during driving in the requested vehicles (if functional/critical service requests are delayed in processing). Moreover, the VEC environment’s intrinsic properties, i.e. mobility, application-specific distinct latency requirements, traffic congestion, and uncertain task arrival rate, make the VEC task scheduling problem a non-trivial one. In this paper, we propose an extreme reinforcement learning (ERL) based context-aware VEC task scheduler that can make online adaptive scheduling decisions to meet the application-specific latency requirements for both types of tasks (i.e. functional and infotainment). The scheduler can make scheduling decisions directly from its experience without prior knowledge or the VEC environment model. Finally, we present extensive simulation results to confirm the efficacy of the proposed scheduler. Results show that the VEC server can achieve successful (by meeting QoS requirements) task completion rate of above 96% for different task arrival rates (ranging from 10 to 50 arrival/s) using the proposed scheduler. In the simulation, we also analyze the scheduling algorithm’s scalability in response to the vertical expansion of the VEC server. Furthermore, we compare the performance of our proposed method with two baseline methods.","PeriodicalId":131571,"journal":{"name":"2021 IEEE 22nd International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"150 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116087876","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":"TTrees: Automated Classification of Causes of Network Anomalies with Little Data","authors":"Mohamed Moulay, R. G. Leiva, V. Mancuso, Pablo J. Rojo Maroni, Antonio Fernández","doi":"10.1109/WoWMoM51794.2021.00033","DOIUrl":"https://doi.org/10.1109/WoWMoM51794.2021.00033","url":null,"abstract":"Leveraging machine learning (ML) for the detection of network problems dates back to handling call-dropping issues in telephony. However, troubleshooting cellular networks is still a manual task, assigned to experts who monitor the network around the clock. We present here TTrees (from Troubleshooting Trees), a practical and interpretable ML software tool that implements a methodology we have designed to automate the identification of the causes of performance anomalies in a cellular network. This methodology is unsupervised and combines multiple ML algorithms (e.g., decision trees and clustering). TTrees requires small volumes of data and is quick at training.Our experiments using real data from operational commercial mobile networks show that TTrees can automatically identify and accurately classify network anomalies—e.g., cases for which a network low performance is not apparently justified by op-erational conditions—training with just a few hundreds of data samples, hence enabling precise troubleshooting actions.","PeriodicalId":131571,"journal":{"name":"2021 IEEE 22nd International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124913531","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":"Message from the NTN-6G and SwarmNet Workshop Chairs","authors":"","doi":"10.1109/wowmom51794.2021.00008","DOIUrl":"https://doi.org/10.1109/wowmom51794.2021.00008","url":null,"abstract":"","PeriodicalId":131571,"journal":{"name":"2021 IEEE 22nd International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124982047","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}