{"title":"Ergodic capacity in D2D underlay networks with varying user distribution","authors":"Chang Liu, B. Natarajan","doi":"10.1109/CCNC.2016.7444800","DOIUrl":"https://doi.org/10.1109/CCNC.2016.7444800","url":null,"abstract":"This paper provides a tractable framework to understand the performance of Device-to-device (D2D) underlay cellular networks. D2D communication can improve range, data rates and energy efficiency of cellular networks. However, analyzing performance of D2D techniques is non-trivial. In this paper, ergodic capacity of D2D underlay cellular networks is investigated using Poisson point process (PPP) models. Line-of-sight (LoS) components in D2D direct links are characterized via a Rician fading model. In addition, locations of D2D receiving users (DRUs) are assumed to be random with varying distribution. Specifically, we investigate two different cases of DRUs: (1) distance between a D2D user (DU) pair follows a uniform distribution and (2) a DRU is distributed uniformly in the circular area around its serving D2D transmit user (DTU). We derive, for the first time, closed-form results for ergodic capacity of D2D communications for a practical case with path loss exponent of 4. We demonstrate that our new analytical results better approximate the actual capacity relative to prior approaches.","PeriodicalId":399247,"journal":{"name":"2016 13th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115296061","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":"Declarative, sliding window aggregations for computations at the edge","authors":"Christopher S. Meiklejohn, S. H. Haeri, P. V. Roy","doi":"10.1109/CCNC.2016.7444727","DOIUrl":"https://doi.org/10.1109/CCNC.2016.7444727","url":null,"abstract":"We present a work in progress report on a new programming model that supports declarative, functional style aggregation operations over devices at the edge. This programming model bridges the gap between the two competing approaches for large-scale aggregations, streaming all data back to a central coordinator versus designing an optimized, distributed algorithm, by leveraging convergent data structures, dynamic scoping, and a declarative functional semantics implemented by a distributed runtime. We motivate our design with an industrial application susceptible to message reordering and arbitrary message delays on an unreliable network.","PeriodicalId":399247,"journal":{"name":"2016 13th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":"174 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122927000","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":"On my way: Optimizing driving routes for navigation applications","authors":"Fengpeng Yuan, Xueyuan Song, J. Lindqvist","doi":"10.1109/CCNC.2016.7444726","DOIUrl":"https://doi.org/10.1109/CCNC.2016.7444726","url":null,"abstract":"Conventionally, the route recommendations given by GPS navigation applications have been considered as the optimal route search problem only between two locations - origin and destination [1]. Sometimes people want to visit several intermediate locations prior to reaching their final destination. For example, travelers may want to visit a diner and a gas station before arriving at their vacation destination. Although there is likely to be many choices that are available along the route to the destination, only one place from each type should be chosen. Furthermore, in new emerging application domains, such as “physical-world crowdsourcing” [2], people may want to opportunistically visit some places in order to complete personal or work related tasks. Our work explores a design space where we try to reduce the amount of requests made to third-party map and route data providers. We explore the simple idea of using the Euclidean distance as a rough estimate for the optimal route between destinations with multiple waypoints. Our preliminary results indicate that with over 80% of test cases, this simple Euclidean distance estimator approach gives at least one optimal routing alternative.","PeriodicalId":399247,"journal":{"name":"2016 13th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117101399","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}
V. Catania, Andrea Mineo, Salvatore Monteleone, M. Palesi, Davide Patti
{"title":"Improving the energy efficiency of wireless Network on Chip architectures through online selective buffers and receivers shutdown","authors":"V. Catania, Andrea Mineo, Salvatore Monteleone, M. Palesi, Davide Patti","doi":"10.1109/CCNC.2016.7444860","DOIUrl":"https://doi.org/10.1109/CCNC.2016.7444860","url":null,"abstract":"The wireless Network-on-Chip (WiNoC) design paradigm represents an emergent and viable solution for addressing the scalability limitations of future manycores architectures. Unfortunately, components such as the buffers and the transceiver of the radio-hubs in a WiNoC, account for a significant fraction of the total communication energy budget. In this paper, we present WIRXSleep, a mechanism aimed at improving the energy efficiency of radio-hubs in WiNoC architectures. WIRXSleep selectively and dynamically disables receiver modules and buffers of those radio-hubs that will be not involved in any communication during the next forthcoming clock cycles. Its application on different WiNoC topologies, with different configurations, and under different traffic scenarios has resulted interesting energy savings (up to 25%) without any impact on performance and with a negligible impact on cost metrics.","PeriodicalId":399247,"journal":{"name":"2016 13th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":"133 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128599328","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 new group Diffie-Hellman key generation proposal for secure VANET communications","authors":"M. Mejri, N. Achir, Mohamed Hamdi","doi":"10.1109/CCNC.2016.7444925","DOIUrl":"https://doi.org/10.1109/CCNC.2016.7444925","url":null,"abstract":"Vehicular Networks must be sufficiently secured against the wide variety of security challenges to which they are exposed. Cryptography provides tools to solve many of these security problems. In this paper, we address the secure group communications problem in VANETs. By generating a secret group key that can be used to encrypt or authenticate, the members of a VANET platoon can thus guarantee secure communication between them. To address this need, we propose a new secure variant of the Diffie-Hellman algorithm for groups that we fortified by a pre-shared secret to withstand the famous Man in the Middle attack. As necessary, our proposal can be used by several types of authentication and encryption VANET applications. We demonstrate the unforgeability and the privacy of our scheme and we study its secure-efficiency.","PeriodicalId":399247,"journal":{"name":"2016 13th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":"148-149 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130659846","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":"Innovative DTLS/TLS security modules embedded in SIM cards for IoT trusted and secure services","authors":"P. Urien","doi":"10.1109/CCNC.2016.7444778","DOIUrl":"https://doi.org/10.1109/CCNC.2016.7444778","url":null,"abstract":"This demonstration presents an innovative platform for IoT services managed by Mobile Network Operators (MNO), based on DTLS/TLS security modules, detailed by an IETF draft. It demonstrates a COAP/DTLS server lock, interacting with a COAP/DTLS client key running in a SIM module. The SIM module also comprises a TLS stack for securely downloading key from a dedicated server.","PeriodicalId":399247,"journal":{"name":"2016 13th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126522747","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":"Design and performance analysis of secure and dependable cybercars: A steer-by-wire case study","authors":"Arslan Munir, F. Koushanfar","doi":"10.1109/CCNC.2016.7444938","DOIUrl":"https://doi.org/10.1109/CCNC.2016.7444938","url":null,"abstract":"The next generation of automobiles (also known as cybercars) will increasingly incorporate electronic control units (ECUs) in novel automotive control applications. Recent work has demonstrated vulnerability of modern car control systems to security attacks that directly impact the cybercar's physical safety and dependability. In this paper, we provide an integrated approach for the design of secure and dependable cybercars using a case study: a steer-by-wire (SBW) application over controller area network (CAN). The challenge is to embed both security and dependability over CAN while ensuring that the real-time constraints of the cybercar applications are not violated. Our approach enables early design feasibility analysis by embedding essential security primitives (i.e., confidentiality, integrity, and authentication) over CAN subject to the real-time constraints imposed by the desired quality of service and behavioral reliability. Our method leverages multi-core ECUs for providing fault-tolerance by redundant multi-threading (RMT) and also further enhances RMT for quick error detection. We quantify the error resilience of our approach and evaluate the interplay of performance, fault-tolerance, security, and scalability for our SBW case study.","PeriodicalId":399247,"journal":{"name":"2016 13th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":"178 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132520929","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}
Jeongcheol Lee, Hoewon Kim, Euisin Lee, Sang-Ha Kim, M. Gerla
{"title":"Farthest destination selection and Shortest Path Connection strategy for efficient multicasting in Vehicular Ad Hoc Networks","authors":"Jeongcheol Lee, Hoewon Kim, Euisin Lee, Sang-Ha Kim, M. Gerla","doi":"10.1109/CCNC.2016.7444926","DOIUrl":"https://doi.org/10.1109/CCNC.2016.7444926","url":null,"abstract":"With technology advancement, Vehicular Ad Hoc Networks (VANETs) have been requested to provide one-to-many group communications (i.e. multicasting) for business and entertainment applications such as video conferences and file sharings. For these group communication applications, the existing broadcasting-based and unicasting-based approaches designed for safety applications however cause high packet generations and redundant data transmissions, respectively. Although the well-known Shortest Path Tree (SPT) and Minimum Spanning Tree (MST) algorithms for multicasting have been proposed, they achieve only a specific goal such as the reduction of delay or tree cost. Thus, for reducing end-to-end delay, delay variation, and transmission number requested for delay-sensitive and cost-efficient group communications and supporting high mobility of vehicles, this paper proposes a multicast protocol which uses the Farthest destination Selection and Shortest path Connection (FSSC) strategy to form a multicast tree. FSSC relies on the road map information and the location information of vehicles and intersections. Simulation results are provided to verify the effectiveness of FSSC.","PeriodicalId":399247,"journal":{"name":"2016 13th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132879156","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}
Nick Ruffing, Ye Zhu, Rudy Libertini, Y. Guan, R. Bettati
{"title":"Smartphone reconnaissance: Operating system identification","authors":"Nick Ruffing, Ye Zhu, Rudy Libertini, Y. Guan, R. Bettati","doi":"10.1109/CCNC.2016.7444941","DOIUrl":"https://doi.org/10.1109/CCNC.2016.7444941","url":null,"abstract":"Smartphone reconnaissance, the first step to launch security attacks to a target smartphone, enables an adversary to tailor attacks by exploiting known vulnerabilities of the target system. We investigate OS identification against smartphones that use encrypted traffic. A traffic content agnostic identification algorithm is proposed that is based on the spectral analysis of the encrypted traffic. The identification algorithm is designed for high identification accuracy by removing noise frequency components and for high efficiency in terms of computation complexity. We evaluate the identification algorithm against collected smartphone traffic. The experiment results show that the algorithm can identify the smartphone OS accurately. The identification accuracy can reach 100% with only 30 seconds of smartphone traffic.","PeriodicalId":399247,"journal":{"name":"2016 13th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123038196","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":"GeoSentiment: A tool for analyzing geographically distributed event-related sentiments","authors":"C. Pino, I. Kavasidis, C. Spampinato","doi":"10.1109/CCNC.2016.7444775","DOIUrl":"https://doi.org/10.1109/CCNC.2016.7444775","url":null,"abstract":"In this demo paper we present GeoSentiment, a tool for effective assessment and visualization of event-related sentiments in geographically confined populations. GeoSentiment is developed as a web tool application and provides to stakeholders an easy-to-use and powerful means to investigate how events are perceived by people and which factors may influence such perception. GeoSentiment relies on different services for a) retrieving and mining official statistical information as well as the most-common social networks and b) performing sentiment analysis. It is provided with an interactive interface, which enables rendering and deep exploration of all the processed data and results.","PeriodicalId":399247,"journal":{"name":"2016 13th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121670956","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}