Pub Date : 2014-07-08DOI: 10.1109/INFCOMW.2014.6849249
Bidi Ying, D. Makrakis
Location privacy is an important issue in location-based services. A large number of location cloaking algorithms have been proposed for protecting location privacy of users. However, these algorithms cannot be used in vehicular networks due to constrained vehicular mobility. In this paper, we propose a new method named Protecting Location Privacy with Clustering Anonymization (PLPCA) for location-based services in vehicular networks. This PLPCA algorithm starts with a road network transforming to an edge-cluster graph in order to conceal road information and traffic information, and then provides a cloaking algorithm based on A-anonymity and l-diversity as privacy metrics to further enclose a target vehicle's location. Simulation analysis shows our PLPCA has good performances like the strength of hiding of road information & traffic information.
{"title":"Protecting Location Privacy with Clustering Anonymization in vehicular networks","authors":"Bidi Ying, D. Makrakis","doi":"10.1109/INFCOMW.2014.6849249","DOIUrl":"https://doi.org/10.1109/INFCOMW.2014.6849249","url":null,"abstract":"Location privacy is an important issue in location-based services. A large number of location cloaking algorithms have been proposed for protecting location privacy of users. However, these algorithms cannot be used in vehicular networks due to constrained vehicular mobility. In this paper, we propose a new method named Protecting Location Privacy with Clustering Anonymization (PLPCA) for location-based services in vehicular networks. This PLPCA algorithm starts with a road network transforming to an edge-cluster graph in order to conceal road information and traffic information, and then provides a cloaking algorithm based on A-anonymity and l-diversity as privacy metrics to further enclose a target vehicle's location. Simulation analysis shows our PLPCA has good performances like the strength of hiding of road information & traffic information.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"13 1","pages":"305-310"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84806267","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}
Pub Date : 2014-07-08DOI: 10.1109/INFCOMW.2014.6849210
Dimitris Milioris, P. Jacquet
In this paper we present an efficient encryption system based on Compressive Sensing, without the additional computational cost of a separate encryption protocol, when applied to indoor location estimation problems. The breakthrough of the method is the use of the weakly encrypted measurement matrices which are generated when solving the optimization problem to localize the source. It must be noted that in this method an alternative key is required to secure the system.
{"title":"SecLoc: Encryption system based on compressive sensing measurements for location estimation","authors":"Dimitris Milioris, P. Jacquet","doi":"10.1109/INFCOMW.2014.6849210","DOIUrl":"https://doi.org/10.1109/INFCOMW.2014.6849210","url":null,"abstract":"In this paper we present an efficient encryption system based on Compressive Sensing, without the additional computational cost of a separate encryption protocol, when applied to indoor location estimation problems. The breakthrough of the method is the use of the weakly encrypted measurement matrices which are generated when solving the optimization problem to localize the source. It must be noted that in this method an alternative key is required to secure the system.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"78 1","pages":"171-172"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83606068","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}
Pub Date : 2014-07-08DOI: 10.1109/INFCOMW.2014.6849261
MohammadJavad NoroozOliaee, B. Hamdaoui, M. Guizani, Mahdi Ben Ghorbel
We design a simple and efficient online scheme for scheduling cloud tasks requesting multiple resources, such as CPU and memory. The proposed scheme reduces the queuing delay of the cloud tasks by accounting for their execution time lengths. We also derive bounds on the average queuing delays, and evaluate the performance of our proposed scheme and compare it with those achievable under existing schemes by relying on real Google data traces. Using this data, we show that our scheme outperforms the other schemes in terms of resource utilizations as well as average task queuing delays.
{"title":"Online multi-resource scheduling for minimum task completion time in cloud servers","authors":"MohammadJavad NoroozOliaee, B. Hamdaoui, M. Guizani, Mahdi Ben Ghorbel","doi":"10.1109/INFCOMW.2014.6849261","DOIUrl":"https://doi.org/10.1109/INFCOMW.2014.6849261","url":null,"abstract":"We design a simple and efficient online scheme for scheduling cloud tasks requesting multiple resources, such as CPU and memory. The proposed scheme reduces the queuing delay of the cloud tasks by accounting for their execution time lengths. We also derive bounds on the average queuing delays, and evaluate the performance of our proposed scheme and compare it with those achievable under existing schemes by relying on real Google data traces. Using this data, we show that our scheme outperforms the other schemes in terms of resource utilizations as well as average task queuing delays.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"49 1","pages":"375-379"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78326746","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}
Pub Date : 2014-07-08DOI: 10.1109/INFCOMW.2014.6849220
M. Li, Si Chen, K. Ren
The typical usage for phones is making calls. However, under certain scenarios, phone calls are inappropriate or intrusive when people are having a meeting, impractical when background noise level is too high or insecure under monitoring of other personals/parties. Typical solution to these problems is to send text-based messages. Yet, we argue that the most natural, efficient way for human-beings to communicate is via speech. In this work, we provide envision for our project, a non-intrusive, convenient and secure communication system. We utilize the front camera of smart phones, efficiency of cloud computing environment and state-of-the-art text-to-speech methods to create a robust visual speech recognition system to enable people to chat with lip movements. We present the current challenges, system architecture, initial findings and planned approaches to our problem.
{"title":"Enabling private and non-intrusive smartphone calls with LipTalk","authors":"M. Li, Si Chen, K. Ren","doi":"10.1109/INFCOMW.2014.6849220","DOIUrl":"https://doi.org/10.1109/INFCOMW.2014.6849220","url":null,"abstract":"The typical usage for phones is making calls. However, under certain scenarios, phone calls are inappropriate or intrusive when people are having a meeting, impractical when background noise level is too high or insecure under monitoring of other personals/parties. Typical solution to these problems is to send text-based messages. Yet, we argue that the most natural, efficient way for human-beings to communicate is via speech. In this work, we provide envision for our project, a non-intrusive, convenient and secure communication system. We utilize the front camera of smart phones, efficiency of cloud computing environment and state-of-the-art text-to-speech methods to create a robust visual speech recognition system to enable people to chat with lip movements. We present the current challenges, system architecture, initial findings and planned approaches to our problem.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"28 1","pages":"191-192"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80643695","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}
Pub Date : 2014-07-08DOI: 10.1109/INFCOMW.2014.6849216
E. M. R. Oliveira, A. C. Viana
The careful deployment of hotspots in metropolitan areas allow to maximize WiFi offloading, a viable solution to the recent boost up of mobile data consumption. Our proposed strategy considers routine characteristics present on people's daily trajectories, the space-time interaction between them urban locations, and their transportation modes. Using a reallife metropolitan trace, we show our routine-based strategy guarantees higher offload ratio than the current approach in the literature while using a realistic traffic model.
{"title":"Routine-based network deployment","authors":"E. M. R. Oliveira, A. C. Viana","doi":"10.1109/INFCOMW.2014.6849216","DOIUrl":"https://doi.org/10.1109/INFCOMW.2014.6849216","url":null,"abstract":"The careful deployment of hotspots in metropolitan areas allow to maximize WiFi offloading, a viable solution to the recent boost up of mobile data consumption. Our proposed strategy considers routine characteristics present on people's daily trajectories, the space-time interaction between them urban locations, and their transportation modes. Using a reallife metropolitan trace, we show our routine-based strategy guarantees higher offload ratio than the current approach in the literature while using a realistic traffic model.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"154 1","pages":"183-184"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86650393","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}
Pub Date : 2014-07-08DOI: 10.1109/INFOCOM.2014.6848188
R. Cohen, G. Grebla
{"title":"Multi-dimensional OFDMA scheduling in a wireless network with relay nodes","authors":"R. Cohen, G. Grebla","doi":"10.1109/INFOCOM.2014.6848188","DOIUrl":"https://doi.org/10.1109/INFOCOM.2014.6848188","url":null,"abstract":"","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"1 1","pages":"2427-2435"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90861298","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}
Pub Date : 2014-07-08DOI: 10.1109/INFCOMW.2014.6849245
Gonzalo Ferrer, H. Méric, José M. Piquer, Javier Bustos-Jiménez
In this article we present the performance evaluation of different algorithms to distribute video frames from network cameras to multiple concurrent clients in real-time. The algorithms evaluated in this paper rely on a pool of buffers shared by all the clients. We implement these algorithms in the VLC media player and study their performance in terms of frame rate, hardware resource usage and decoding errors. Moreover, we compare their performance to the VLC streaming algorithm. Experimental results show that well designed algorithms combined with a sufficient number of buffers significantly outperform the VLC streaming algorithm.
{"title":"Performance evaluation of streaming algorithms for network cameras","authors":"Gonzalo Ferrer, H. Méric, José M. Piquer, Javier Bustos-Jiménez","doi":"10.1109/INFCOMW.2014.6849245","DOIUrl":"https://doi.org/10.1109/INFCOMW.2014.6849245","url":null,"abstract":"In this article we present the performance evaluation of different algorithms to distribute video frames from network cameras to multiple concurrent clients in real-time. The algorithms evaluated in this paper rely on a pool of buffers shared by all the clients. We implement these algorithms in the VLC media player and study their performance in terms of frame rate, hardware resource usage and decoding errors. Moreover, we compare their performance to the VLC streaming algorithm. Experimental results show that well designed algorithms combined with a sufficient number of buffers significantly outperform the VLC streaming algorithm.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"21 1","pages":"281-286"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84731199","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}
Pub Date : 2014-07-08DOI: 10.1109/INFCOMW.2014.6849291
Jianjun Yang, Kun Hua, Yin Wang, Wei Wang, Honggang Wang, Ju Shen
With the explosive growth of Web-based cameras and mobile devices, billions of photographs are uploaded to the Internet. We can trivially collect a huge number of photo streams for various goals, such as 3D scene reconstruction and other big data applications. However, this is not an easy task due to the fact the retrieved photos are neither aligned nor calibrated. Furthermore, with the occlusion of unexpected foreground objects like people, vehicles, it is even more challenging to find feature correspondences and reconstruct realistic scenes. In this paper, we propose a structure-based image completion algorithm for object removal that produces visually plausible content with consistent structure and scene texture. We use an edge matching technique to infer the potential structure of the unknown region. Driven by the estimated structure, texture synthesis is performed automatically along the estimated curves. We evaluate the proposed method on different types of images: from highly structured indoor environment to the natural scenes. Our experimental results demonstrate satisfactory performance that can be potentially used for subsequent big data processing: 3D scene reconstruction and location recognition.
{"title":"Automatic objects removal for scene completion","authors":"Jianjun Yang, Kun Hua, Yin Wang, Wei Wang, Honggang Wang, Ju Shen","doi":"10.1109/INFCOMW.2014.6849291","DOIUrl":"https://doi.org/10.1109/INFCOMW.2014.6849291","url":null,"abstract":"With the explosive growth of Web-based cameras and mobile devices, billions of photographs are uploaded to the Internet. We can trivially collect a huge number of photo streams for various goals, such as 3D scene reconstruction and other big data applications. However, this is not an easy task due to the fact the retrieved photos are neither aligned nor calibrated. Furthermore, with the occlusion of unexpected foreground objects like people, vehicles, it is even more challenging to find feature correspondences and reconstruct realistic scenes. In this paper, we propose a structure-based image completion algorithm for object removal that produces visually plausible content with consistent structure and scene texture. We use an edge matching technique to infer the potential structure of the unknown region. Driven by the estimated structure, texture synthesis is performed automatically along the estimated curves. We evaluate the proposed method on different types of images: from highly structured indoor environment to the natural scenes. Our experimental results demonstrate satisfactory performance that can be potentially used for subsequent big data processing: 3D scene reconstruction and location recognition.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"32 4","pages":"553-558"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91552644","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}
Pub Date : 2014-07-08DOI: 10.1109/INFCOMW.2014.6849181
Yifei Xu, Yue Yan, Zhuyun Dai, Xiaolin Wang
Current data centers often employ SDNs (Software-Defined Networks) that are layered in most cases. However, information overwhelming has been a limitation to SDN deployment. We present a management model for data center networks. In this approach, regional networks on lower layers will be aggregated and viewed as single switches to upper layers. Management information will be divided into three parts, which can be seen by network managers, regional controllers and tenants, respectively.
{"title":"A management model for SDN-based data center networks","authors":"Yifei Xu, Yue Yan, Zhuyun Dai, Xiaolin Wang","doi":"10.1109/INFCOMW.2014.6849181","DOIUrl":"https://doi.org/10.1109/INFCOMW.2014.6849181","url":null,"abstract":"Current data centers often employ SDNs (Software-Defined Networks) that are layered in most cases. However, information overwhelming has been a limitation to SDN deployment. We present a management model for data center networks. In this approach, regional networks on lower layers will be aggregated and viewed as single switches to upper layers. Management information will be divided into three parts, which can be seen by network managers, regional controllers and tenants, respectively.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"6 1","pages":"113-114"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90214639","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}
In the past couple of years, various information-centric networking (ICN) architectures have been proposed to address the existing problems of the current Internet, each of which from a different perspective. Thus, it becomes critical to deploy and interoperate different ICNs on top of the same physical network infrastructure. This demo presents SD-ICN, a software-defined interoperable deployment framework based on Open vSwitch (OVS) for ICN architectures.
{"title":"SD-ICN: An interoperable deployment framework for software-defined information-centric networks","authors":"Jinfan Wang, Wei Gao, Yuqing Liang, Rui Qin, Jianping Wang, Shucheng Liu","doi":"10.1109/INFCOMW.2014.6849199","DOIUrl":"https://doi.org/10.1109/INFCOMW.2014.6849199","url":null,"abstract":"In the past couple of years, various information-centric networking (ICN) architectures have been proposed to address the existing problems of the current Internet, each of which from a different perspective. Thus, it becomes critical to deploy and interoperate different ICNs on top of the same physical network infrastructure. This demo presents SD-ICN, a software-defined interoperable deployment framework based on Open vSwitch (OVS) for ICN architectures.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"89 1","pages":"149-150"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84428265","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：