Christos Tsiaras, Livio Hobi, Fabian Hofstetter, S. Liniger, B. Stiller
{"title":"parkITsmart: Minimization of Cruising for Parking","authors":"Christos Tsiaras, Livio Hobi, Fabian Hofstetter, S. Liniger, B. Stiller","doi":"10.1109/ICCCN.2015.7288448","DOIUrl":"https://doi.org/10.1109/ICCCN.2015.7288448","url":null,"abstract":"Finding a parking space in urban areas is a daily challenge for drivers across the world, due to the increasing amount of vehicles and the limited amount of parking spaces. Drivers who are looking for a parking space in peak hours are often forced to drive around city blocks until they spot a free parking space. This process is termed in literature \"cruising for parking\" and is proven to (a) cost a lot of time and gas for drivers, (b) generate unnecessary traffic load, and (c) affect the environment negatively due to increased vehicle emissions. This work proposes a Parking Monitoring and Management System (PMMS) that collects, processes, and presents data about available parking spaces and their tariffs within a geographical region. The end-user application of the PMMS, parkITsmart, delivers at drivers bird's-eye view concerning the parking availability. To facilitate this, the PMMS gathers data from drivers', vehicles, their mobile phones, and Parking Inspectors (PIs). This work shows that in the Internet-of-Things (IoT) environment, \"pairing\" cars and drivers' mobile phones, collecting data from their sensors, and from PIs in a parking monitoring and management system, can decrease significantly cruising times for parking and can increase the time demands of the parking controlling process.","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115885609","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 Framework for Security-Aware Virtual Network Embedding","authors":"Yang Wang, Phanvu Chau, Fuyu Chen","doi":"10.1109/ICCCN.2015.7288361","DOIUrl":"https://doi.org/10.1109/ICCCN.2015.7288361","url":null,"abstract":"Network virtualization promises a future Internet that inherently supports technological advancement. Extensive literature studies have been devoted to the fundamental problem, namely Virtual Network Embedding (VNE) in network virtualization, which instantiates the virtual network request (VNR) customized by the Service Provider (SP) to the substrate network managed by the Infrastructure Provider (InP). Different from prior studies, in this work, we identify security issues that are associated with the VNE process, which is further incorporated and addressed in the Security-Aware Virtual Network Embedding (SVNE) problem. Our efforts aim to fill the major gaps in the literature studies on the VNE problem: first, we assess the security issues in VNE at node, topology and network levels and explicitly define open, flexible and fine-granular security plans that can address above issues; second, we present and evaluate a comprehensive framework that implements the proposed security plans and address the SVNE problem.","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115741536","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":"Investigating Security and Privacy of a Cloud-Based Wireless IP Camera: NetCam","authors":"Ali Tekeoglu, A. Tosun","doi":"10.1109/ICCCN.2015.7288421","DOIUrl":"https://doi.org/10.1109/ICCCN.2015.7288421","url":null,"abstract":"Over the last few years, there has been a significant increase in the number of IP cameras used in various places including markets, malls, pharmacies, movie theatres and schools. Recent products on the market are cloud-based and upload the captured video to a cloud server. With widespread use, security of these IP cameras emerges as an important issue. However, there is still very little work done on the security of these devices. In this paper, we investigate security of cloud-based wireless IP cameras. Security of these devices spans multiple research areas including secure multimedia, network security and cloud security. We have investigated the traffic generated by a low-end, easy-to-setup, off-the-shelf wireless IP camera for average home user. We explored the security precautions taken by the manufacturers of IP cameras and evaluated the access control mechanisms in place. We used a variety of open source and non-commercial tools in our investigation. We identified many security and privacy issues in using these devices ranging from minor to severe issues.We showed that if a malicious person can sniff the IP camera's network traffic anywhere in between the mobile device-cloud servers-IP camera path, he would be able to reconstruct the JPEG images, which is a serious a privacy issue.","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"294 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132269566","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":"Throughput and Delay Scaling of Cognitive Radio Networks with Heterogeneous Mobile Users","authors":"Pengyuan Du, M. Gerla, Xinbing Wang","doi":"10.1109/ICCCN.2015.7288474","DOIUrl":"https://doi.org/10.1109/ICCCN.2015.7288474","url":null,"abstract":"We study the throughput and delay scaling laws of cognitive radio networks (CRN) with mobile primary and secondary users. They operate at the same time, space and share the spectrum. The primary users (PUs) have higher priority to access the spectrum while the secondary users (SUs) should access opportunistically. Furthermore, we consider a unique situation where both PUs and SUs move according to a General Heterogeneous Speed-restricted Mobility (GHSM) model. In this model, we define (h + 1) heterogeneous moving patterns using a universal set T ={T<sub>i</sub>|0 ≥ i ≤ h, A<sub>i</sub> = n<sup>-i</sup> χ<sub>0</sub>/h}, where A<sub>i</sub> determines the moving area of each pattern. The set of primary (secondary) moving patterns T<sup>(p)</sup> (T<sup>(s)</sup>) is a randomly and independently selected subset of T. We assign n (n<sup>β</sup>, where β > 1) primary (secondary) nodes to each moving pattern, and their initial positions are subject to a poisson point process. In addition, we have |T<sup>(p)</sup>|~|T<sup>(s)</sup>| = Θ<sup>1</sup>(h) = Θ(log n). By proposing a cooperative routing strategy, we fully utilize the mobility heterogeneity of primary and secondary users and achieve near-optimal throughput and delay performance of order Θ(poly log n) when χ<sub>0</sub> ≥ β. In other cases, our transmission scheme shows advantages over [1] in delay performance of the primary network (PN) and over [2] in capacity of the secondary network (SN).","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134564833","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. Huq, K. P. Moreno, Hui Zhu, Jue Zhang, Oscar Ohlsson, M. I. Hossain
{"title":"On the Benefits of Clustered Capillary Networks for Congestion Control in Machine Type Communications over LTE","authors":"R. Huq, K. P. Moreno, Hui Zhu, Jue Zhang, Oscar Ohlsson, M. I. Hossain","doi":"10.1109/ICCCN.2015.7288439","DOIUrl":"https://doi.org/10.1109/ICCCN.2015.7288439","url":null,"abstract":"One of the significant complexities that Machine Type Communications (MTC) is expected to bring about is congestion. One promising conceptual approach in the literature to reduce congestion is clustering or grouping based solutions. Designing group based solutions highly depend on particular cases and it is challenging to come up with a universal solution. This paper is based on a project designed to address a grouping based congestion control technique in a specific MTC application scenario using the Capillary Networks approach from an experimental point of view. In this paper, an MTC congestion scene is generated inside a network-simulation environment in a defined \"parking lot scenario\" during a busy hour, where a huge number of cars and parking space sensors will try to connect to an LTE node in a congestive fashion. Based on the impact of this congestion on the node, the simulation results were analyzed to come up with a reasonable cluster size, a comparison of technologies to communicate within a group, and the benefits and tradeoffs due to clustering and Capillary Network based solutions.","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"239 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131789200","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":"Energy Efficient Phone-to-Phone Communication Based on WiFi Hotspot in PSN","authors":"E. Wang, Yongjian Yang, Jie Wu","doi":"10.1109/ICCCN.2015.7288405","DOIUrl":"https://doi.org/10.1109/ICCCN.2015.7288405","url":null,"abstract":"Pocket Switched Networks (PSN) utilize both human mobility and occasional connectivity to transfer messages between mobile humans' devices. Recently, a large number of mobile phones have come into our daily lives. Therefore, the PSN composed of human-carried mobile phones will be an ubiquitous network environment in the near future. In this paper, it is proposed that the WiFi hotspot mode of a mobile phone is applied in the PSN, in order to realize the phone-to-phone communications. However, due to the lack of energy supply, a phone in hotspot mode could rapidly consume energy and shorten its battery lifetime significantly. To maximize the message dissemination scope within the limited energy constraint of each phone in PSN, an Energy efficient Phone-to-phone Communication method based on WiFi Hotspot (EPCWH) is presented to schedule the phone's switch between hotspot mode and client mode. Simulations based on the synthetic random-waypoint mobility pattern are conducted in ONE; the results show that EPCWH achieves the best performance in terms of message dissemination and energy consumption among different switch strategies.","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131874629","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":"Adaptive Forward Error Correction for ECG Signal Transmission for Emotional Stress Assessment","authors":"Hansong Xu, Kun Hua, Guang-Chong Zhu, Jun Huang","doi":"10.1109/ICCCN.2015.7288370","DOIUrl":"https://doi.org/10.1109/ICCCN.2015.7288370","url":null,"abstract":"In this work, we try to collect useful emotional stress information from electrocardiogram (ECG) signals via a real-time wearable Wireless Body Area Network (WBAN). Discrete Wavelet Transform (DWT) is applied on collected ECG signals for feature extraction, which carries important information for stress level identification. After the stress level is classified using K-Nearest Neighboring (KNN), adaptive convolutional coding is considered for ECG signal protection during transmission according to their various stress levels, which is able to provide an acceptable low Bit Error Rate (BER) and efficient energy consumption at the same time.","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129059472","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}
F. Eichhorn, W. Dargie, Christoph Möbius, K. Rybina
{"title":"HAECubie: A Highly Adaptive and Energy-Efficient Computing Demonstrator","authors":"F. Eichhorn, W. Dargie, Christoph Möbius, K. Rybina","doi":"10.1109/ICCCN.2015.7288415","DOIUrl":"https://doi.org/10.1109/ICCCN.2015.7288415","url":null,"abstract":"The amount of data that are computed, stored, and shared over the Internet is rising at an unprecedented scale. This has necessitated more servers to be deployed and drastic improvement in the capacity of individual servers. However, several independent studies also reveal that resources are not optimally utilised in most existing data centres and server clusters. Since the introduction of server virtualization and cloud computing, the research community has proposed several workload aggregation and dynamic consolidation techniques, however, most of these techniques are either theoretical and rely on simulation environments or use real servers but static workloads or benchmarks. In reality, the workload of data centres fluctuates as a function of time and servers frequently experience both overloading and underutilised conditions. In this paper we introduce the HAECubie demonstrator we developed and deployed to experimentally evaluate the scope and usefulness of dynamic workload consolidation in a server cluster and to quantitatively analyse the relationship between energy/power consumption and the utility (performance) that can be achieved through workload consolidation. Our demonstrator is a video hosting platform and enables Internet users to stream videos of variable length. The number of users accessing the HAECubie as well as the duration of videos they stream are modelled as stochastic processes based on realistic estimation of the workload of existing video hosting platforms.","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130694220","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":"Combo-Pre: A Combination Link Prediction Method in Opportunistic Networks","authors":"Yin Li, Sanfeng Zhang","doi":"10.1109/ICCCN.2015.7288386","DOIUrl":"https://doi.org/10.1109/ICCCN.2015.7288386","url":null,"abstract":"Opportunistic networks have emerged as prospective network architecture for smart mobile devices related applications. The main obstacle for designing routing protocol in opportunistic networks is their inherent dynamic nature. Unknown future link patterns lead to blind and inefficient packet forwarding behavior. Lots of efforts have focused on the future link prediction problem, but contact patterns among node pairs are too different to be predicted by one single method. To this end, we propose a combination link prediction method for opportunistic network routing named Combo-Pre. Combo-Pre applies periodic pattern mining methods to predict frequent and periodic contacts, decision tree method to predict frequent but non-periodic contacts and Adamic-Adar methods in complex networks to predict infrequent contacts. Experimental results show that Combo-Pre outperforms state-of-the-art link prediction methods in opportunistic networks. These results can be applied in routing protocol design to decrease routing cost and promote delivery rate.","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"357 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132943023","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 Implementation of MPC-KSA Side-Channel Distinguisher","authors":"Chao Zheng, Yongbin Zhou, Yingxian Zheng","doi":"10.1109/ICCCN.2015.7288360","DOIUrl":"https://doi.org/10.1109/ICCCN.2015.7288360","url":null,"abstract":"MPC-KSA, a generic side-channel distinguisher based on Kolmogorov-Smirnov Test, turns out to be a promising alternative to its original counterpart MIA. However, current implementations of MPC-KSA are undesirably slow in practice. In light of this, we present a fast implementation for MPC-KSA distinguisher. The main idea of the proposed method is based on an essential observation that one of the two samples used in Kolmogorov-Smirnov Test for MPC-KSA is always a true subset of the other. Using this inherent relationship between these two leakage samples, we reduce sorting times and accelerate the counting operations in Kolmogorov-Smirnov Test. In this way, the time complexity of Kolmogorov-Smirnov Test for MPC-KSA is reduced from O(n^2) to O(n), and that of MPC-KSA is reduced from O(n^2) to O(n log n). Besides this, we present another optimization technique that further improves the performance of MPC-KSA. In order to verify the efficiency of the proposed method, we have performed MPC-KSA against real power traces published in DPA Contest V2. The result shows that an attack against 15,000 traces takes only 3.4 ms per trace by our optimized method while 85.5 ms per trace by the naive method.","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115816257","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}