{"title":"Dialogue between Satellite and Cellular Networks: Pricing Game for Data Offloading Assisted by Ultra-dense LEO Constellations","authors":"Ruoqi Deng, Boya Di, Lingyang Song","doi":"10.1145/3323679.3326622","DOIUrl":"https://doi.org/10.1145/3323679.3326622","url":null,"abstract":"Due to the limited backhaul capacity of traditional small cells (TSC), it is non-trivial for the traditional operator (TO) to satisfy the increasing data demand of users. To relieve this issue, we propose a data offloading scheme, where the TO offloads TSC users to LEO-based small cells owned by the satellite operator for satellite-backhauled network access. An iterative optimal algorithm based on the Stackelberg game is developed to maximize both operators' revenues. Simulation results show the effectiveness of our scheme.","PeriodicalId":205641,"journal":{"name":"Proceedings of the Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122314548","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 Fast Probing Detection Method using Hybrid Machine Learning Algorithms","authors":"Sung-Kwan Youm, Eui-Jik Kim","doi":"10.1145/3323679.3326615","DOIUrl":"https://doi.org/10.1145/3323679.3326615","url":null,"abstract":"Recently, a malicious user breaks into the network and destroys the entire network. This attack starts from probing. In this paper, we propose a fast probing detection technique for intrusion detection. In the past, probing detection was performed by analyzing all collected traffic characteristics and by supervised learning. In the proposed method, a normal traffic is classified through unsupervised learning and intrusion detection for probing attack is not performed for that traffic. The supervised learning is performed on traffic that may be abnormal. So, through the simulation, we verify that the proposed method can reduce times than the conventional method.","PeriodicalId":205641,"journal":{"name":"Proceedings of the Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128746297","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}
Ander Galisteo, Diego Juara, Héctor Cordobés, D. Giustiniano
{"title":"Video Transmission Using Low-Cost Visible Light Communication","authors":"Ander Galisteo, Diego Juara, Héctor Cordobés, D. Giustiniano","doi":"10.1145/3323679.3326617","DOIUrl":"https://doi.org/10.1145/3323679.3326617","url":null,"abstract":"In this paper we document the demo of the latest version of OpenVLC, a low-cost platform for communicating using Visible Light, and we prove we can transmit video with it. This paper shows the setup used, the behavior of each of its components, and the results expected. This is the first time video transmission has been possible with OpenVLC and to the best of our knowledge, the first time it has been done with low-cost components.","PeriodicalId":205641,"journal":{"name":"Proceedings of the Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"268 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124356698","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":"Collective Influence Maximization","authors":"Xudong Wu, Luoyi Fu, Keyi Wu, Bo Jiang, Xinbing Wang, Guihai Chen","doi":"10.1145/3323679.3326624","DOIUrl":"https://doi.org/10.1145/3323679.3326624","url":null,"abstract":"The omnipresence of cascading process in complex phenomena makes the identification of a small set of influential units, which is widely believed to trigger the outbreak, always an crucial issue in network science. Formulated as Influence maximization (IM) in 2003, this NP-hard problem has received a multitude of heuristic solutions with diverse angles. However, these methods are often unable to provide reliable solutions, due to the lack of an exact metric for evaluating units' contributions on cascading. In this paper, we address IM from optimal percolation and evaluate units based on the collective influence (CI), a novel metric on structural cohesive power that reflects the contributions of each unit's neighborhood on shaping collective dynamics of units over whole network. We reveal that, under probabilistic diffusion model, the structural influence power (CI value) of each node is a weighted cumulation of the diffusion probabilities from neighbors within certain hop. With the newly formulated metric CI, we propose a novel IM algorithm which chooses seeds with the largest CI values.","PeriodicalId":205641,"journal":{"name":"Proceedings of the Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130743328","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}
Hao Kong, Li Lu, Jiadi Yu, Yingying Chen, L. Kong, Minglu Li
{"title":"FingerPass","authors":"Hao Kong, Li Lu, Jiadi Yu, Yingying Chen, L. Kong, Minglu Li","doi":"10.1145/3323679.3326518","DOIUrl":"https://doi.org/10.1145/3323679.3326518","url":null,"abstract":"The development of smart homes has advanced the concept of user authentication to not only protecting user privacy but also facilitating personalized services to users. Along this direction, we propose to integrate user authentication with human-computer interactions between users and smart household appliances through widely-deployed WiFi infrastructures, which is non-intrusive and device-free. In this paper, we propose FingerPass which leverages channel state information (CSI) of surrounding WiFi signals to continuously authenticate users through finger gestures in smart homes. We investigate CSI of WiFi signals in depth and find CSI phase can be used to capture and distinguish the unique behavioral characteristics from different users. FingerPass separates the user authentication process into two stages, login and interaction, to achieve high authentication accuracy and low response latency simultaneously. In the login stage, we develop a deep learning-based approach to extract behavioral characteristics of finger gestures for highly accurate user identification. For the interaction stage, to provide continuous authentication in real time for satisfactory user experience, we design a verification mechanism with lightweight classifiers to continuously authenticate the user's identity during each interaction of finger gestures. Experiments in real environments show that FingerPass can achieve 91.4% authentication accuracy, and 186.6ms response time during interactions.","PeriodicalId":205641,"journal":{"name":"Proceedings of the Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121495100","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. Baranda, J. Mangues‐Bafalluy, L. Vettori, R. Martínez, G. Landi, Kiril Antevski
{"title":"Composing Services in 5G-TRANSFORMER","authors":"J. Baranda, J. Mangues‐Bafalluy, L. Vettori, R. Martínez, G. Landi, Kiril Antevski","doi":"10.1145/3323679.3326630","DOIUrl":"https://doi.org/10.1145/3323679.3326630","url":null,"abstract":"5G mobile networks need flexilibity, dynamicity and programmability to satisfy the needs of vertical industries. In such context, network services can be designed as integral units to be dynamically grouped among them to create tailored complex composite services or to allow the combination of services in a context of network slicing. In this demonstration, we present the service composition capabilities of the 5G-TRANSFORMER platform. In particular, we will show the instantiation of a composite network service using a previously instantiated service. When terminating the composite network service, the initial instantiated network service resumes its operation without disruption.","PeriodicalId":205641,"journal":{"name":"Proceedings of the Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125227681","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}
Alessandro Sangiorgi, Flavio Esposito, J. Gorlewicz, G. Schembra
{"title":"Propelling Haptic Devices into the Mobile World to Advance K-12 STEM Learning","authors":"Alessandro Sangiorgi, Flavio Esposito, J. Gorlewicz, G. Schembra","doi":"10.1145/3323679.3326620","DOIUrl":"https://doi.org/10.1145/3323679.3326620","url":null,"abstract":"In this demonstration we illustrate how haptic communication can occur via a mobile application. In particular, we present an Android-based platform that allows connectivity among haptic devices and smartphones. Our app was designed specifically for educational applications, and we used the Hapkit as our first exemplary hardware platform. Our open-source implementation offers several haptic emulations designed for K-12 Physics courses; furthermore, our Android application provides instrumented metrics capable of analyzing latency and other network parameters among communicating hardware and software processes.","PeriodicalId":205641,"journal":{"name":"Proceedings of the Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131850612","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":"APP","authors":"Siqian Yang, Cheng Wang, Hongzi Zhu, Changjun Jiang","doi":"10.2307/j.ctt20p57sd.6","DOIUrl":"https://doi.org/10.2307/j.ctt20p57sd.6","url":null,"abstract":"- The innovation in the mobile devices, wireless and web technologies gives rise to new application that make ERP system Simple and handy. M-ERP means performing college register functions by using portable electronic device i.e. Mobile. M-ERP application will combine all the business functions like Recording attendance, Student information, Clearance etc in a single system and database. M-ERP promises the possibility of convenient, easy and safe way to handle trade functions of college. This paper provides specifications and requirements for M-ERP application. We also described how the android mobile phones are able and can be used for ERP system.","PeriodicalId":205641,"journal":{"name":"Proceedings of the Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133864483","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":"Online Scheduling of Traffic Diversion and Cloud Scrubbing with Uncertainty in Current Inputs","authors":"Lei Jiao, Ruiting Zhou, Xiaojun Lin, Xu Chen","doi":"10.1145/3323679.3326525","DOIUrl":"https://doi.org/10.1145/3323679.3326525","url":null,"abstract":"Operating distributed Scrubbing Centers (SCs) to mitigate massive Distributed Denial of Service (DDoS) traffic in large-scale networks faces critical challenges. The operator needs to determine the diversion rule installation and elimination in the networks, as well as the scrubbing resource activation and revocation in the SCs, while minimizing the long-term cost and the cumulative decision-switching penalty without knowing the exact amount of the malicious traffic. We model and formulate this problem as an online nonlinear integer program. In contrast to many other online problems where future inputs are unknown but at least current inputs are known, a key new challenge here is that even part of the current inputs are unknown when decisions are made. To \"learn\" the best decisions online, we transform our problem via a gap-preserving approximation into an online optimization problem with only the known inputs, which is further relaxed and decoupled into a series of one-shot convex programs solvable in individual time slots. To overcome the intractability, we design a progressive rounding algorithm to convert fractional decisions into integral ones without violating the constraints. We characterize the competitive ratio of our approach as a function of the key parameters of our problem. We conduct evaluations using real-world data and confirm our algorithms' superiority over de facto practices and state-of-the-art methods.","PeriodicalId":205641,"journal":{"name":"Proceedings of the Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115341557","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}
Shaoran Li, Yan-ping Huang, Chengzhang Li, Brian Jalaian, Y. T. Hou, W. Lou
{"title":"Coping Uncertainty in Coexistence via Exploitation of Interference Threshold Violation","authors":"Shaoran Li, Yan-ping Huang, Chengzhang Li, Brian Jalaian, Y. T. Hou, W. Lou","doi":"10.1145/3323679.3326505","DOIUrl":"https://doi.org/10.1145/3323679.3326505","url":null,"abstract":"In underlay coexistence, secondary users (SUs) attempt to keep their interference to the primary users (PUs) under a threshold. Due to the absence of cooperation from the PUs, there exists much uncertainty at the SUs in terms of channel state information (CSI). An effective approach to cope such uncertainty is to introduce occasional interference threshold violation by the SUs, as long as such occasional violation can be tolerated by the PUs. This paper exploits this idea through a chance constrained programming (CCP) formulation, where the knowledge of uncertain CSI is limited to only the first and second order statistics rather than its complete distribution information. Our main contribution is the introduction of a novel and powerful technique, called Exact Conic Reformulation (ECR), to reformulate the intractable chance constraints. ECR guarantees an equivalent reformulation for linear chance constraints into deterministic conic constraints and does not suffer from the limitations associated with the state-of-the-art approach -- Bernstein Approximation. Simulation results confirm that ECR offers significant performance improvement over Bernstein Approximation in uncorrelated channels and a competitive solution in correlated channels (where Bernstein Approximation is no longer applicable).","PeriodicalId":205641,"journal":{"name":"Proceedings of the Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116586871","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}