Sarah Wassermann, P. Casas, Michael Seufert, Florian Wamser
{"title":"On the Analysis of YouTube QoE in Cellular Networks through in-Smartphone Measurements","authors":"Sarah Wassermann, P. Casas, Michael Seufert, Florian Wamser","doi":"10.23919/WMNC.2019.8881828","DOIUrl":"https://doi.org/10.23919/WMNC.2019.8881828","url":null,"abstract":"Cellular-network operators are becoming increasingly interested in knowing the Quality of Experience (QoE) of their customers. QoE measurements represent today a main source of information to monitor, analyze, and subsequently manage operational networks. In this paper, we focus on the analysis of YouTube QoE in cellular networks, using QoE and distributed network measurements collected in real users' smartphones. Relying on YoMoApp, a well-known tool for collecting YouTube smartphone measurements and QoE feedback in a crowdsourcing fashion, we have built a dataset covering about 360 different cellular users around the globe, throughout the past five years. Using this dataset, we study the characteristics of different QoE-relevant features for YouTube in smartphones. Measurements reveal a constant improvement of YouTube QoE in cellular networks over time, as well as an enhancement of the YouTube video streaming functioning in smartphones. Using the gathered measurements, we additionally investigate two case studies for YouTube QoE monitoring and analysis in cellular networks: the machine-learning-based prediction of QoE-relevant metrics from network-level measurements, and the modeling and assessment of YouTube QoE and user engagement in cellular networks and smartphone devices. Last but not least, we introduce the YoMoApp cloud dashboard to openly share smartphone YouTube QoE measurements, which allows anyone using the YoMoApp smartphone app to get immediate access to all the raw measurements collected at her devices.","PeriodicalId":197152,"journal":{"name":"2019 12th IFIP Wireless and Mobile Networking Conference (WMNC)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115044285","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":"Towards a reference context model for adaptive learning","authors":"Ouissem Benmesbah, Mahnane Lamia, Mohamed Hafidi, Ishaq Zouaghi","doi":"10.23919/WMNC.2019.8881825","DOIUrl":"https://doi.org/10.23919/WMNC.2019.8881825","url":null,"abstract":"Adaptive and context-aware learning provides learning content according to a learner’s context. In order to achieve this goal, the dimensions that constitute the context in the current learner’s state have to be determined. There are several existing works within this field and each of these are taking care of a subset of context parameters - like learning styles, learner location, etc. But, a standardized model that helps to capture a learner’s context in its entirety is not available. The requirement to define context more precisely and in a uniform way has been identified by several researchers because a general and precise definition of context can facilitate the identification of what does and does not constitute context and can enable reuse and share of contextual data over applications. To this end, this work proposes a reference context model that helps to define a learner’s context. The proposed model is developed by consolidating the various context parameters used in the existing adaptive systems and organizing them into an appropriate structure.","PeriodicalId":197152,"journal":{"name":"2019 12th IFIP Wireless and Mobile Networking Conference (WMNC)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122889299","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}
Mamoudou Sangare, Dinh-Van Nguyen, S. Banerjee, P. Mühlethaler, S. Bouzefrane
{"title":"Comparing different Machine-Learning techniques to predict Vehicles’ Positions using the received Signal Strength of periodic messages","authors":"Mamoudou Sangare, Dinh-Van Nguyen, S. Banerjee, P. Mühlethaler, S. Bouzefrane","doi":"10.23919/WMNC.2019.8881819","DOIUrl":"https://doi.org/10.23919/WMNC.2019.8881819","url":null,"abstract":"In this paper, vehicles use the beacons sent by Road Side Units (RSUs) to predict their positions on a road. The reception power is strongly influenced by the distance between a vehicle and the neighboring RSUs and thus Machine-Learning can be used to predict the position of vehicles between RSUs. We have to assume that the vehicles know their own positions, at least for a given duration, to build the model of the machine-learning algorithm. This position information can be obtained for instance from a GPS. When this information is no longer available, the machine-learning algorithm can be used to predict the vehicles’ positions. The vehicles can send a position request to the RSUs which will know the reception power of their beacons and the machine-learning algorithm can respond with the estimated position. In this study, we compare four well-known machine-learning techniques : K Nearest Neighbors (KNN), Neural Network (NN), Random Forest (RF) and Support Vector Machine (SVM). We study these techniques with different assumptions and discuss their respective advantages and drawbacks. Our results show that these four techniques provide very good results in terms of position predictions when the error on the transmission power is small.","PeriodicalId":197152,"journal":{"name":"2019 12th IFIP Wireless and Mobile Networking Conference (WMNC)","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115865220","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}
J. Radak, Daniel Schneider, Christian Henke, Hannes Frey
{"title":"Performance of Consensus and Formation Control subject to Bernoulli, Slotted Aloha and IEEE 802.11p Simulation Models","authors":"J. Radak, Daniel Schneider, Christian Henke, Hannes Frey","doi":"10.23919/WMNC.2019.8881681","DOIUrl":"https://doi.org/10.23919/WMNC.2019.8881681","url":null,"abstract":"We consider distributed control algorithms in multi-agent systems in which all the agents cooperatively work on a given task. Timely exchange of information is essential for good performance of distributed control algorithms. Wireless communication used for information exchange in such systems is lossy and the reliability of wireless communication depends on many factors. We consider systems where one communication channel is shared by all the agents. To establish reliable communication we need efficient media access schemes. In this paper we evaluate with slotted Aloha and IEEE 802.11p the influence of two different media access control algorithms on the performance of the two distributed control algorithms consensus and formation control. We compare these findings to the performance when wireless media access control is modelled using a simple Bernoulli model. We show simulation results how far consensus and formation in multi-agent systems using IEEE 802.11p media access control outperform the ones using slotted Aloha. Moreover, we present results showing that performance simulations using IEEE 802.11p networks is comparable to the results retrieved from multi-agent systems simulated with a simple Bernoulli modelled communication channel.","PeriodicalId":197152,"journal":{"name":"2019 12th IFIP Wireless and Mobile Networking Conference (WMNC)","volume":"330 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134232068","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":"Uplink Channel Estimation and Equalization in NB-IoT System","authors":"V. Savaux, Hamidou Dembélé, M. Kanj","doi":"10.23919/WMNC.2019.8881479","DOIUrl":"https://doi.org/10.23919/WMNC.2019.8881479","url":null,"abstract":"This paper deals with channel estimation and equalization, as well as noise variance estimation in uplink narrowband-internet of things (NB-IoT) system. Different techniques are studied in the context of NB-IoT, such as least square (LS) and linear minimum mean square error (LMMSE) for channel estimation, and zero forcing (ZF) and MMSE for equalization. It is shown that a low-complexity application of MMSE-based methods is made possible in NB-IoT by taking advantage of the small number of subcarriers. Furthermore, a noise variance estimator is suggested based on the combination of two successive observations of pilots, assuming slowly varying channel. We also prove that the proposed estimator is efficient, and confirm by simulations that both LMMSE channel estimator and MMSE equalizer can use the estimated noise variance instead of the exact value without loss of performance.","PeriodicalId":197152,"journal":{"name":"2019 12th IFIP Wireless and Mobile Networking Conference (WMNC)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115626580","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}
Xianfeng Liu, Shuai Wu, Quan Chen, Jianming Guo, Lei Yang, Chengguang Fan, Yong Zhao
{"title":"Constructing Robust Spanning Trees in Distributed Optical Communication Satellite Networks","authors":"Xianfeng Liu, Shuai Wu, Quan Chen, Jianming Guo, Lei Yang, Chengguang Fan, Yong Zhao","doi":"10.23919/WMNC.2019.8881811","DOIUrl":"https://doi.org/10.23919/WMNC.2019.8881811","url":null,"abstract":"Optical communication satellite network (OCSN) has been considered as a superior solution to broadband applications of space-based information, since it has many advantages such as less power and higher data rate. However, frail link, limited number of optical transceivers and time- varying network topology deteriorate topology control of OCSN in bootstrapping and reconfiguring scenarios. In this paper, we investigate the problem of constructing robust spanning trees in distributed OCSNs. Larger algebraic connectivity represents better robustness for a spanning tree. Regarding the complexity of the problem, we develop a heuristic algorithm for achieving a spanning tree with large algebraic connectivity and high average edge weight, which represents the OCSN link availability in the graph. Simulation results indicate that, comparing with other alternative algorithms, our algorithm can significantly improve algebraic connectivity and guarantee relative high average edge weight for resulting topology.","PeriodicalId":197152,"journal":{"name":"2019 12th IFIP Wireless and Mobile Networking Conference (WMNC)","volume":"43 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115689608","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}
Wmnc, M. Debbah, M. Curado, Thi Mai Trang Nguyen, S. Boumerdassi
{"title":"[WMNC 2019 Title Page]","authors":"Wmnc, M. Debbah, M. Curado, Thi Mai Trang Nguyen, S. Boumerdassi","doi":"10.23919/wmnc.2019.8881649","DOIUrl":"https://doi.org/10.23919/wmnc.2019.8881649","url":null,"abstract":"","PeriodicalId":197152,"journal":{"name":"2019 12th IFIP Wireless and Mobile Networking Conference (WMNC)","volume":"252 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114372119","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":"Distributed Network, Neighbor Discovery and Blind Routing for Mobile Wireless Ad-hoc Networks","authors":"Jed Carty, S. Jayaweera","doi":"10.23919/WMNC.2019.8881802","DOIUrl":"https://doi.org/10.23919/WMNC.2019.8881802","url":null,"abstract":"Mobile Ad-Hoc Networks (MANETs) often exist in dynamic environments that present challenges for network control functions, such as drone networks. Lacking infrastructure, MANETs require distributed control functions. Factors such as unpredictable movements, limited battery life and transmission ranges encourage efficient network control functions. Integrating control functions into a single protocol allows efficient, distributed control of the network which can be more robust against failures in the network. This paper presents the routing and network/neighbor discovery of a distributed network control protocol suitable for drone networks or other MANETS and an integrated protocol combining routing, and network/neighbor discovery. Using modified versions of Ad hoc On Demand Distance Vector (AODV) routing and Carrier-Sense Multiple Access (CSMA), the protocol performs blind route discovery and forwards packets while simultaneously performing network/neighbor discovery. Simulation shows the proposed protocol performing similarly to existing protocols for routing, scheduling, synchronization and network discovery even without having a priori knowledge of the network parameters which existing protocols use.","PeriodicalId":197152,"journal":{"name":"2019 12th IFIP Wireless and Mobile Networking Conference (WMNC)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130969676","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":"An Approximate Power Control Algorithm for a Multi-Cast Wireless Virtual Network Embedding","authors":"Haitham Afifi, H. Karl","doi":"10.23919/WMNC.2019.8881324","DOIUrl":"https://doi.org/10.23919/WMNC.2019.8881324","url":null,"abstract":"Internet of Things (IoT) applications witness an exceptional evolution of traffic demands, while existing protocols, as seen in wireless sensor networks (WSNs), struggle to cope with these demands. Traditional protocols rely on finding a routing path between sensors generating data and sinks acting as gateway or databases. Meanwhile, the network will suffer from high collisions in case of high data rates. In this context, in-network processing solutions are used to leverage the wireless nodes’ computations, by distributing processing tasks on the nodes along the routing path. Although in-network processing solutions are very popular in wired networks (e.g., data centers and wide area networks), there are many challenges to adopt these solutions in wireless networks, due to the interference problem. In this paper, we solve the problem of routing and task distribution jointly using a greedy Virtual Network Embedding (VNE) algorithm, and consider power control as well. Through simulations, we compare the proposed algorithm to optimal solutions and show that it achieves good results in terms of delay. Moreover, we discuss its sub-optimality by driving tight lower bounds and loose upper bounds. We also compare our solution with another wireless VNE solution to show the trade-off between delay and symbol error rate.","PeriodicalId":197152,"journal":{"name":"2019 12th IFIP Wireless and Mobile Networking Conference (WMNC)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129031992","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":"Intelligence Slicing: A Unified Framework to Integrate Artificial Intelligence into 5G Networks","authors":"Wei Jiang, S. D. Antón, H. Schotten","doi":"10.23919/WMNC.2019.8881402","DOIUrl":"https://doi.org/10.23919/WMNC.2019.8881402","url":null,"abstract":"The fifth-generation and beyond mobile networks should support extremely high and diversified requirements from a wide variety of emerging applications. It is envisioned that more advanced radio transmission, resource allocation, and networking techniques are required to be developed. Fulfilling these tasks is challenging since network infrastructure becomes increasingly complicated and heterogeneous. One promising solution is to leverage the great potential of Artificial Intelligence (AI) technology, which has been explored to provide solutions ranging from channel prediction to autonomous network management, as well as network security. As of today, however, the state of the art of integrating AI into wireless networks is mainly limited to use a dedicated AI algorithm to tackle a specific problem. A unified framework that can make full use of AI capability to solve a wide variety of network problems is still an open issue. Hence, this paper will present the concept of intelligence slicing where an AI module is instantiated and deployed on demand. Intelligence slices are applied to conduct different intelligent tasks with the flexibility of accommodating arbitrary AI algorithms. Two example slices, i.e., neural network based channel prediction and anomaly detection based industrial network security, are illustrated to demonstrate this framework.","PeriodicalId":197152,"journal":{"name":"2019 12th IFIP Wireless and Mobile Networking Conference (WMNC)","volume":"21 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126449624","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}