{"title":"Optimization of BLE Beacon Density for RSSI-Based Indoor Localization","authors":"S. Sadowski, P. Spachos","doi":"10.1109/ICCW.2019.8756989","DOIUrl":"https://doi.org/10.1109/ICCW.2019.8756989","url":null,"abstract":"Location Based Services (LBS) and Proximity Based Services (PBS) can play an important role in our daily life by simplifying tasks. Functions such as turning on and off lights can occur automatically or locking and unlocking doors can be done using LBS. By knowing the location of a user, appliances can be automated to function once the user is near them. Through the use of indoor localization, a user's position can be calculated. When designing an indoor localization system the density of transmitters plays an important role in maximizing the accuracy obtained. Increasing the number of references can improve the accuracy by providing additional information that the system can use in calculating a location. However, placing too many transmitters in the area can create interference in signals and negatively impact the localization results, while not having enough transmitters will hinder localization as not enough information is available. In this paper, we examine the optimal number of Bluetooth Low Energy (BLE) beacons to be used for indoor localization to optimize localization accuracy. Two algorithms were compared: trilateration and nonlinear least squares applying two types of filtering: moving average, and Kalman. Nine different types of systems were developed and compared in terms of accuracy and precision. According to experimental results placing six beacons in an environment will produce the optimal results. Using a nonlinear least squares algorithm with the three closest references with a moving average filter produced the lowest error of 1.149 meters with a standard deviation of 0.698 meters.","PeriodicalId":426086,"journal":{"name":"2019 IEEE International Conference on Communications Workshops (ICC Workshops)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116927079","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}
Sina Fathi Kazerooni, Yagiz Kaymak, R. Rojas-Cessa
{"title":"Identification of User Application by an External Eavesdropper using Machine Learning Analysis on Network Traffic","authors":"Sina Fathi Kazerooni, Yagiz Kaymak, R. Rojas-Cessa","doi":"10.1109/ICCW.2019.8756709","DOIUrl":"https://doi.org/10.1109/ICCW.2019.8756709","url":null,"abstract":"An eavesdropper may infer the computer applications a person uses by collecting and analyzing the network traffic they generate. Such inference may be performed despite applying encryption on the generated packets. In this paper, we investigate the extent of the ability of several machine learning algorithms to perform this privacy breach on the network traffic generated by a user. We measure their accuracy in identifying different applications by analyzing several statistical properties of the generated traffic rather than looking into the encrypted content. We compare the performance of these algorithms and select the one with higher precision; random forest. We also evaluate the application of packet padding to modify the packet length to avoid identification by machine learning algorithms. We test the effect of packet padding on the identification ability of the various machine-learning algorithms. We investigate the performance of the random forest algorithm in detail when applied to intact and padded traffic. We show that padding may decrease the efficacy of a machine-learning algorithm when used for application classification.","PeriodicalId":426086,"journal":{"name":"2019 IEEE International Conference on Communications Workshops (ICC Workshops)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129121617","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}
Rui Dong, Changyang She, Wibowo Hardjawana, Yonghui Li, B. Vucetic
{"title":"Improving Energy Efficiency of Ultra-Reliable Low-Latency and Delay Tolerant Services in Mobile Edge Computing Systems","authors":"Rui Dong, Changyang She, Wibowo Hardjawana, Yonghui Li, B. Vucetic","doi":"10.1109/ICCW.2019.8757134","DOIUrl":"https://doi.org/10.1109/ICCW.2019.8757134","url":null,"abstract":"In the 5th generation communication systems, ultra-reliable low-latency communications (URLLC) will co-exist with delay tolerant services. Meanwhile, improving energy efficiency (EE) of mobile devices is an urgent task for prolonging battery lifetime. In this work, we study how to improve EE of mobile users with URLLC and delay tolerant services in a mobile edge computing (MEC) system. The normalized energy consumption, defined as the ratio of average power to the average data rate, is minimized by optimizing bandwidth allocation and offloading probabilities subject to the QoS requirements of both kinds of services. For URLLC services, the decoding error probability in the uplink transmission and the processing delay violation probability in the MEC server are considered. For delay tolerant services, the queues in both communication and computing systems should be stable. Although the problem is non-convex, we propose an algorithm to find the global optimal solution with low-complexity. Simulation results show that the optimal solution can achieve remarkable EE gain compared with baselines.","PeriodicalId":426086,"journal":{"name":"2019 IEEE International Conference on Communications Workshops (ICC Workshops)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129903312","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}
Jianhua Hao, Yan Shi, Hongguang Sun, Min Sheng, Jiandong Li
{"title":"Rerouting Based Congestion Control in Data Center Networks","authors":"Jianhua Hao, Yan Shi, Hongguang Sun, Min Sheng, Jiandong Li","doi":"10.1109/ICCW.2019.8757147","DOIUrl":"https://doi.org/10.1109/ICCW.2019.8757147","url":null,"abstract":"Data center networks (DCNs) are widely deployed to provide infrastructure backbone for various cloud services. Meanwhile, the emergence of Software-Defined Networking (SDN) makes it easy to monitor the global status of DCNs. In DCNs, traffic bursts or uneven traffic distribution may lead to network congestion, thus deteriorating the overall network performance. Rerouting is an effective method to mitigate network congestion by rerouting flows to paths with sufficient bandwidth. In this paper, we propose an efficient rerouting algorithm by leveraging the SDN technique. We firstly formulate the rerouting problem as a Multi-Commodity Flow (MCF) problem with the objective to minimize the maximum link utilization in the DCN. Since the problem is a NP-hard problem, we propose a heuristic algorithm that jointly considers the current path utilization and the path criticality to approach the optimal solution. Our simulation results demonstrate the superiority of the proposed algorithm in mitigating the network congestion and guaranteeing the performance of the network, over the classical Equal-Cost Multi-Path (ECMP) algorithm and Global First Fit (GFF) algorithm.","PeriodicalId":426086,"journal":{"name":"2019 IEEE International Conference on Communications Workshops (ICC Workshops)","volume":"250 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116250526","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}
Shriya Kaneriya, J. Vora, S. Tanwar, Sudhanshu Tyagi
{"title":"Standardising the use of Duplex Channels in 5G-WiFi Networking for Ambient Assisted Living","authors":"Shriya Kaneriya, J. Vora, S. Tanwar, Sudhanshu Tyagi","doi":"10.1109/ICCW.2019.8757145","DOIUrl":"https://doi.org/10.1109/ICCW.2019.8757145","url":null,"abstract":"The sphere of ambient assisted living(AAL) is introduced to simplify and automate processes that do not require human intervention. One such case involves patient monitoring. Continual human involvement in monitoring is not only expensive, but also leads to the wastage of human hours, that could be utilised elsewhere. AAL simplifies the process by providing a round-the-clock assessment of a patient through wireless sensor networks. We explore the possibility of full duplex 5G communications for monitoring systems in this paper. By isolating communicating nodes in a sensor network with corresponding server nodes, we propose a system for full duplex conveyance. We analyze the proffered system for delay and accurate packet delivery for the scenarios of static and mobile patients.","PeriodicalId":426086,"journal":{"name":"2019 IEEE International Conference on Communications Workshops (ICC Workshops)","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125214142","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}
Qiang Liu, Gang Chuai, Jingrong Wang, Jianping Pan, Weidong Gao, Xuewen Liu
{"title":"Proactive Mobility Management Based on Virtual Cells in SDN-Enabled Ultra-Dense Networks","authors":"Qiang Liu, Gang Chuai, Jingrong Wang, Jianping Pan, Weidong Gao, Xuewen Liu","doi":"10.1109/ICCW.2019.8756741","DOIUrl":"https://doi.org/10.1109/ICCW.2019.8756741","url":null,"abstract":"Ultra-dense networking (UDN) is a promising technology to improve the network capacity in the next-generation mobile communication system. However, it brings in some new challenges to mobility management due to the frequent handovers and heavy signaling overhead. The problem becomes severe for vehicles owing to their fast moving speed, making it more sensitive to the handover delay with reactive handover decision. In this paper, driven by a real-world vehicle mobility dataset, we propose a proactive mobility management solution based on the virtual cell technique for vehicles. Assisted by a trajectory prediction framework based on the long short-term memory neural network, four function modules are designed in the centralized Software-Defined Networking controller to support the proactive solution. The corresponding signaling procedure is then carefully designed, working with virtual cells to reduce the signaling cost. The prediction framework can achieve satisfactory performance of predicting the next location. The proposed proactive solution eliminates the handover delay and reduces the handover signaling cost by 35% compared with the reactive approach.","PeriodicalId":426086,"journal":{"name":"2019 IEEE International Conference on Communications Workshops (ICC Workshops)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121980059","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}
S. Horsmanheimo, S. Lembo, L. Tuomimäki, Sami Huilla, P. Honkamaa, M. Laukkanen, Paul Kemppi
{"title":"Indoor Positioning Platform to Support 5G Location Based Services","authors":"S. Horsmanheimo, S. Lembo, L. Tuomimäki, Sami Huilla, P. Honkamaa, M. Laukkanen, Paul Kemppi","doi":"10.1109/ICCW.2019.8757118","DOIUrl":"https://doi.org/10.1109/ICCW.2019.8757118","url":null,"abstract":"Positioning in general will play an important role in future 5G networks by enabling a vast amount of different location-based services and applications. To offer enriched end-user information and more efficient network performance, location information becomes increasingly more important especially indoors. Therefore, we have designed and implemented an indoor positioning platform to support the development of foreseen location based 5G network functionalities and services. This paper presents the overall system architecture, linkage to the 5G Test Network Finland, and initial trial results with different positioning methods.","PeriodicalId":426086,"journal":{"name":"2019 IEEE International Conference on Communications Workshops (ICC Workshops)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125688613","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}
A. Nagulu, Tingjun Chen, G. Zussman, H. Krishnaswamy
{"title":"A Single Antenna Full-Duplex Radio using a Non-Magnetic, CMOS Circulator with In-Built Isolation Tuning","authors":"A. Nagulu, Tingjun Chen, G. Zussman, H. Krishnaswamy","doi":"10.1109/ICCW.2019.8756839","DOIUrl":"https://doi.org/10.1109/ICCW.2019.8756839","url":null,"abstract":"Wireless systems which can simultaneously transmit and receive (STAR) are gaining significant academic and commercial interest due to their wide range of applications such as full-duplex (FD) wireless communication and FMCW radar. FD radios, where the transmitter (TX) and the receiver (RX) operate simultaneously at the same frequency, can potentially double the data rate at the physical layer and can provide many other advantages in the higher layers. The antenna interface of an FD radio is typically built using a multi-antenna system, or a single antenna through a bulky magnetic circulator or a lossy reciprocal hybrid. However, recent advances in CMOS-integrated circulators through spatio-temporal conductivity modulation have shown promise and potential to replace traditional bulky magnetic circulators. However, unlike magnetic circulators, CMOS-integrated non-magnetic circulators will introduce some nonlinear distortion and spurious tones arising from their clock circuitry. In this work, we present an FD radio using a highly linear CMOS integrable circulator, a frequency-flat RF canceler, and a USRP software-defined radio (SDR). At TX power level of +15 dBm, the implemented FD radio achieves a self-interference cancellation (SIC) of +55 dB from the circulator and RF canceler in the RF domain, and an overall SIC of +95 dB together with SIC in the digital domain. To analyze the non-linear phenomena of the CMOS circulator, we calculated the link level data-rate gain in an FD system with imperfect SIC and then extended this calculation to count the effect of TX-RX non-linearity of the circulator. In addition, we provide a qualitative discussion on the spurious tone responses of the circulator due to the clocking imperfections and non-linearity.","PeriodicalId":426086,"journal":{"name":"2019 IEEE International Conference on Communications Workshops (ICC Workshops)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126558158","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":"Age-Based Path Planning and Data Acquisition in UAV-Assisted IoT Networks","authors":"Zekun Jia, Xiaoqi Qin, Zijing Wang, Baoling Liu","doi":"10.1109/ICCW.2019.8756751","DOIUrl":"https://doi.org/10.1109/ICCW.2019.8756751","url":null,"abstract":"To support emerging networked monitoring and data analytics applications, timely delivery of fresh information is of critical importance for unmanned aerial vehicle (UAV) assisted data collection in Internet of Things (IoT) networks. Age of information (AoI) is proposed as a performance metric to measure the data freshness at destination since the sampling at data source. In this paper, we employ the concept of age to study a UAV path planning and data acquisition problem by jointly considering the data acquisition mode selection, energy consumption at each node, and age evolution of collected information. To solve the formulated problem, we propose a solution framework based on dynamic programming approach. Through simulation results, we show that the performance of our proposed solution is competitive when compared with traditional flight time-optimal strategy.","PeriodicalId":426086,"journal":{"name":"2019 IEEE International Conference on Communications Workshops (ICC Workshops)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133757690","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}
S. Danish, M. Lestas, Waqar Asif, H. K. Qureshi, M. Rajarajan
{"title":"A Lightweight Blockchain Based Two Factor Authentication Mechanism for LoRaWAN Join Procedure","authors":"S. Danish, M. Lestas, Waqar Asif, H. K. Qureshi, M. Rajarajan","doi":"10.1109/ICCW.2019.8756673","DOIUrl":"https://doi.org/10.1109/ICCW.2019.8756673","url":null,"abstract":"Recently, there has been increasing interest in employing blockchain in different applications, other than crypto-currencies. Blockchains allow a peer to peer distributed network where different nodes communicate with each other, in a trustless manner. Long Range Wide Area Network (LoRaWAN) is an Internet of Things (IoT) technology, which enables long range communication. Although LoRaWAN networks are secure, the LoRaWAN join procedure is susceptible to replay and jamming attacks. Moreover, trust between network server and LoRa end device is the basic foundation of LoRaWAN network however, the centralized nature of network servers raise trust issues between network operators and customers. To solve this problem, we propose a lightweight two factor authentication mechanism for LoRaWAN join procedure, based on blockchain technology. The proposed blockchain based framework provides an extra layer of security for LoRaWAN join procedure and build trust among LoRaWAN network components. The proposed framework is validated using the Ethereum blockchain. The results demonstrate that the proposed framework provides efficient system performance in terms of throughput and latency. The proposed blockchain architecture is a cost effective solution, which can be utilized in the LoRaWAN network with few network servers and LoRa end device, having no strict requirement of throughput and latency.","PeriodicalId":426086,"journal":{"name":"2019 IEEE International Conference on Communications Workshops (ICC Workshops)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126418164","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}