Qi Zhao, Muhao Chen, Pengyuan Du, Tuan Le, M. Gerla
{"title":"Towards Efficient Cellular Traffic Offloading via Dynamic MPTCP Path Configuration with SDN","authors":"Qi Zhao, Muhao Chen, Pengyuan Du, Tuan Le, M. Gerla","doi":"10.1109/ICCNC.2019.8685652","DOIUrl":"https://doi.org/10.1109/ICCNC.2019.8685652","url":null,"abstract":"Cellular networks are suffering from the fast increasing volume of mobile traffic data. Hence, cellular network providers are eager to seek various ways to offload the cellular traffic to WLAN, which can enhance the quality of experience for their customers. Multi-path TCP provides the ability to utilize multiple communication channels simultaneously to transmit data packets so that it can be adopted to serve cellular traffic offloading to pursue higher average throughput than traditional single path communication. However, the greedy nature of MPTCP scheduler can lead to even worse performance compared to single path, which finally makes cellular traffic offloading less efficient sometimes. Therefore, motivated by the lack of practical solutions for operators to properly configure the communication path, we design and implement a system that can dynamically determine and deploy optimal path selections for mobile users leveraging on software-defined networking. Our system has two novel components: i) a support vector machine regression model to predict the potential performance of MPTCP and ii) an SDN controller continuously monitors the network status and dynamically adjusts path configurations for every user on demand. The goal is to maximize the network bandwidth resources for the cellular traffic offloading through WiFi with minimum changes on the network infrastructure. We build a Mininet-WiFi-based testbed to perform evaluation experiments. Results reveal that our system achieves seamless network handover and increases the average throughput by 8% without introducing extra overhead.","PeriodicalId":161815,"journal":{"name":"2019 International Conference on Computing, Networking and Communications (ICNC)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122680156","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":"Topological Rate-Splitting Based Power Allocation Scheme in K-cell MISO Interference Channel with Imperfect CSIT","authors":"Xiuyu Du, Lihua Li, Zejian Li, Guangyan Lu","doi":"10.1109/ICCNC.2019.8685627","DOIUrl":"https://doi.org/10.1109/ICCNC.2019.8685627","url":null,"abstract":"To tackle inevitable effects of imperfect channel state information (CSI), an achievable scheme, known as rate-splitting (RS), has been proposed recently. Focusing on the general K-user multiple-input-single-output (MISO) interference channel (IC) with an arbitrary CSI at transmitter (CSIT) quality of each interfering link, the topological RS (TRS) scheme obtains the degrees-of-freedom (DoF) gain by a multilayer structure and transmitting multiple common messages to be decoded by some groups of users rather than all users. In this paper, we investigate TRS scheme from the point of view of sum rate. Specifically, we formulate a power allocation problem as an optimization problem to maximize the sum rate of all users with a sequence of successive interference cancelation (SIC) decoding order constraints. Then, we convert this problem into a difference of convex program (DCP), and approximate it by its first-order Taylor expansion around a feasible point. Numerical results demonstrate the performance gain of the proposed scheme.","PeriodicalId":161815,"journal":{"name":"2019 International Conference on Computing, Networking and Communications (ICNC)","volume":"143 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122865077","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":"Fragmented Data Routing Based on Exponentially Distributed Contacts in Delay Tolerant Networks","authors":"Tuan Le, Qi Zhao, M. Gerla","doi":"10.1109/ICCNC.2019.8685583","DOIUrl":"https://doi.org/10.1109/ICCNC.2019.8685583","url":null,"abstract":"Existing works in data forwarding in delay tolerant networks often simplify the data transmission during a contact between two network nodes. One common assumption is that once transmitted, messages will always successfully arrive at the encounter node in its entirety regardless of the contact duration. The other common assumption is that messages are unfragmented, and are successfully transmitted only if the contact duration is long enough. If the contact duration is too short, the transmission will not complete, and the message needs to be re-transmitted in its entirety in the next contact. While the first assumption is unrealistic, the second assumption makes the routing strategy inefficient for large data items in network environments where most contact durations are short. In this work, we eliminate the assumption of unfragmented data, and propose a single-copy fragmented data routing strategy (FDR) that performs well with short contact durations. FDR considers the exponential distribution of inter-contact time, contact duration time, and fragmented data sizes when making forwarding decisions. We show that under short contact durations and large message sizes, our scheme can achieve up to 37% higher delivery rate and 35% lower delay compared to other routing strategies.","PeriodicalId":161815,"journal":{"name":"2019 International Conference on Computing, Networking and Communications (ICNC)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124103916","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}
Josh McGiff, W. G. Hatcher, James H. Nguyen, Wei Yu, Erik Blasch, Chao Lu
{"title":"Towards Multimodal Learning for Android Malware Detection","authors":"Josh McGiff, W. G. Hatcher, James H. Nguyen, Wei Yu, Erik Blasch, Chao Lu","doi":"10.1109/ICCNC.2019.8685502","DOIUrl":"https://doi.org/10.1109/ICCNC.2019.8685502","url":null,"abstract":"As the worldwide adoption of smartphones nears complete saturation, the complexity and volume of mobile malware continue to progress, subverting what has become the largest set of targets with the most valuable rewards. At the same time, deep learning has become a powerful tool for data analysis and prediction, demonstrating significant efficacy in the detection of new and unforeseen malicious software through supervised learning. Despite these advances, the proper application of deep learning to malware detection could be further improved through additional data and model construction. In this work, we consider the detection of Android malware using static analysis techniques on multiple extractable data classes. Particularly, both Permission and Hardware Feature data are applied in various multimodal input scenarios and deep network shapes. Through experimental analysis, we demonstrate that the combination of both sets of data could improve overall performance, achieving as high as 94.5% classification accuracy. In addition, using only a limited grid search, we observe that the largest multimodal network requires the lowest time to train while achieving equivalent or greater accuracy compared with our other models.","PeriodicalId":161815,"journal":{"name":"2019 International Conference on Computing, Networking and Communications (ICNC)","volume":"32 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120904588","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":"Diffuse Scattering Models for mmWave V2X Communications in Urban Scenarios","authors":"B. Antonescu, Miead Tehrani Moayyed, S. Basagni","doi":"10.1109/ICCNC.2019.8685661","DOIUrl":"https://doi.org/10.1109/ICCNC.2019.8685661","url":null,"abstract":"This paper is concerned with the generation of accurate radio channel propagation models for mmWave transmissions for vehicle-to-everything (V2X) communications in urban scenarios. We emphasize the importance of capturing diffuse scattered rays for improved large-scale and small-scale radio channel propagation models. Our paper focuses on directive transmissions and compares various diffuse scattering models, arguing their advantage for the analysis of the mmWave radio links. The conclusions are that both received power levels and delay spread produce better estimates when the diffuse scatter models are enabled in the Wireless InSite ray-tracer that we use.","PeriodicalId":161815,"journal":{"name":"2019 International Conference on Computing, Networking and Communications (ICNC)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115909237","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":"Accelerated Prediction of Bradycardia in Preterm Infants Using Time-Frequency Analysis","authors":"Md Shaad Mahmud, Honggang Wang, Yong K Kim","doi":"10.1109/ICCNC.2019.8685546","DOIUrl":"https://doi.org/10.1109/ICCNC.2019.8685546","url":null,"abstract":"The rapid growth of the high-performance data processing algorithms and fusion of wearable technologies has enabled us to continuously monitor the health status of infants. However, monitoring preterm infants is still a challenge due to their frightfully tiny size and their undeveloped skin. In this paper, we have demonstrated a framework of complete monitoring of the preterm infants and real-time accelerated prediction of bradycardia. Real-time prediction of bradycardia episodes in the NICU has the potential to provide quality care to these neonates. In the proposed system we incorporated a multi-GPU gradient boosting algorithm that was able to outperform the traditional CPU’s performance. This can overcome the manually maintained progress reports by nurses, which is a major hurdle in the NICU. The system maps the workflow in a Java based responsive application to provide statistical information along with growth charts and reports. The system extracts data with a specific interval to feed the GPU based extreme gradient boosting model. The feature extraction was performed on the time and frequency domain of the heart rate of infants to predict an episode of bradycardia. With an average accuracy of 86% and shortest detection time when compared to the models of other similar products, the proposed system showed that it can improve care time, minimize the skill gap, analyze early disease perdition, and reduce preterm infant’s morbidity and mortality.","PeriodicalId":161815,"journal":{"name":"2019 International Conference on Computing, Networking and Communications (ICNC)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132517462","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}
I. Khalid, Syed Asad Ullah, S. Saleem, Syed Ali Hassan
{"title":"A Method of Moments Estimator for Modulation Index of Continuous Phase Modulation","authors":"I. Khalid, Syed Asad Ullah, S. Saleem, Syed Ali Hassan","doi":"10.1109/ICCNC.2019.8685657","DOIUrl":"https://doi.org/10.1109/ICCNC.2019.8685657","url":null,"abstract":"A novel non data-aided estimator based upon the method of moments is proposed for estimating the modulation index of continuous phase modulation (CPM) schemes. Analytical expressions are derived for the asymptotic (large data record N) mean and variance of the estimator using truncated Taylor series. It is shown that the estimator is asymptotically unbiased and has variance that depends upon the modulation index, which decreases as $O(N^{-1})$. Numerical simulations are performed to study the convergence of mean and variance of the estimator to their respective asymptotic values. The performance comparison establishes that the proposed estimator outperforms state-of-the-art estimators in the low signal-to-noise ratio regime.","PeriodicalId":161815,"journal":{"name":"2019 International Conference on Computing, Networking and Communications (ICNC)","volume":"260 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132618638","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":"Joint Precoder and Combiner Design for MMSE Distributed Beamforming with Per-Antenna Power Constraints","authors":"Riten Gupta, Han Yan, D. Cabric","doi":"10.1109/ICCNC.2019.8685511","DOIUrl":"https://doi.org/10.1109/ICCNC.2019.8685511","url":null,"abstract":"We consider minimum mean square error (MMSE) joint precoder and combiner design for single and multi carrier distributed beam forming systems with nonuniform perantenna transmit power constraints. We show that, similar to the maximum-gain problem, an iterative Gauss-Seidel algorithm can be used for minimizing MSE which alternately optimizes the transmitter and receiver coefficients. In a single carrier system the optimum transmit coefficients are obtained by a simple projection of the effective MISO channel. In the multicarrier case with a sum-MSE objective, the Gauss-Seidel approach is once again applicable, but the transmit coefficients must be found by solving a quadratically constrained quadratic problem for which we apply a dual gradient algorithm. A numerical example is presented which shows improvement of 0.7 dB in carrier signal-to-noise ratio (SNR) relative to a projected eigenvector method for a multicarrier DBF system with Rayleigh-faded multipath channels.","PeriodicalId":161815,"journal":{"name":"2019 International Conference on Computing, Networking and Communications (ICNC)","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131807002","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":"Spam DIS Attack Against Routing Protocol in the Internet of Things","authors":"Cong Pu","doi":"10.1109/ICCNC.2019.8685628","DOIUrl":"https://doi.org/10.1109/ICCNC.2019.8685628","url":null,"abstract":"A rapidly growing number of various sensors, objects and smart devices that are capable of communicating with each other without human intervention are leading the emergence of Internet-of-Things (IoT) and its applications. As a major building block of IoT, Low Power and Lossy Network (LLN) that consists of a set of resource-constrained nodes in terms of communication, computation, memory, and energy plays an essential role in the realization of ubiquitous computing and communication paradigm. In order to provide both efficient and reliable communication and enable the integration of resource-constrained nodes into the Internet, a novel routing protocol for LLNs, also referred to as RPL, has been proposed. However, LLNs running with RPL are vulnerable to various Denial-of-Service (DoS) attacks because of inherent resource constraints, the lack of tamper resistance and security features of routing protocol. In this paper, we present and investigate a new type of DoS attack, called spam DIS attack, in swiftly burgeoning RPL-based LLNs. In spam DIS attack, the malicious node multicasts a large number of DODAG Information Solicitation (DIS) messages with different fictitious identities to cause the legitimate nodes to restart the Trickle algorithm and broadcast an excessive number of DODAG Information Object (DIO) messages, which drain down the energy resource of legitimate nodes, and finally make the legitimate nodes suffer from denial of service. We conduct extensive simulation experiments for performance evaluation of spam DIS attack and comparison with original RPL without adversary. The simulation results indicate that the spam DIS attack is an extremely severe DoS attack in RPL-based LLNs.","PeriodicalId":161815,"journal":{"name":"2019 International Conference on Computing, Networking and Communications (ICNC)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132001300","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":"Network-based Classification of Authentication Attempts using Machine Learning","authors":"Curtis R. Taylor, Julian P. Lanson","doi":"10.1109/ICCNC.2019.8685482","DOIUrl":"https://doi.org/10.1109/ICCNC.2019.8685482","url":null,"abstract":"Network security operators are challenged with protecting an increasing number of clients from authentication-based attacks such as password guessing. Host-based defenses help in preventing such attacks but are difficult to manage and monitor at scale. These challenges open the door for network-based defenses. In this work, we introduce AuthML. AuthML performs protocol-agnostic authentication modeling to detect successful and unsuccessful authentication attempts at the network level. Using machine learning (ML), AuthML operates directly on network communication to determine the outcome of authentication attempts in real time. To show AuthML’s efficacy, we validate our approach on multiple deployment scenarios. AuthML achieves an accuracy of 99.9% examining 29,015 new flows in this operational phase, demonstrating that we can achieve similar performance in real time to state-of-the-art techniques without manual protocol analysis.","PeriodicalId":161815,"journal":{"name":"2019 International Conference on Computing, Networking and Communications (ICNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130978496","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}