2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)最新文献

A preference-aware trajectory privacy-preserving scheme in location-based social networks 基于位置的社交网络中偏好感知轨迹隐私保护方案

2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2017-05-01 DOI: 10.1109/INFCOMW.2017.8116482

Liang Zhu, Changqiao Xu, Jianfeng Guan, Yang Liu, Hongke Zhang

{"title":"A preference-aware trajectory privacy-preserving scheme in location-based social networks","authors":"Liang Zhu, Changqiao Xu, Jianfeng Guan, Yang Liu, Hongke Zhang","doi":"10.1109/INFCOMW.2017.8116482","DOIUrl":"https://doi.org/10.1109/INFCOMW.2017.8116482","url":null,"abstract":"Trajectory privacy-preserving for Location-based Social Networks (LBSNs) has been received much attention to protect the sensitive location information of subscribers from leaking. Existing trajectory privacy-preserving schemes in literature are confronted with three problems: 1) it is limited for privacy-preserving by only considering the location anonymization in practical environment, and the sensitive locations are always revealed by this way; 2) they fail to consider the user preference and background information in trajectory anonymization, which is important to keep personalized location-based service; 3) they can not be adapted to different kinds of privacy risk levels, resulting in low the service precision. To tackle the above problems, we propose PTPP, a preference-aware trajectory privacy-preserving scheme. First, we model the user preference by considering movement pattern, user familiarity and location popularity. Then, we classify the privacy risk levels according to user familiarity and location popularity. Finally, we propose a preference-aware trajectory anonymization algorithm by considering privacy risk levels. The experimental results show that our method outperforms the existing method in terms of data utility and efficiency.","PeriodicalId":306731,"journal":{"name":"2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115480104","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}

引用次数: 3

Topology inference of multilayer networks 多层网络的拓扑推理

2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2017-05-01 DOI: 10.1109/INFCOMW.2017.8116495

Panagiotis A. Traganitis, Yanning Shen, G. Giannakis

引用次数: 10

Contracts as entry barriers for unlicensed spectrum 合约是进入非授权频谱的障碍

2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2017-05-01 DOI: 10.1109/INFCOMW.2017.8116484

Yining Zhu, R. Berry

引用次数: 5

Multicommodity games in public-cloud markets considering subadditive resource demands 考虑次可加性资源需求的公共云市场中的多商品博弈

2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2017-05-01 DOI: 10.1109/INFCOMW.2017.8116454

G. Kesidis, N. Nasiriani, Y. Shan, B. Urgaonkar, I. Lambadaris

引用次数: 0

CO-RTO: Achieving efficient data retransmission in VNDN by correlations implied in names CO-RTO:通过名称中隐含的相关性实现VNDN中有效的数据重传

2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2017-05-01 DOI: 10.1109/INFCOMW.2017.8116404

Yuwei Xu, Siyan Yao, Changhai Wang, Jingdong Xu

{"title":"CO-RTO: Achieving efficient data retransmission in VNDN by correlations implied in names","authors":"Yuwei Xu, Siyan Yao, Changhai Wang, Jingdong Xu","doi":"10.1109/INFCOMW.2017.8116404","DOIUrl":"https://doi.org/10.1109/INFCOMW.2017.8116404","url":null,"abstract":"Packet loss is a serious phenomenon in Vehicular Ad-hoc NETworks (VANETs). Although the multi-source and in-network caching characteristics of Named Data Networking (NDN) can help the consumer to retrieve named content, how to provide reliable named data transmission in vehicular environment is still a problem. To achieve the named data retransmission, previous works follow the traditional RTO algorithms based on the latest RTT samples. Since the host-to-host transmission mode is broken by the multi-source and high dynamic Vehicular Named Data Networking (VNDN), those algorithms are no longer applicable. In this paper, we first put forward the concept of correlativity between two chunk transmissions, then quantify it by the logic and physical semantics implied in names, and finally propose CO-RTO, a correlativity-based algorithm which estimates the Retransmission TimeOut (RTO) according to the RTT samples with high correlativity. We have validated our approach in an urban traffic scenario on ndnSIM. The simulation results show that CO-RTO is more efficient than some classic algorithms in named data retransmission.","PeriodicalId":306731,"journal":{"name":"2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127499957","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}

引用次数: 10

Poster abstract: Resource allocation with service availability & QoS constraints in mobile fog networks 海报摘要:移动雾网络中具有服务可用性和QoS约束的资源分配

2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2017-05-01 DOI: 10.1109/INFCOMW.2017.8116539

N. Daneshfar, N. Pappas, Vangelis Angelakis

引用次数: 5

Cumulative prospect theoretic study of a cloud storage defense game against advanced persistent threats 针对高级持续性威胁的云存储防御博弈累积前景理论研究

2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2017-05-01 DOI: 10.1109/INFCOMW.2017.8116435

Dongjin Xu, Liang Xiao, N. Mandayam, H. Poor

{"title":"Cumulative prospect theoretic study of a cloud storage defense game against advanced persistent threats","authors":"Dongjin Xu, Liang Xiao, N. Mandayam, H. Poor","doi":"10.1109/INFCOMW.2017.8116435","DOIUrl":"https://doi.org/10.1109/INFCOMW.2017.8116435","url":null,"abstract":"Cloud storage is vulnerable to advanced persistent threats (APTs), in which an attacker launches stealthy, continuous, well-funded and targeted attacks on storage devices. In this paper, cumulative prospect theory (CPT) is applied to study the interactions between a defender of cloud storage and an APT attacker when each of them makes subjective decisions to choose the scan interval and attack interval, respectively. Both the probability weighting effect and the framing effect are applied to model the deviation of subjective decisions of end-users from the objective decisions governed by expected utility theory, under uncertain attack durations. Cumulative decision weights are used to describe the probability weighting effect and the value distortion functions are used to represent the framing effect of subjective APT attackers and defenders in the CPT-based APT defense game, rather than discrete decision weights, as in earlier prospect theoretic study of APT defense. The Nash equilibria of the CPT-based APT defense game are derived, showing that a subjective attacker becomes risk-seeking if the frame of reference for evaluating the utility is large, and becomes risk-averse if the frame of reference for evaluating the utility is small.","PeriodicalId":306731,"journal":{"name":"2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123784190","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}

引用次数: 18

Improving the energy performance of GPS receivers for location tracking applications 改善GPS接收器的能量性能，用于位置跟踪应用

2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2017-05-01 DOI: 10.1109/INFCOMW.2017.8116357

Kongyang Chen, Guang Tan, Mingming Lu

引用次数: 8

On active queue management in cellular networks 蜂窝网络中的主动队列管理

2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2017-05-01 DOI: 10.1109/INFCOMW.2017.8116407

Joseph D. Beshay, A. T. Nasrabadi, R. Prakash, A. Francini

{"title":"On active queue management in cellular networks","authors":"Joseph D. Beshay, A. T. Nasrabadi, R. Prakash, A. Francini","doi":"10.1109/INFCOMW.2017.8116407","DOIUrl":"https://doi.org/10.1109/INFCOMW.2017.8116407","url":null,"abstract":"Active queue management (AQM) is broadly accepted as the tool of choice for tackling bufferbloat (the accumulation of large queueing delays) in network buffers. CoDel and PIE are considered two of the most promising AQM schemes, but little has been done to adopt them in cellular networks, which are particularly plagued by bufferbloat. This is partly due to the lack of adequate evaluation of their performance on links where the data rate varies quickly and widely. Past studies have used simplistic link models and thus do not provide a strong case for the adoption of either scheme in cellular networks. We study the performance of CoDel and PIE on a recently introduced emulator that accurately reproduces the highly variable nature of cellular links. We discover that both schemes incur link utilization losses up to 60% in return for reducing queueing delay. This trade-off is undesirable for network providers and applications, yet it is inherent to the design of both CoDel and PIE. We argue that AQM schemes designed around the primary goal of maximizing network power (the ratio between throughput and queuing delay) are not the most effective tool for tackling bufferbloat in cellular links. We propose a new queue balance metric as the driving criterion for designing more effective congestion control solutions for cellular networks.","PeriodicalId":306731,"journal":{"name":"2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"320 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122714709","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}

引用次数: 9

Collaborative hierarchical caching in cloud radio access networks 云无线接入网络中的协同分层缓存

2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2017-05-01 DOI: 10.1109/INFCOMW.2017.8116420

Xiuhua Li, Peiran Wu, Xiaofei Wang, Keqiu Li, Zhu Han, Victor C. M. Leung

引用次数: 9