{"title":"Private image computation: The case of cloud based privacy-preserving SIFT","authors":"Zhan Qin, Jingbo Yan, K. Ren","doi":"10.1109/INFCOMW.2014.6849214","DOIUrl":"https://doi.org/10.1109/INFCOMW.2014.6849214","url":null,"abstract":"In this paper, we present SecSIFT, a high-performance cloud based image feature detection system for performing Scalar Invariant Feature Transform (SIFT) over private image data without compromising the privacy. In contrast to previous works, we outsource the computation of image feature detection to a set of independent, co-operative cloud servers, and keep the outsourced computation procedures as simple as possible. Using this framework, we are not restricted by efficiency limitations of homomorphic encryption scheme and thus are able to implement applications such as social discovery or behavior prediction with less complexity on computation and communication.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"1 1","pages":"179-180"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88567777","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":"Smart spectrum access algorithms in mobile TV white space networks for utility maximization","authors":"Liang Zheng, C. Tan","doi":"10.1145/2645884.2651822","DOIUrl":"https://doi.org/10.1145/2645884.2651822","url":null,"abstract":"The demand for mobile computing services has grown significantly and rapidly in the last few years. This has led to a serious challenge on the quality of experience for mobile users. The wireless network consists of consumer devices that communicate simultaneously on a shared and severely-limited spectrum. In 2010, the Federal Communication Commission (FCC) has unleashed 500MHz of newly available broadcast TV Whitespace for opportunistic unlicensed use, i.e., the unlicensed secondary users are allowed to coexist and use the licensed spectrum. In fact, the mobile TV white space network is a wireless cognitive radio network, where the overall network utility is adversely affected not only by interference due to the broadcast nature of the wireless medium but also by the absence of the intelligence for spectrum opportunity. Thus, this new technology innovation requires an optimal resource allocation in a collaborative and smart manner. With uncontrolled resource allocation, secondary users may cause overwhelming interference to the primary users, and the network operating point can be highly unfair.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"7 1","pages":"175-176"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86200690","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":"Demonstration of a social aware wireless content delivery paradigm","authors":"Aris Leivadeas, C. Papagianni, S. Papavassiliou","doi":"10.1109/INFCOMW.2014.6849201","DOIUrl":"https://doi.org/10.1109/INFCOMW.2014.6849201","url":null,"abstract":"Cloud based Content Delivery Networks have emerged over the last years as a viable cost-effective alternative to traditional CDNs. In this work we demonstrate a novel surrogate server placement strategy for fostering content delivery within the evolving wireless Cloud environment by combining Social Network Analysis inspired metrics and virtual network embedding strategies. The proposed paradigm, in terms of its feasibility and operational efficiency, is validated over the OpenLab infrastructure that offers a realistic large-scale experimentation environment.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"31 1","pages":"153-154"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74578108","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":"Congestion-aware internet pricing for media streaming","authors":"Di Niu, Baochun Li","doi":"10.1109/INFCOMW.2014.6849294","DOIUrl":"https://doi.org/10.1109/INFCOMW.2014.6849294","url":null,"abstract":"Media webcasting and conferencing that involve many geographically distributed participants contribute significantly to congestion in the Internet. The current usage-based data pricing model does not take into account the hidden cost imposed by media streaming in the Internet core, including the network cost of replicating and relaying traffic in video multicast, and could potentially exacerbate congestion. In lieu of the recently emerged content sponsoring, in this paper, we present a simple congestion pricing model for ISPs (e.g. Comcast) to charge media streaming operators (e.g. Netflix) based on the bandwidth-delay product on each overlay link (either server-to-server or server-to-user) that the media streaming operator has chosen to use. The proposed pricing policy incentivizes different media streaming applications to collectively reduce their “waiting packets” in the Internet, alleviating congestion. We formulate the min-cost single and multiple multicast problems for the applications to construct their streaming overlays, based on a dense pool of CDN nodes. An efficient EM algorithm is given to solve the proposed geometric optimization problem and is evaluated through simulations.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"19 1","pages":"571-576"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75105750","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":"SMART-ER: Peer-based privacy for smart metering","authors":"Sören Finster, I. Baumgart","doi":"10.1109/INFCOMW.2014.6849308","DOIUrl":"https://doi.org/10.1109/INFCOMW.2014.6849308","url":null,"abstract":"Smart metering is an essential part of the future smart grid but causes privacy issues by collecting sensitive data from households with a high temporal resolution. Peer-based privacy mechanisms can solve this problem through privacy-aware aggregation. The SMART algorithm, originally proposed for wireless sensor networks, is a lightweight approach to this problem. In this paper, we propose to adapt the ideas of SMART for privacy-aware smart metering. However, our simulation results show, that accuracy suffers in the presence of communication errors especially in large networks. Therefore, we designed SMART-ER, an improved version of SMART. It utilizes dependency tracking and grouping to provide exact and robust smart metering even in the presence of communication errors. We show, that SMART-ER provides significantly more accurate results in typical churn scenarios.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"446 1","pages":"652-657"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76680773","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":"Decentralised binding of self-certifying names to real-world identities for assessment of third-party messages in fragmented mobile networks","authors":"J. Seedorf, D. Kutscher, Fabian Schneider","doi":"10.1109/INFCOMW.2014.6849268","DOIUrl":"https://doi.org/10.1109/INFCOMW.2014.6849268","url":null,"abstract":"Self-certifying names provide the property that any entity in a distributed system can verify the binding between a corresponding public key and the self-certifying name without relying on a trusted third party. However, self-certifying names lack a binding with a corresponding real-world identity. In this paper, we present a concrete mechanism for using a Web-of-Trust in conjunction with self-certifying names to provide this binding. We consider a decentralised scenario: fragmented (mobile) networks, where connectivity to centralized authentication entities and Web-of-Trust keyservers is not available. Our approach enables a particular functionality in this scenario: The assessment of messages from previously unknown third parties. To the best of our knowledge, there is no prior art for combining a Web-of-Trust approach with self-certifying names to enable such transitive third-party data origin authentication in decentralised networks. Our analytical evaluation shows that - depending on the overall size of the Web-of-Trust and the average friend-degree among its users - it is feasible to apply our approach fully decentralised at end user devices, or at least highly decentralised at access network nodes.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"64 1","pages":"416-421"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74069536","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 Compensated Cloud Assistance in mobile cloud computing","authors":"J. Champati, B. Liang","doi":"10.1109/INFCOMW.2014.6849264","DOIUrl":"https://doi.org/10.1109/INFCOMW.2014.6849264","url":null,"abstract":"We consider the scenario where a mobile device requires assistance from nearby devices to forward its computational tasks to a cloud server. We incentivize cooperation by allowing helper devices to conserve computational energy by offloading their own tasks to the source device's cloud, as compensation for the communication energy lost during task forwarding. We formulate an optimization problem with the objective of minimizing the cloud cost incurred by the source device due to tasks offloaded from helper devices, subject to no energy loss at the helper devices. We observe that this problem cannot be solved using a standard Lyapunov optimization approach. Instead, we construct an alternate problem that follows the standard form but has the same optimal objective value as the original problem. The resultant Energy Compensated Cloud Assistance (ECCA) algorithm does not require any statistics of the system and can be implemented distributively.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"33 1","pages":"392-397"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81018972","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":"Wireless resources virtualization in LTE systems","authors":"M. Kalil, A. Shami, Y. Ye","doi":"10.1109/INFCOMW.2014.6849259","DOIUrl":"https://doi.org/10.1109/INFCOMW.2014.6849259","url":null,"abstract":"This paper proposes a framework for Wireless Resource Virtualization (WRV) in Long Term Evolution (LTE) systems. An shared radio access network connects Multiple Mobile Network Operators (MNOs) and allocates radio resources to their users. We formulate the WRV problem as a Binary Integer Programming (BIP) problem. Subsequently, a low complexity iterative algorithm is presented to solve the BIP problem. The proposed framework allows MNOs to customize their scheduling policies to fit their service requirements and business models. Essential considerations like isolation across MNOs, complexity, and efficient resource utilization are also considered and evaluated. The results show that the proposed framework can efficiently share the radio resources between MNOs while maintaining the sharing agreement conditions.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"8 1","pages":"363-368"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84746211","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":"Live video streaming in IEEE 802.11p vehicular networks: Demonstration of an automotive surveillance application","authors":"E. Belyaev, A. Vinel, M. Jonsson, Katrin Sjöberg","doi":"10.1109/INFCOMW.2014.6849190","DOIUrl":"https://doi.org/10.1109/INFCOMW.2014.6849190","url":null,"abstract":"Prospective IEEE 802.11p-enabled automotive video applications are identified. Preliminary experimental results of inter-vehicular live video streaming for surveillance applications are presented. A test-bed for the demonstration of the achievable visual quality under different channel conditions is described.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"1 1","pages":"131-132"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80959531","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":"Defending sybil attacks in mobile social networks","authors":"Yan Sun, Lihua Yin, Wenmao Liu","doi":"10.1109/INFCOMW.2014.6849206","DOIUrl":"https://doi.org/10.1109/INFCOMW.2014.6849206","url":null,"abstract":"Mobile social networks (MSNs) are a kind of delay tolerant network that consists of lots of mobile nodes with social characteristics. Recently, many social-aware algorithms have been proposed to address routing problems in MSNs. However, it also brings more security and privacy concerns. In this paper, we discuss a specific type of Sybil attack in MSNs, which few researches has been focused on. We proposed a security mechanism to detect Sybil nodes and eliminate them to ensure the routing security while routing forwarding. It needs to cooperate by two sides, which is, respectively measuring distance in client side and eliminating Sybil nodes in server side. We also demonstrate the solution is correct and analyze its energy costs.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"4 1","pages":"163-164"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83498275","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}