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

Hy-Fi: Aggregation of LiFi and WiFi using MIMO in IEEE 802.11 Hy-Fi:在IEEE 802.11中使用MIMO聚合LiFi和WiFi

2021 IEEE 22nd International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM) Pub Date : 2021-06-01 DOI: 10.1109/WoWMoM51794.2021.00023

A. Zubow, P. Gawłowicz, K. L. Bober, V. Jungnickel, K. Habel, F. Dressler

引用次数: 3

Comparison of Trip Matching Algorithms for Mobility Sharing Applications 出行共享应用中出行匹配算法的比较

2021 IEEE 22nd International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM) Pub Date : 2021-06-01 DOI: 10.1109/WoWMoM51794.2021.00051

F. Martelli, M. E. Renda

{"title":"Comparison of Trip Matching Algorithms for Mobility Sharing Applications","authors":"F. Martelli, M. E. Renda","doi":"10.1109/WoWMoM51794.2021.00051","DOIUrl":"https://doi.org/10.1109/WoWMoM51794.2021.00051","url":null,"abstract":"Trip matching algorithms used in ride-sharing and carpooling systems share the common goal of optimizing the number of used vehicles to satisfy a set of trips according to their temporal and spatial constraints, in order to better allocate resources and reduce traffic and congestion. However, each matching algorithm could be designed to pursue a different objective like, for instance, reducing users’ waiting time for quality of service, reducing the total amount of traveled distance within the system to reduce carbon footprint, or maximizing the time two trips are shared to favor user interaction. Changing the final system objective could significantly change the performance of the system itself. In this paper, we compare the performance of matching algorithms with different objectives and show whether potential tradeoffs exist in pursuing these objectives, taking into consideration all the actors in play in a mobility sharing application. In particular, by applying the matching algorithms to two sets of daily trips performed in the cities of Pisa, Italy, and Cambridge, USA, our analysis shows that there is a matching algorithm among the ones we tested able to provide a good compromise between different optimization objectives.","PeriodicalId":131571,"journal":{"name":"2021 IEEE 22nd International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"45 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":"116028719","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}

引用次数: 0

3D Position Optimization for the UAV-Assisted Relay Networks Enhancing by NOMA and MRC 基于NOMA和MRC增强的无人机辅助中继网络三维位置优化

2021 IEEE 22nd International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM) Pub Date : 2021-06-01 DOI: 10.1109/WoWMoM51794.2021.00060

D. Zhai, Huan Li, Ruonan Zhang, Haotong Cao

{"title":"3D Position Optimization for the UAV-Assisted Relay Networks Enhancing by NOMA and MRC","authors":"D. Zhai, Huan Li, Ruonan Zhang, Haotong Cao","doi":"10.1109/WoWMoM51794.2021.00060","DOIUrl":"https://doi.org/10.1109/WoWMoM51794.2021.00060","url":null,"abstract":"In this paper, we consider an unmanned aerial vehicle (UAV)-assisted relay network for B5G, where the UAV and the base station (BS) cooperated with each other to serve the cell-edge users. Aiming at this network, we propose a new decode-and-forward (DF) relay protocol incorporated with Non-orthogonal multiple access (NOMA) and maximum ratio combining (MRC), by which the coverage for the cell-edge users is enhanced. Theoretical analysis demonstrates that the proposed NOMA based relay protocol is superior to the traditional orthogonal multiple access (OMA) based relay protocol in terms of channel capacity. In order to make full use of the advantages of the proposed protocol, we formulate the 3D spatial position optimization problem of the UAV relay with the objective to maximize the sum-rate of all the cell-edge users. Based on the genetic algorithm, we propose an effective algorithm to solve the formulated problem. simulation results indicate that the proposed relay protocol greatly outperforms the traditional protocols, and the proposed algorithm achieves orders of magnitude speedup in computational time with only slight loss of performance.1","PeriodicalId":131571,"journal":{"name":"2021 IEEE 22nd International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"37 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":"116434026","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

WIP: Analysis of Feasible Topologies for Backhaul Mesh Networks 回程网状网络的可行拓扑分析

2021 IEEE 22nd International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM) Pub Date : 2021-06-01 DOI: 10.1109/WoWMoM51794.2021.00043

Gabriele Gemmi, R. Cigno, L. Maccari

引用次数: 1

Optimizing Task Allocation for Edge Micro-Clusters in Smart Cities 智慧城市边缘微集群任务分配优化

2021 IEEE 22nd International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM) Pub Date : 2021-06-01 DOI: 10.1109/WoWMoM51794.2021.00062

Yousef Alhaizaey, J. Singer, A. L. Michala

引用次数: 3

VideoTrain: A Generative Adversarial Framework for Synthetic Video Traffic Generation 视频列车:合成视频流量生成的生成对抗框架

2021 IEEE 22nd International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM) Pub Date : 2021-06-01 DOI: 10.1109/WoWMoM51794.2021.00034

C. Kattadige, Shashika R. Muramudalige, Kwon Nung Choi, Guillaume Jourjon, Haonan Wang, A. Jayasumana, Kanchana Thilakarathna

{"title":"VideoTrain: A Generative Adversarial Framework for Synthetic Video Traffic Generation","authors":"C. Kattadige, Shashika R. Muramudalige, Kwon Nung Choi, Guillaume Jourjon, Haonan Wang, A. Jayasumana, Kanchana Thilakarathna","doi":"10.1109/WoWMoM51794.2021.00034","DOIUrl":"https://doi.org/10.1109/WoWMoM51794.2021.00034","url":null,"abstract":"Unlike the traditional Internet application such as web browsing and peer-to-peer(P2P), video streaming has been dominating the global network traffic for the past few years, raising many challenges for network providers. With the popularity of interactive videos, a.k.a 360° videos, resource requirement for video streaming has been further increased. Prior identification of these video traffic is useful for effective provisioning of network resources, yet it is difficult due to the end-to-end encryption of data. However, with the recent advances in Machine Learning (ML) methods, prior identification of these resource-demanding traffic types has become viable. Nonetheless, they require more training data, without which leads to poor performance. Collecting more training data may also pose issues related to delayed training time. To remedy this problem, in this paper, we propose a novel Generative Adversarial Network (GAN) based data generation solution to synthesise video streaming data targeting 360°/normal video classification. Taking over 600 actual video traces and generating ≈ 30000 new traces, our post-classification results show that we can achieve 5 - 15% of accuracy improvement compared to only having actual traces.","PeriodicalId":131571,"journal":{"name":"2021 IEEE 22nd International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"146 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":"132656110","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

WIP: Leveraging QUIC for a Receiver-driven BBR for Cellular Networks WIP:利用QUIC为蜂窝网络的接收器驱动BBR

2021 IEEE 22nd International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM) Pub Date : 2021-06-01 DOI: 10.1109/WoWMoM51794.2021.00046

H. Haile, Karl-Johan Grinnemo, Simone Ferlin Oliveira, Per Hurtig, A. Brunström

{"title":"WIP: Leveraging QUIC for a Receiver-driven BBR for Cellular Networks","authors":"H. Haile, Karl-Johan Grinnemo, Simone Ferlin Oliveira, Per Hurtig, A. Brunström","doi":"10.1109/WoWMoM51794.2021.00046","DOIUrl":"https://doi.org/10.1109/WoWMoM51794.2021.00046","url":null,"abstract":"Cellular networks are continuously evolving to allow improved throughput and low latency performance for applications. However, it has been shown that, due to buffer over-provisioning, TCP’s standard loss-based congestion control algorithms (CCAs) can cause long delays in cellular networks. The QUIC transport protocol and the Bottleneck Bandwidth and Round-trip propagation time (BBR) congestion control are both proposed in response to shortcomings observed in TCP and loss-based CCAs. Despite its notable advantages, BBR can experience suboptimal delay performance in cellular networks due to one of its underlying design choices: the maximum bandwidth filter at the sender. In this work, we leverage QUIC’s extensibility to enhance BBR. Instead of using the ACK rate observed at the sender side, we apply a more fitting delivery rate calculated at the receiver. Our 5G-trace-based emulation experiments in CloudLab suggest that our modified QUIC could significantly improve latency without any notable effect on the throughput: In particular, in some of our experiments, we observe up to 39% reduction of the round-trip time (RTT) with a worstcase throughput reduction of 2.7%.","PeriodicalId":131571,"journal":{"name":"2021 IEEE 22nd International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"10 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":"133167297","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

Delay Performance of UAV-Based Buffer-Aided Relay Networks under Bursty Traffic: Mobile or Static? 突发业务量下基于无人机的缓冲辅助中继网络延迟性能:移动还是静态?

2021 IEEE 22nd International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM) Pub Date : 2021-06-01 DOI: 10.1109/WoWMoM51794.2021.00018

Rukhsana Ruby, Hailiang Yang, Viet Quoc Pham, Kaishun Wu

{"title":"Delay Performance of UAV-Based Buffer-Aided Relay Networks under Bursty Traffic: Mobile or Static?","authors":"Rukhsana Ruby, Hailiang Yang, Viet Quoc Pham, Kaishun Wu","doi":"10.1109/WoWMoM51794.2021.00018","DOIUrl":"https://doi.org/10.1109/WoWMoM51794.2021.00018","url":null,"abstract":"Being a beneficial service in emergency situations, UAV-aided relay communications have received tremendous attentions in the recent years. In this paper, we consider a three-node UAV-based relay network, in which a mobile UAV establishes communication between two remaining nodes in the system. Despite numerous works available for such a system on the optimization of trajectory and other communication resources, none of these have addressed the delay performance of the system at the granular packet level. Furthermore, it is already established that the equipment of buffer at the relay node provides more flexibility in the delivery of packets through the exploitation of better channel quality. On the other hand, with the continued popularity of multimedia and similar other applications, it is very likely that the source node in the system receives bursty traffic from different external networks. Given that the source and UAV nodes have finite packet-level buffers and the trajectory of the UAV is known, under a bursty traffic model, we aim to study the average end-to-end packet delay and buffer overflow performance of the system. While capturing the predictable channel variation due to the movement of the UAV, we establish a queuing model for the source and UAV nodes based on the stochastic process. Then, from the dynamics of the established queuing model, we derive the average end-to-end packet delay and queue overflow probability of such a system. Through extensive numerical simulation, we justify the accuracy and effectiveness of the proposed analytical model while comparing with three static deployment scenarios of the UAV. Through providing sufficient analytical evidence as well as the numerical results, we exhibit that a mobile relay system outperforms the static relay one in terms of both the delay and buffer overflow metrics.","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":"131233688","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

Program Placement Optimization for Storage-constrained Mobile Edge Computing Systems: A Multi-armed Bandit Approach 存储受限移动边缘计算系统的程序布局优化:一种多臂强盗方法

2021 IEEE 22nd International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM) Pub Date : 2021-06-01 DOI: 10.1109/WoWMoM51794.2021.00028

Ming Feng, M. Krunz

{"title":"Program Placement Optimization for Storage-constrained Mobile Edge Computing Systems: A Multi-armed Bandit Approach","authors":"Ming Feng, M. Krunz","doi":"10.1109/WoWMoM51794.2021.00028","DOIUrl":"https://doi.org/10.1109/WoWMoM51794.2021.00028","url":null,"abstract":"Mobile edge computing (MEC) is a promising technology to support computationally intensive mobile applications with stringent delay requirements. As MEC applications become much more diverse and complex, it becomes more challenging for an edge node (EN) with limited storage to keep the program codes of all tasks. In this paper, we investigate the problem of program placement and user association in storage-limited MEC systems. Formulating the problem as a sequential decision-making problem, we first derive the solution for a single EN by transforming the formulation into a multi-armed bandit (MBA) problem and solving it via a Thompson sampling (TS) algorithm. We then propose a solution framework for the multi-EN scenario, where we decompose the original problem into three subproblems and solve them with low-complexity approaches. The first subproblem is to learn the task popularity, which we also formulate as a MAB problem and solve it via a TS algorithm. The second subproblem is optimizing program placement under a given user association and we propose a greedy algorithm to solve it. The last subproblem relates to user association, which is solved by a dual decomposition-based approach. Simulation results show that the average latency achieved by our proposed schemes is 30% to 100% lower than two benchmark schemes and is on average less than 10% higher than a lower bound.","PeriodicalId":131571,"journal":{"name":"2021 IEEE 22nd International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"30 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":"131542207","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

A Preliminary Evaluation of QUIC for Mobile Serverless Edge Applications 移动无服务器边缘应用QUIC的初步评估

2021 IEEE 22nd International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM) Pub Date : 2021-06-01 DOI: 10.1109/WoWMoM51794.2021.00050

C. Cicconetti, Leonardo Lossi, E. Mingozzi, A. Passarella

引用次数: 1