2013 Proceedings IEEE INFOCOM最新文献_第4页

PASSAGES: Preserving Anonymity of Sources and Sinks against Global Eavesdroppers 保持源和汇的匿名性以对抗全局窃听者

2013 Proceedings IEEE INFOCOM Pub Date : 2013-04-14 DOI: 10.1109/INFCOM.2013.6566765

Hyungbae Park, Sejun Song, Baek-Young Choi, Chin-Tser Huang

{"title":"PASSAGES: Preserving Anonymity of Sources and Sinks against Global Eavesdroppers","authors":"Hyungbae Park, Sejun Song, Baek-Young Choi, Chin-Tser Huang","doi":"10.1109/INFCOM.2013.6566765","DOIUrl":"https://doi.org/10.1109/INFCOM.2013.6566765","url":null,"abstract":"While many security schemes protect the content of messages in the Distributed Sensing Systems (DSS), the contextual information, such as communication patterns, is left vulnerable and can be utilized by attackers to identify critical information such as the locations of event sources and message sinks. Existing solutions for location anonymity are mostly designed to protect source or sink location anonymity individually against limited eavesdroppers on a small region at a time. However, they can be easily defeated by highly motivated global eavesdroppers that can monitor entire communication events on the DSS. To grapple with these challenges, we propose a mechanism for Preserving Anonymity of Sources and Sinks against Global Eavesdroppers (PASSAGES). PASSAGES uses a small number of stealthy permeability tunnels such as wormholes and message ferries to scatter and hide the communication patterns. Unlike prior schemes, PASSAGES effectively achieves a high anonymity level for both source and sink locations, without incurring extra communication overheads. We quantify the location anonymity level and evaluate the effectiveness of PASSAGES via analysis as well as extensive simulations. We also perform evaluations on the synergistic effect when PASSAGES is combined with other traditional solutions.","PeriodicalId":206346,"journal":{"name":"2013 Proceedings IEEE INFOCOM","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122246201","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}

引用次数: 14

Event detection using customer care calls 使用客户服务呼叫进行事件检测

2013 Proceedings IEEE INFOCOM Pub Date : 2013-04-14 DOI: 10.1109/INFCOM.2013.6566966

Yi-Chao Chen, G. Lee, N. Duffield, L. Qiu, Jia Wang

{"title":"Event detection using customer care calls","authors":"Yi-Chao Chen, G. Lee, N. Duffield, L. Qiu, Jia Wang","doi":"10.1109/INFCOM.2013.6566966","DOIUrl":"https://doi.org/10.1109/INFCOM.2013.6566966","url":null,"abstract":"Customer care calls serve as a direct channel for a service provider to learn feedbacks from their customers. They reveal details about the nature and impact of major events and problems observed by customers. By analyzing the customer care calls, a service provider can detect important events to speed up problem resolution. However, automating event detection based on customer care calls poses several significant challenges. First, the relationship between customers' calls and network events is blurred because customers respond to an event in different ways. Second, customer care calls can be labeled inconsistently across agents and across call centers, and a given event naturally give rise to calls spanning a number of categories. Third, many important events cannot be detected by looking at calls in one category. How to aggregate calls from different categories for event detection is important but challenging. Lastly, customer care call records have high dimensions (e.g., thousands of categories in our dataset). In this paper, we propose a systematic method for detecting events in a major cellular network using customer care call data. It consists of three main components: (i) using a regression approach that exploits temporal stability and low-rank properties to automatically learn the relationship between customer calls and major events, (ii) reducing the number of unknowns by clustering call categories and using L1 norm minimization to identify important categories, and (iii) employing multiple classifiers to enhance the robustness against noise and different response time. For the detected events, we leverage Twitter social media to summarize them and to locate the impacted regions. We show the effectiveness of our approach using data from a large cellular service provider in the US.","PeriodicalId":206346,"journal":{"name":"2013 Proceedings IEEE INFOCOM","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121792031","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

Bundling mobile base station and wireless energy transfer: Modeling and optimization 移动基站与无线能量传输捆绑:建模与优化

2013 Proceedings IEEE INFOCOM Pub Date : 2013-04-14 DOI: 10.1109/INFCOM.2013.6566960

Liguang Xie, Yi Shi, Y. T. Hou, W. Lou, H. Sherali, S. Midkiff

{"title":"Bundling mobile base station and wireless energy transfer: Modeling and optimization","authors":"Liguang Xie, Yi Shi, Y. T. Hou, W. Lou, H. Sherali, S. Midkiff","doi":"10.1109/INFCOM.2013.6566960","DOIUrl":"https://doi.org/10.1109/INFCOM.2013.6566960","url":null,"abstract":"Wireless energy transfer is a promising technology to fundamentally address energy and lifetime problems in a wireless sensor network (WSN). On the other hand, it has been well recognized that a mobile base station has significant advantages over a static one. In this paper, we study the interesting problem of co-locating the mobile base station on the wireless charging vehicle (WCV). The goal is to minimize energy consumption of the entire system while ensuring none of the sensor nodes runs out of energy. We develop a mathematical model for this complex problem. Instead of studying the general problem formulation (OPT-t), which is time-dependent, we show that it is sufficient to study a special subproblem (OPT-s) which only involves space-dependent variables. Subsequently, we develop a provably near-optimal solution to OPT-s. The novelty of this research mainly resides in the development of several solution techniques to tackle a complex problem that is seemingly intractable at first glance. In addition to addressing a challenging and interesting problem in a WSN, we expect the techniques developed in this research can be applied to address other related networking problems involving time-dependent movement, flow routing, and energy consumption.","PeriodicalId":206346,"journal":{"name":"2013 Proceedings IEEE INFOCOM","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115916003","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}

引用次数: 111

Pricing algorithms for the day-ahead electricity market with flexible consumer participation 具有灵活消费者参与的日前电力市场定价算法

2013 Proceedings IEEE INFOCOM Pub Date : 2013-04-14 DOI: 10.1109/INFCOMW.2013.6562890

O. Dalkilic, Ozan Candogan, A. Eryilmaz

引用次数: 5

APT: Accurate outdoor pedestrian tracking with smartphones APT:使用智能手机进行准确的户外行人跟踪

2013 Proceedings IEEE INFOCOM Pub Date : 2013-04-14 DOI: 10.1109/INFCOM.2013.6567057

Xiaojun Zhu, Qun A. Li, Guihai Chen

引用次数: 113

10 Gbit line rate packet-to-disk using n2disk 使用n2disk的10gbit线路速率数据包到磁盘

2013 Proceedings IEEE INFOCOM Pub Date : 2013-04-14 DOI: 10.1109/INFCOM.2013.6567171

L. Deri, A. Cardigliano, F. Fusco

引用次数: 30

Delay optimal policies offer very little privacy 延迟最优策略提供的隐私很少

2013 Proceedings IEEE INFOCOM Pub Date : 2013-04-14 DOI: 10.1109/INFCOM.2013.6567051

Sachin Kadloor, N. Kiyavash

{"title":"Delay optimal policies offer very little privacy","authors":"Sachin Kadloor, N. Kiyavash","doi":"10.1109/INFCOM.2013.6567051","DOIUrl":"https://doi.org/10.1109/INFCOM.2013.6567051","url":null,"abstract":"Traditionally, scheduling policies have been optimized to perform well on metrics such as throughput, delay and fairness. In the context of shared event schedulers, where a common processor is shared among multiple users, one also has to consider the privacy offered by the scheduling policy. The privacy offered by a scheduling policy measures how much information about the usage pattern of one user of the system can be learnt by another as a consequence of sharing the scheduler. In [1], we introduced an estimation error based metric to quantify this privacy. We showed that the most commonly deployed scheduling policy, the first-come-first-served (FCFS) offers very little privacy to its users. We also proposed a parametric non-work-conserving policy which traded off delay for improved privacy. In this work, we ask the question, is a trade-off between delay and privacy fundamental to the design to scheduling policies? In particular, is there a work-conserving, possibly randomized, scheduling policy that scores high on the privacy metric? Answering the first question, we show that there does exist a fundamental limit on the privacy performance of a work-conserving scheduling policy. We quantify this limit. Furthermore, answering the second question, we demonstrate that the round-robin scheduling policy (a deterministic policy) is privacy optimal within the class of work-conserving policies.","PeriodicalId":206346,"journal":{"name":"2013 Proceedings IEEE INFOCOM","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133902820","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}

引用次数: 12

CEDAR: An optimal and distributed strategy for packet recovery in wireless networks 雪松:无线网络中包恢复的最佳分布式策略

2013 Proceedings IEEE INFOCOM Pub Date : 2013-04-14 DOI: 10.1109/INFCOM.2013.6567096

Chenxi Qiu, Haiying Shen, S. Soltani, Karan Sapra, Hao Jiang, J. Hallstrom

{"title":"CEDAR: An optimal and distributed strategy for packet recovery in wireless networks","authors":"Chenxi Qiu, Haiying Shen, S. Soltani, Karan Sapra, Hao Jiang, J. Hallstrom","doi":"10.1109/INFCOM.2013.6567096","DOIUrl":"https://doi.org/10.1109/INFCOM.2013.6567096","url":null,"abstract":"Underlying link-layer protocols of wireless networks use the conventional “store and forward” design paradigm cannot provide highly sustainable reliability and stability in wireless communication, which introduce significant barriers and setbacks in scalability and deployments of wireless networks. In this paper, we propose a Code Embedded Distributed Adaptive and Reliable (CEDAR) link-layer framework that targets low latency and high throughput. CEDAR is the first comprehensive theoretical framework for analyzing and designing distributed and adaptive error recovery for wireless networks. It employs a theoretically-sound framework for embedding channel codes in each packet and performs the error correcting process in selected intermediate nodes in packet's route. To identify the intermediate nodes for the en/decoding for minimizing average packet latency, we mathematically analyze the average packet delay, using Finite State Markovian Channel model and priority queuing model, and then formalize the problem as a non-linear integer programming problem. Also, we propose a scalable and distributed scheme to solve this problem. The results from real-world testbed “NESTbed” and simulation with Matlab prove that CEDAR is superior to the schemes using hop-by-hop decoding and destination-decoding not only in packet delay but also in throughput. In addition, the simulation results show that CEDAR can achieve the optimal performance in most cases.","PeriodicalId":206346,"journal":{"name":"2013 Proceedings IEEE INFOCOM","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134288420","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

Channel quality prediction based on Bayesian inference in cognitive radio networks 认知无线网络中基于贝叶斯推理的信道质量预测

2013 Proceedings IEEE INFOCOM Pub Date : 2013-04-14 DOI: 10.1109/INFCOM.2013.6566941

Xiaoshuang Xing, Tao Jing, Yan Huo, Hongjuan Li, Xiuzhen Cheng

{"title":"Channel quality prediction based on Bayesian inference in cognitive radio networks","authors":"Xiaoshuang Xing, Tao Jing, Yan Huo, Hongjuan Li, Xiuzhen Cheng","doi":"10.1109/INFCOM.2013.6566941","DOIUrl":"https://doi.org/10.1109/INFCOM.2013.6566941","url":null,"abstract":"The problem of channel quality prediction in cognitive radio networks is investigated in this paper. First, the spectrum sensing process is modeled as a Non-Stationary Hidden Markov Model (NSHMM), which captures the fact that the channel state transition probability is a function of the time interval the primary user has stayed in the current state. Then the model parameters, which carry the information about the expected duration of the channel states and the spectrum sensing accuracy (detection accuracy and false alarm probability) of the SU, are estimated via Bayesian inference with Gibbs sampling. Finally, the estimated NSHMM parameters are employed to design a channel quality metric according to the predicted channel idle duration and spectrum sensing accuracy. Extensive simulation study has been performed to investigate the effectiveness of our design. The results indicate that channel ranking based on the proposed channel quality prediction mechanism captures the idle state duration of the channel and the spectrum sensing accuracy of the SUs, and provides more high quality transmission opportunities and higher successful transmission rates at shorter spectrum waiting times for dynamic spectrum access.","PeriodicalId":206346,"journal":{"name":"2013 Proceedings IEEE INFOCOM","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131765634","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}

引用次数: 115

R3: Optimizing relocatable code for efficient reprogramming in networked embedded systems 优化可重定位代码，实现网络嵌入式系统的高效重编程

2013 Proceedings IEEE INFOCOM Pub Date : 2013-04-14 DOI: 10.1109/INFCOM.2013.6566786

Wei Dong, Biyuan Mo, Chao Huang, Yunhao Liu, Chun Chen

引用次数: 24