Proceedings of the 19th ACM International Symposium on Mobility Management and Wireless Access最新文献_第2页

MOTIVE - Time-Optimized Contextual Information Flow On Unmanned Vehicles 动机-无人驾驶车辆上的时间优化上下文信息流

Proceedings of the 19th ACM International Symposium on Mobility Management and Wireless Access Pub Date : 2021-11-22 DOI: 10.1145/3479241.3486691

Kostantinos Gerakos, Kakia Panagidi, Charalampos Andreou, Dimitris Zampouras

{"title":"MOTIVE - Time-Optimized Contextual Information Flow On Unmanned Vehicles","authors":"Kostantinos Gerakos, Kakia Panagidi, Charalampos Andreou, Dimitris Zampouras","doi":"10.1145/3479241.3486691","DOIUrl":"https://doi.org/10.1145/3479241.3486691","url":null,"abstract":"The last decades, an increasing interest has been witnessed on the exploitation of unmanned vehicles in fields such as environmental monitoring, commercial air surveillance, domestic policing, geophysical surveys, disaster relief, scientific research, civilian casualties, search and rescue operations, maritime patrol,traffic management, etc. Regardless of the domain (i.e., aerial, ground or surface) that they belong to, the key elements that distinguish them as the leading edge of their technology, are the provided degree of autonomy (i.e., the ability to make decisions without human intervention) and the endurance and the payload that they can support. The mobile IoT paradigm has been significantly expanded with the proliferation of drones and unmanned robotic devices. End-to-end communication and edge decision support are major challenges when operating with mobile nodes and especially with drones. In this paper, we propose a framework that uses two decision making stochastic optimization models of on-line control unit applied on transmission functionalities of mobile and static nodes adaptive to changes in network quality statistics. This is driven by a novel dynamic suppression control of telemetry process and control messages based on the principles of the Optimal Stopping Theory (OST). MOTIVE's time-optimized control mechanism ensures the optimal delivery of critical information from unmanned vehicles to ground control station and vice versa. The main goal, through this proposal, is to significantly enhance the operation of unmanned vehicles when operating under saturated, high traffic wireless networks.","PeriodicalId":349943,"journal":{"name":"Proceedings of the 19th ACM International Symposium on Mobility Management and Wireless Access","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116301127","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}

引用次数: 7

Hierarchical Models for Detecting Mobility Clusters during COVID-19 COVID-19期间移动集群检测的分层模型

Proceedings of the 19th ACM International Symposium on Mobility Management and Wireless Access Pub Date : 2021-11-22 DOI: 10.1145/3479241.3486690

Necati A. Ayan, Arti Ramesh, A. Seetharam, A. A. D. A. Rocha

{"title":"Hierarchical Models for Detecting Mobility Clusters during COVID-19","authors":"Necati A. Ayan, Arti Ramesh, A. Seetharam, A. A. D. A. Rocha","doi":"10.1145/3479241.3486690","DOIUrl":"https://doi.org/10.1145/3479241.3486690","url":null,"abstract":"Analyzing and developing mobility models that accurately capture human mobility is critical for combating the COVID-19 pandemic and minimizing the spread of the disease. In this paper, we design a two-layer hierarchical mobility model to model user mobility in the city of Rio de Janeiro and its suburbs by analyzing cellular network connectivity data during the COVID-19 pandemic. To this end, we collaborate with one of the main network providers in Brazil, TIM Brazil, to collect user connectivity logs from April 5th, 2020 to July 2nd, 2020, which we use to generate mobility graphs. We adopt the Louvain community detection algorithm in the first layer of our hierarchical model to detect the main communities in the city from the mobility graphs. Our model then uses the KMeans++ and Agglomerative clustering methods in the second layer to identify high, medium, and low mobility clusters within each community. Via extensive experiments, we show that the Louvain, and the Kmeans++ and Agglomerative algorithms outperform traditional clustering approaches in the first and second layers, respectively. Our results also demonstrate that our hierarchical model is able to pinpoint main mobility locations within each community and can be used by authorities to implement partial lockdown measures in place of widely unpopular complete lockdowns.","PeriodicalId":349943,"journal":{"name":"Proceedings of the 19th ACM International Symposium on Mobility Management and Wireless Access","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121660141","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

Modelling Downlink Aggregation in Paced WLANs 有节奏无线局域网下行链路聚合建模

Proceedings of the 19th ACM International Symposium on Mobility Management and Wireless Access Pub Date : 2021-11-22 DOI: 10.1145/3479241.3486697

F. Gringoli, D. Leith

引用次数: 0

A Multi-Slice Multi-Operator Dynamic Weighted Fair Queuing RAN Scheduling in a Game Theoretic Framework 博弈论框架下的多片多算子动态加权公平排队RAN调度

Proceedings of the 19th ACM International Symposium on Mobility Management and Wireless Access Pub Date : 2021-11-22 DOI: 10.1145/3479241.3486703

Joe Saad, K. Khawam, Mohamad Yassin, Salvatore Costanzo

{"title":"A Multi-Slice Multi-Operator Dynamic Weighted Fair Queuing RAN Scheduling in a Game Theoretic Framework","authors":"Joe Saad, K. Khawam, Mohamad Yassin, Salvatore Costanzo","doi":"10.1145/3479241.3486703","DOIUrl":"https://doi.org/10.1145/3479241.3486703","url":null,"abstract":"In 5G networks, multiple services with different Quality of Service (QoS) constraints are supported such as services requiring high throughput, low latency, or dense coverage. In order to support these different types of services, slicing is a key mechanism for providing logical partitioning of the same physical infrastructure based on the network service demands. Radio resource allocation optimization remains an important aspect in the context of slicing especially when multiple virtual operators with diverse types of services come into play. In such a context, numerous factors should be considered when allocating radio resources such as the available capacity, the diverse resource needs of virtual operators (VO) and the monetary cost of resources allotted by the infrastructure provider. This paper portrays the resource allocation problem as a non-cooperative game then as a Stackelberg game in a multi-VO multi-slice network. In such a context, the infrastructure provider seeks to satisfy the VO minimal throughput requirement via Dynamic Weighted Fair Queuing (DWFQ) while guaranteeing its own monetary profit, whereas VOs strive to selfishly fulfill their throughput requirements in any slice. Through exhaustive simulations, adequate pricing and satisfactory resource allocation to each VO in each slice were obtained based on specific network inputs.","PeriodicalId":349943,"journal":{"name":"Proceedings of the 19th ACM International Symposium on Mobility Management and Wireless Access","volume":"144 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114511762","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

An Evolution of Proxy Mobile IPv6 to the Cloud 代理移动IPv6向云的演进

Proceedings of the 19th ACM International Symposium on Mobility Management and Wireless Access Pub Date : 2021-11-22 DOI: 10.1145/3479241.3486684

Ákos Leiter, Nándor Galambosi, L. Bokor

引用次数: 3

A Mechanism for Improving the Spectral Efficiency in mu-MIMO for 5G and Beyond Networks 提高5G及以上网络mu-MIMO频谱效率的机制

Proceedings of the 19th ACM International Symposium on Mobility Management and Wireless Access Pub Date : 2021-11-22 DOI: 10.1145/3479241.3486681

Eirini Barri, Christos Bouras, V. Kokkinos, Aspasia Koukouvela

引用次数: 2

Towards the Design of Smart Vehicular Traffic Flow Prediction 面向智能车辆交通流预测的设计

Proceedings of the 19th ACM International Symposium on Mobility Management and Wireless Access Pub Date : 2021-11-22 DOI: 10.1145/3479241.3486701

A. Boukerche, Jiahao Wang

引用次数: 4

Minimizing Rate Variability with Effective Resource Utilization in 5G Networks 在有效利用5G网络资源的前提下最小化速率变化

Proceedings of the 19th ACM International Symposium on Mobility Management and Wireless Access Pub Date : 2021-11-22 DOI: 10.1145/3479241.3486692

Fidan Mehmeti, T. L. Porta

{"title":"Minimizing Rate Variability with Effective Resource Utilization in 5G Networks","authors":"Fidan Mehmeti, T. L. Porta","doi":"10.1145/3479241.3486692","DOIUrl":"https://doi.org/10.1145/3479241.3486692","url":null,"abstract":"One of the main features of 5G networks is to provide high data rates with low variability to mobile users. However, this has been shown to be ineffective from the operator's perspective as it leads to abundantly unused network resources. Reallocating the unused resources to the same users increases back the data rate variability. A more efficient way is to provide different low-variability data rates to the users depending on their channel conditions, while not wasting network resources considerably. In this paper, the goal is to minimize the coefficient of variation across all users in the cell. To that end, we consider two approaches, one with reserved resources for every user and the other where the amount of allocated resources is decided on the fly. Then, for each of them, we look at different allocation policies and derive the maximum achievable constant rate for every user. We evaluate the performance on a real trace. Results show that utilizing policies with no-resource-reservation increases considerably the utilization of network resources and the achievable data rates at the expense of a slight increase in variability. Also, using our policies, the waste of resources drops to 15%, which is almost 4x lower than with other state-of-the-art techniques.","PeriodicalId":349943,"journal":{"name":"Proceedings of the 19th ACM International Symposium on Mobility Management and Wireless Access","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132293596","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}

引用次数: 3

Improving Delivery Ratio in LoRa Network 提高LoRa网络的交付率

Proceedings of the 19th ACM International Symposium on Mobility Management and Wireless Access Pub Date : 2021-11-22 DOI: 10.1145/3479241.3486698

Rafał Marjasz, Konrad Polys, Anna Strzoda, K. Grochla

{"title":"Improving Delivery Ratio in LoRa Network","authors":"Rafał Marjasz, Konrad Polys, Anna Strzoda, K. Grochla","doi":"10.1145/3479241.3486698","DOIUrl":"https://doi.org/10.1145/3479241.3486698","url":null,"abstract":"The LoRa (Long Range) radio communication provides large coverage areas, low bandwidth, small data rates, and transmitting limited data sizes, with very low energy usage. Multiple transmission channels are used, but the number of channels available is fairly limited - e.g. 8 in most countries in Europe. The amount of interferences may be estimated by the continuous observation of the number of delivered packets and the received signal strength. We propose to aggregate and analyse those metrics per channel and geographical area. When the proportion of received packets per some of the areas decreases, it is subjected to heavier interferences than other parts of the network and should be used less intensively. Thus we propose to allocate the weights for each channel per geographic area and/or device, defining the probability of the channel usage. Furthermore, we created an algorithm that periodically updates the weights and a simulation model using OMNeT++, FloRa, taking into account possible packets collisions. The algorithm has been validated for both random and realistic network topologies. The simulation evaluations show a significant improvement in the package delivery efficiency, by almost 50% in scenarios with very high interference level simulated and by more than 13% in scenarios fed with real-life measurements of packet delivery probability changes in time.","PeriodicalId":349943,"journal":{"name":"Proceedings of the 19th ACM International Symposium on Mobility Management and Wireless Access","volume":"18 Odontol Sect 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123422110","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}

引用次数: 3

Social Groups Based Content Caching in Wireless Networks 无线网络中基于社会群体的内容缓存

Proceedings of the 19th ACM International Symposium on Mobility Management and Wireless Access Pub Date : 2021-10-07 DOI: 10.1145/3479241.3486694

Nimrah Mustafa, Imdadullah Khan, Muhammad Asad Khan, Z. Uzmi

{"title":"Social Groups Based Content Caching in Wireless Networks","authors":"Nimrah Mustafa, Imdadullah Khan, Muhammad Asad Khan, Z. Uzmi","doi":"10.1145/3479241.3486694","DOIUrl":"https://doi.org/10.1145/3479241.3486694","url":null,"abstract":"The unprecedented growth of wireless mobile traffic, mainly due to multimedia traffic over online social platforms has strained the resources in the mobile backhaul network. A promising approach to reduce the backhaul load is to proactively cache content at the network edge, taking into account the overlaid social network. Known caching schemes require complete knowledge of the social graph and mainly focus on one-to-one interactions forgoing the prevalent mode of content sharing among circles of 'friends'. We propose Bingo, a proactive content caching scheme that leverages the presence of interest groups in online social networks. The mobile network operator (MNO) can choose to incrementally deploy Bingo at select network nodes (base stations, packet core, data center) based on user profiles and revenue numbers. We approximate the group memberships of users using the available user-content request logs without any prior knowledge of the overlaid social graph. Bingo can cater to the evolving nature of online social groups and file popularity distribution for making caching decisions. We use synthetically generated group structures and simulate user requests at the base station for empirical evaluation against traditional and recent caching schemes. Bingo achieves up to 30%-34% gain over the best baseline.","PeriodicalId":349943,"journal":{"name":"Proceedings of the 19th ACM International Symposium on Mobility Management and Wireless Access","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128304598","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