{"title":"Adaptive Containerization for Microservices in Distributed Cloud Systems","authors":"N. Keni, A. Kak","doi":"10.1109/CCNC46108.2020.9045634","DOIUrl":"https://doi.org/10.1109/CCNC46108.2020.9045634","url":null,"abstract":"The traditional monolithic on-premises model of application deployment is fast being replaced by a cloud-based microservices paradigm, driven in part by the rise of numerous cloud infrastructure providers providing seamless access to a variety of computing hardware, and the need for applications to serve an ever-increasing audience necessitating scalability. While container-based virtualization has been the preferred method of microservice deployment, Cloud Consumers have not had much opportunity for cost and resource optimization thus far. To this end, this paper introduces a resource allocation framework for the containerized deployment of microservices, called Adaptive Containerization for Microservices in Distributed Cloud Systems, which helps reduce operating costs while ensuring a minimum guaranteed level of service. Further, a variety of performance evaluation metrics have been provided to reinforce the validity of the proposed framework.","PeriodicalId":443862,"journal":{"name":"2020 IEEE 17th Annual Consumer Communications & Networking Conference (CCNC)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115154192","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}
Debarun Das, J. Rose, T. Znati, Pedro J. Bustamante, M. Weiss, Marcela M. Gomez
{"title":"Spectrum Misuse Detection in Cooperative Wireless Networks","authors":"Debarun Das, J. Rose, T. Znati, Pedro J. Bustamante, M. Weiss, Marcela M. Gomez","doi":"10.1109/CCNC46108.2020.9045655","DOIUrl":"https://doi.org/10.1109/CCNC46108.2020.9045655","url":null,"abstract":"Cooperative wireless networks, enabled by Cognitive Radios, facilitate mobile users to dynamically share access to spectrum. However, spectrum bands can be accessed illegitimately by malicious users. Therefore, the success of dynamic spectrum sharing relies on automated enforcement of spectrum policies. While the focus has been on ex ante spectrum enforcement, this work explores new approaches to address efficient ex post spectrum enforcement. The main objective of this work is to ensure maximum coverage of the area of enforcement and accurate detection of spectrum access violation. The first objective is achieved with the help of Lloyd's algorithm to divide the enforcement area into a set of uniformly sized coverage regions. The interference detection accuracy is achieved through crowdsourcing of the spectrum access monitoring to volunteers, based on their computational capabilities, location attributes and reputation. A simulation framework was developed in CSIM19 (C++ version) to analyze the performance of the proposed system over the entire area of enforcement. The results show that the proposed scheme ensures efficient coverage of all the channels and regions in the area of enforcement and a high average accuracy of detection.","PeriodicalId":443862,"journal":{"name":"2020 IEEE 17th Annual Consumer Communications & Networking Conference (CCNC)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125357267","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":"Impact of Locality-awareness on Tit-for-Tat-based P2P File Distribution","authors":"Yohei Nishi, Masahiro Sasabe, S. Kasahara","doi":"10.1109/CCNC46108.2020.9045338","DOIUrl":"https://doi.org/10.1109/CCNC46108.2020.9045338","url":null,"abstract":"Periodic update of software is one of preventive measures against malicious attacks. When the software is used by many users, e.g., Operating System (OS), the distribution server for update tends to be a bottleneck. To tackle this problem, several systems, e.g., Windows update, recently apply Peer-to-Peer (P2P) file distribution where clients called peers upload retrieved fragments of the whole content, i.e., pieces, to other peers. However, some peers will not be willing to upload pieces to others, which are called free riders, due to communication overhead. Tit-for-Tat (TFT) strategy in game theory can alleviate such free riding behavior by encouraging equivalent exchange of pieces among each pair of peers. In recent years, the optimality of P2P file distribution under strict TFT constraint has been analyzed. In this paper, considering the fact that the communication overhead inside a group, e.g., LAN or AS, is much less than that between different groups, we consider the locality-aware TFT-based P2P file distribution where the TFT constraint is relaxed for intra-group communication. We find that the minimization of average file download time in the relaxed TFT-based P2P file distribution can also be modeled as Integer Linear Programming (ILP), as in the existing work. Through numerical results, we show that the relaxed TFT model contributes to shortening the average file download time among peers by about 18.3% compared with the strict TFT-based model.","PeriodicalId":443862,"journal":{"name":"2020 IEEE 17th Annual Consumer Communications & Networking Conference (CCNC)","volume":"136 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126917570","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}
R. Laborde, Arnaud Oglaza, A. Wazan, F. Barrère, A. Benzekri, D. Chadwick, Rémi Venant
{"title":"Know Your Customer: Opening a new bank account online using UAAF","authors":"R. Laborde, Arnaud Oglaza, A. Wazan, F. Barrère, A. Benzekri, D. Chadwick, Rémi Venant","doi":"10.1109/CCNC46108.2020.9045148","DOIUrl":"https://doi.org/10.1109/CCNC46108.2020.9045148","url":null,"abstract":"Universal Authentication and Authorization Framework is a user-centric, privacy by design and decentralized system that allows anyone to easily benefit from a reliable digital identity made of multi-purpose and multi-origin attributes. In this article, we present the implementation of this framework in the context of online banking. We demonstrate how it can facilitate enforcing Know Your Customer when opening a new bank account online by allowing users to combine verifiable identity attributes issued by different organizations.","PeriodicalId":443862,"journal":{"name":"2020 IEEE 17th Annual Consumer Communications & Networking Conference (CCNC)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127034789","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. Khan, Rashiduddin Kakar, M. Alam, Y. Moullec, H. Pervaiz
{"title":"A Green IoT Node Incorporating Transient Computing, Approximate Computing and Energy/Data Prediction","authors":"S. Khan, Rashiduddin Kakar, M. Alam, Y. Moullec, H. Pervaiz","doi":"10.1109/CCNC46108.2020.9045177","DOIUrl":"https://doi.org/10.1109/CCNC46108.2020.9045177","url":null,"abstract":"In an effort towards designing a batteryless Internet of Things (IoT) sensor node that is powered by miniaturized energy-harvesting source(s), we combine the techniques of transient computing, approximate computing, data and energy predictions so as to handle the unpredictable power shortages of the miniaturized energy harvesting sources and reduce the overall power consumption of the IoT node. To evaluate the feasibility of our proposed approach, we build upon and extend an existing platform that consists of a peer-to-peer network (a sender node and a receiver node) where each of these nodes combines a Texas Instruments' FRAM-based micro-controller with a low cost, low power radio module and exchanging its data through SimpliciTI protocol. Our results illustrate that combining transient computing, approximate computing, data and energy predictions adds up their individual benefits to achieve an overall better utilization of the harvested energy of the node. Our results show that out of the total 60 transmissions that were due in an interval of 5 hours, for sending the temperature data from sender node to the receiver node every 5 minutes, a total of 32 transmissions were avoided, leading to a saving of more than 50% of the radio transmissions in the sender node.","PeriodicalId":443862,"journal":{"name":"2020 IEEE 17th Annual Consumer Communications & Networking Conference (CCNC)","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122552470","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":"PoolCoin: Toward a distributed trust model for miners' reputation management in blockchain","authors":"Abdellah Kaci, A. Rachedi","doi":"10.1109/CCNC46108.2020.9045608","DOIUrl":"https://doi.org/10.1109/CCNC46108.2020.9045608","url":null,"abstract":"In blockchain, transactions between parties are regrouped into blocks, in order to be added to the blockchain's distributed ledger. Miners are nodes of the network that generate new blocks that meet the consensus protocol. Thus, when a miner adds a valid block to the distributed ledger, the miner is rewarded. Due to the difficulty of the problem to be solved by the miner in order to find a valid block, it becomes difficult to a single miner to gain rewards. Therefore, miners join mining pools, where the powers of miners are federated to ensure stable revenues for miners. In public blockchains, access to mining pools is not restricted, which makes mining pools vulnerable to considerable threats such as: block withholding (BWH) attacks and distributed denial of service (DDoS) attacks. In the present work, we a new blockchain named PoolCoin that manages reputation in mining pools. In addition, we provide a trust model for PoolCoin, inspired by the job market signaling model. The proposed PoolCoin blockchain allows pool managers to accept trusted miners in their mining pools, while miners are able to evaluate pool managers. The performance evaluation is conducted and the obtained simulation results are presented and discussed. In order to study the efficiency of the proposed trust model, a performance evaluation was provided. Thus, the model parameters' are optimized in order to detect and exclude misbehaving miners, while honest miners are maintained in the mining pool.","PeriodicalId":443862,"journal":{"name":"2020 IEEE 17th Annual Consumer Communications & Networking Conference (CCNC)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122692727","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":"Drone Detection via Low Complexity Zadoff-Chu Sequence Root Estimation","authors":"Chun Kin Au-Yeung, Brandon F. Lo, Scott Torborg","doi":"10.1109/CCNC46108.2020.9045243","DOIUrl":"https://doi.org/10.1109/CCNC46108.2020.9045243","url":null,"abstract":"The fast growth of drone applications in industrial, commercial and consumer domains in recent years has caused great security, safety and privacy concerns. For this reason, a demand for solutions of drone detection and monitoring in consumer market can be foreseen in the near future. For detecting drones that employ Zadoff-Chu (ZC) sequences for synchronization, these ZC sequences can be used to determine their presence in the air. However, it is a great challenge to blindly detect thousands of unknown ZC sequences possibly used by the drones in real time. Existing solutions mainly developed for LTE systems cannot be directly applied to the blind detection of ZCs in drones without incurring huge cost. In this paper, a low-complexity cost effective blind ZC detection method based on double differential is proposed for low-cost drone detection and monitoring systems. Signal-to-noise ratio (SNR) lower bounds are analytically derived for low and high SNR regimes. Monte Carlo simulations show the proposed scheme performs well in moderate and high SNR.","PeriodicalId":443862,"journal":{"name":"2020 IEEE 17th Annual Consumer Communications & Networking Conference (CCNC)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114487158","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}
M. Okano, Y. Hasegawa, Kenji Kanai, Bo Wei, J. Katto
{"title":"Field Experiments of 28 GHz Band 5G System at Indoor Train Station Platform","authors":"M. Okano, Y. Hasegawa, Kenji Kanai, Bo Wei, J. Katto","doi":"10.1109/CCNC46108.2020.9045247","DOIUrl":"https://doi.org/10.1109/CCNC46108.2020.9045247","url":null,"abstract":"Recently, a fifth-generation cellular system (5G) is widely expected to provide plenty of wireless network resources (i.e., broadband capacity). In this paper, to validate 5G system performances, such as physical-layer and TCP-layer throughputs, we carry out a field trial at an actual indoor train station, named Haneda International Airport Terminal Station. In the field trial, we deploy the prototype 5G system (Central Unit, Distribution Unit, Radio Unit and 5G UE (tablet)) on the train station platform and evaluate mobile 5G downlink throughputs. Through the actual measurements, the results confirm that the prototype 5G system can achieve mobile broadband capacity (more than 1 Gbps) even when the UE is located anywhere at the indoor train station platform.","PeriodicalId":443862,"journal":{"name":"2020 IEEE 17th Annual Consumer Communications & Networking Conference (CCNC)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128465100","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}
Giovanni Delnevo, Giacomo Mambelli, Vincenzo Rubano, Catia Prandi, S. Mirri
{"title":"Almawhere 2.0: a pervasive system to facilitate indoor wayfinding","authors":"Giovanni Delnevo, Giacomo Mambelli, Vincenzo Rubano, Catia Prandi, S. Mirri","doi":"10.1109/CCNC46108.2020.9045209","DOIUrl":"https://doi.org/10.1109/CCNC46108.2020.9045209","url":null,"abstract":"Indoor wayfinding systems are still presenting challenges and open issues in providing accurate directions while navigating complex and large buildings. When considering users who are experiencing any kind of vision loss, these issues can become really serious to tackle. To facilitate users (both visually impaired people and people without disabilities) in navigating an indoor environment, we designed and implemented a pervasive system taking advantage of the beacon technology and an accessible mobile application. In this paper, we present the system design issues and implementation challenges we addressed to provide user-friendly services in indoor contexts, exploiting the Proximity technique.","PeriodicalId":443862,"journal":{"name":"2020 IEEE 17th Annual Consumer Communications & Networking Conference (CCNC)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129126067","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":"Dependable Source Routing Scheme for Multi-Hop Networks Based on Receiver-Initiated MAC Protocol","authors":"Ryota Okumura, K. Mizutani, H. Harada","doi":"10.1109/CCNC46108.2020.9045557","DOIUrl":"https://doi.org/10.1109/CCNC46108.2020.9045557","url":null,"abstract":"In this paper, we propose a dependable source routing scheme for multi-hop networks based on the receiver-initiated media access control (MAC) protocol. In the proposed scheme, multiple candidates of relay terminals can be loaded in routing information, so the route is not specified uniquely. The following two effects are expected to the proposed scheme. The first is the improvement of communication reliability by avoiding disturbed link. Second is the improvement of the delay and current consumption by shortening the waiting time for communication timings. To show the effectiveness of the proposed scheme, we conduct computer simulations that suppose a multi-hop network based on the feathery receiver-initiated transmission (F-RIT) protocol in stable channel conditions. In the evaluation, the data are collected by polling communications, and the proposed scheme is applied to downlink communications. The results show the effectiveness of the proposed scheme that improves the delay by up to 41.3% and current consumption by up to 13.5% under a specific condition for the evaluation.","PeriodicalId":443862,"journal":{"name":"2020 IEEE 17th Annual Consumer Communications & Networking Conference (CCNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129619163","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}