{"title":"Cellular Uplink Bandwidth Prediction Based on Radio Measurements","authors":"Imane Oussakel, P. Owezarski, Pascal Berthou","doi":"10.1145/3345770.3356733","DOIUrl":"https://doi.org/10.1145/3345770.3356733","url":null,"abstract":"In 4G networks, the emergence of machine communications such as connected vehicles increases the high demand of uplink transmissions, thus, degrading the quality of service per user equipment. Enforcing quality-of-service in such cellular network is challenging, as radio phenomenon, as well as user (and their devices) mobility and dynamics, are uncontrolled. To solve this issue, estimating what the quality of transmissions will be in a short future for a connected user is essential. For that purpose, we argue that radio metrics are key features whose evolutions can help predicting the bandwidth that the considered connections can take advantage of in the following hundreds of milliseconds. The paper then describes how a 4G testbed has been deployed in order to study the correlation between radio noise and throughput in uplink transmissions. Based on radio measurements, the main supervised machine learning algorithms are used, such as Random Forest and Support Vector Machine to predict the uplink received bandwidth. For a specific user service, we are able to predict the end-to-end received bandwidth, i.e. the amount of received data on the server side during a specific period at a very low scale of 100 ms. Results also prove that uplink bandwidth predictions are less accurate compared to bandwidth prediction for downlink based on radio measurements.","PeriodicalId":285517,"journal":{"name":"Proceedings of the 17th ACM International Symposium on Mobility Management and Wireless Access","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121925212","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":"Flexible Multipoint-to-Multipoint Routing Protocol in Ultra-Dense Nanonetworks","authors":"Lina Aliouat, H. Mabed, J. Bourgeois","doi":"10.1145/3345770.3356746","DOIUrl":"https://doi.org/10.1145/3345770.3356746","url":null,"abstract":"New applications in the field of radio networks require a high concentration of micro-machines (micro-robots, sensors/actuators) in a small space. Those devices are characterized by a high volatility and limited computing, storage and energy capabilities. Traditional routing approaches in ad hoc networks are unusable due to a significant amount of additional control traffic and a lack of robustness regarding the instability of the nodes. In this paper, we present an original, efficient and intuitive distributed routing protocol in ultra-dense terahertz networks, called Multipoint-to-Multipoint Routing Protocol (M2MRP), which is an emanation of electrostatic physics. A complexity analysis is performed to compare the M2MRP protocol with classical methods. Our study shows that the proposed protocol takes advantage of the nodes density to define a robust routing policy with a moderate additional traffic control. In addition, routing paths are adapted gradually and continuously according to the nodes location (mobility), availability (failures), congestion and energy level. Simulations show that the M2MRP routing protocol significantly outperforms the well-known routing protocols for dense networks both in terms of the number of exchanged messages and of success rate, making this routing protocol the most suitable for systems such as swarm micro-robots, programmable matter and ultra-dense sensor networks.","PeriodicalId":285517,"journal":{"name":"Proceedings of the 17th ACM International Symposium on Mobility Management and Wireless Access","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127400338","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 Analysis of Users' Behavior Based on Mobile Phone Apps","authors":"A. C. Domingues, Fabrício A. Silva, A. Loureiro","doi":"10.1145/3345770.3356739","DOIUrl":"https://doi.org/10.1145/3345770.3356739","url":null,"abstract":"Currently, we live in highly connected environments in which we consume large amounts of data, such as contextual information, and produce even larger amounts of data. In this never-ending cycle, the generated data is taken to other applications, creating pervasive and context-aware systems with which we interact. As this cycle goes on, users share their personal and private data, such as current location, activities, and even their mood, which establish a drawback as users may not want to expose themselves. Therefore, we face a trade-off between sharing personal data and, thus, losing privacy, or not sharing it and, possibly, losing quality of experience in relation to services and applications. In this work, we analyze properties of a mobile phone dataset containing precise information about users' accesses to applications to answer the following questions: (i) What can be inferred from an user at the current time given his/her past information? (ii) How does location data, which is a fundamental information in these networks, affect the inferences? To do this, we apply supervised and unsupervised learning techniques to predict network type -- Mobile or WiFi, application name, and user ID. Our results present an overview of how knowledge can be extracted from data shared by users, and which type of data is the most revealing.","PeriodicalId":285517,"journal":{"name":"Proceedings of the 17th ACM International Symposium on Mobility Management and Wireless Access","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121513550","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":"Mobility Coordination of Participants in Mobile CrowdSensing Platforms with Spatio-Temporal Tasks","authors":"Christine Bassem","doi":"10.1145/3345770.3356734","DOIUrl":"https://doi.org/10.1145/3345770.3356734","url":null,"abstract":"With the increased adoption of Mobile CrowdSensing platforms in urban environments, the mobility of participating self-motivated crowds already roaming in the field can be coordinated to assist in completing spatio-temporal sensing tasks. In this work, we propose to utilize the mobility predictability within such platforms, coupled with the availability of spatio-temporal tasks on the mobility field, to recommend routes for participants in real-time. In this paper, we define the graph-theoretic measure of Temporal Coverage Centrality, as well as adopt techniques from distributed systems to define three online route recommendation mechanisms, which can be used to coordinate the mobility of participants within MCS platforms to optimize system performance. Moreover, we empirically evaluate the efficiency of the proposed mechanisms with an insight on their benefits.","PeriodicalId":285517,"journal":{"name":"Proceedings of the 17th ACM International Symposium on Mobility Management and Wireless Access","volume":"464 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121708080","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":"Markovian Model for Broadcast in Wireless Body Area Networks","authors":"B. Baynat, Gewu Bu, M. Potop-Butucaru","doi":"10.1145/3345770.3356747","DOIUrl":"https://doi.org/10.1145/3345770.3356747","url":null,"abstract":"Wireless body area networks became recently a vast field of investigation. A large amount of research in this field is dedicated to the evaluation of various communication protocols, e.g., broadcast or convergecast, against human body mobility. Most of the time this evaluation is done via simulations and in many situations only synthetic data is used for the human body mobility. In this paper we propose for the first time in Wireless Body Area Networks a Markovian analytical model specifically designed for WBAN networks. The main objective of the model is to evaluate the efficiency of a multi-hop transmission in the case of a diffusion-based broadcast protocol, with respect to various performance parameters (e.g., cover probability, average cover number, hitting probability or average cover time). We validate our model by comparing its results to simulation and show its accuracy. Finally, but not least, we show how our model can be used to analytically evaluate the trade-off between transmission power and redundancy, when the same message is broadcasted several times in order to increase the broadcast reliability while maintaining a low transmission power.","PeriodicalId":285517,"journal":{"name":"Proceedings of the 17th ACM International Symposium on Mobility Management and Wireless Access","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133421664","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":"Proceedings of the 17th ACM International Symposium on Mobility Management and Wireless Access","authors":"","doi":"10.1145/3345770","DOIUrl":"https://doi.org/10.1145/3345770","url":null,"abstract":"","PeriodicalId":285517,"journal":{"name":"Proceedings of the 17th ACM International Symposium on Mobility Management and Wireless Access","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125806477","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}