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

Leveraging load migration and basestaion consolidation for green communications in virtualized Cognitive Radio Networks 利用负载迁移和基站整合实现虚拟化认知无线网络中的绿色通信

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

Xiang Sheng, Jian Tang, Chenfei Gao, Weiyi Zhang, Chonggang Wang

{"title":"Leveraging load migration and basestaion consolidation for green communications in virtualized Cognitive Radio Networks","authors":"Xiang Sheng, Jian Tang, Chenfei Gao, Weiyi Zhang, Chonggang Wang","doi":"10.1109/INFCOM.2013.6566919","DOIUrl":"https://doi.org/10.1109/INFCOM.2013.6566919","url":null,"abstract":"With wireless resource virtualization, multiple Mobile Virtual Network Operators (MVNOs) can be supported over a shared physical wireless network and traffic loads in a Base Station (BS) can be easily migrated to more power-efficient BSs in its neighborhood such that idle BSs can be turned off or put into sleep to save power. In this paper, we propose to leverage load migration and BS consolidation for green communications and consider a power-efficient network planning problem in virtualized Cognitive Radio Networks (CRNs) with the objective of minimizing total power consumption while meeting traffic load demand of each MVNO. First, we present a Mixed Integer Linear Programming (MILP) to provide optimal solutions. Then we present a general optimization framework to guide algorithm design, which solves two subproblems, channel assignment and load allocation, in sequence. For channel assignment, we present a (Δ1)-approximation algorithm (where Δ is the maximum number of BSs a BS can potentially interfere with). For load allocation, we present a polynomial-time optimal algorithm for a special case where BSs are power-proportional as well as two effective heuristic algorithms for the general case. In addition, we present an effective heuristic algorithm that jointly solves the two subproblems. It has been shown by extensive simulation results that the proposed algorithms produce close-to-optimal solutions, and moreover, achieve over 45% power savings compared to a baseline algorithm that does not migrate loads or consolidate BSs.","PeriodicalId":206346,"journal":{"name":"2013 Proceedings IEEE INFOCOM","volume":"7 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":"115476743","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}

引用次数: 11

PACE: Policy-Aware Application Cloud Embedding PACE:策略感知应用云嵌入

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

Erran L. Li, Vahid Liaghat, Hongze Zhao, M. Hajiaghayi, Dan Li, G. Wilfong, Y. Yang, Chuanxiong Guo

{"title":"PACE: Policy-Aware Application Cloud Embedding","authors":"Erran L. Li, Vahid Liaghat, Hongze Zhao, M. Hajiaghayi, Dan Li, G. Wilfong, Y. Yang, Chuanxiong Guo","doi":"10.1109/INFCOM.2013.6566849","DOIUrl":"https://doi.org/10.1109/INFCOM.2013.6566849","url":null,"abstract":"The emergence of new capabilities such as virtualization and elastic (private or public) cloud computing infrastructures has made it possible to deploy multiple applications, on demand, on the same cloud infrastructure. A major challenge to achieve this possibility, however, is that modern applications are typically distributed, structured systems that include not only computational and storage entities, but also policy entities (e.g., load balancers, firewalls, intrusion prevention boxes). Deploying applications on a cloud infrastructure without the policy entities may introduce substantial policy violations and/or security holes. In this paper, we present PACE: the first systematic framework for Policy-Aware Application Cloud Embedding. We precisely define the policy-aware, cloud application embedding problem, study its complexity and introduce simple, efficient, online primal-dual algorithms to embed applications in cloud data centers. We conduct evaluations using data from a real, large campus network and a realistic data center topology to evaluate the feasibility and performance of PACE. We show that deployment in a cloud without considering in-network policies may lead to a large number of policy violations (e.g., using tree routing as a way to enforce in-network policies may observe up to 91% policy violations). We also show that our embedding algorithms are very efficient by comparing with a good online fractional embedding algorithm.","PeriodicalId":206346,"journal":{"name":"2013 Proceedings IEEE INFOCOM","volume":"14 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":"114633473","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}

引用次数: 54

Theory underlying measurement of AOA with a rotating directional antenna 旋转定向天线测量AOA的原理

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

Yinjie Chen, Zhongli Liu, Xinwen Fu, Benyuan Liu, Wei Zhao

{"title":"Theory underlying measurement of AOA with a rotating directional antenna","authors":"Yinjie Chen, Zhongli Liu, Xinwen Fu, Benyuan Liu, Wei Zhao","doi":"10.1109/INFCOM.2013.6567055","DOIUrl":"https://doi.org/10.1109/INFCOM.2013.6567055","url":null,"abstract":"In many wireless localization applications, we rotate a directional antenna to derive the angle of arrival (AOA) of wireless signals transmitted from a target mobile device. The AOA corresponds to the direction in which the maximum received signal strength (RSS) is sensed. However, an unanswered question is how to make sure the directional antenna picks up packets producing the maximum RSS while rotating. We propose a set of novel RSS sampling theory to answer this question. We recognize the process that a directional antenna measures RSS of wireless packets while rotating as the process that the radiation pattern of the directional antenna is sampled. Therefore, if RSS samples can reconstruct the antenna's radiation pattern, the direction corresponding to the peak of the radiation pattern is the AOA of the target. We derive mathematical models to determine the RSS sampling rate given the target's packet transmission rate. Our RSS sampling theory is applicable to various types of directional antennas. To validate our RSS sampling theory, we developed BotLoc, which is a programmable and self-coordinated robot armed with a wireless sniffer. We conducted extensive real-world experiments and the experimental results match the theory very well. A video of BotLoc is at www.youtube.com/watch?v=WtUt0IqhXRU&feature=youtu.be.","PeriodicalId":206346,"journal":{"name":"2013 Proceedings IEEE INFOCOM","volume":"21 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":"124139662","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}

引用次数: 13

Efficient data gathering using Compressed Sparse Functions 使用压缩稀疏函数的高效数据收集

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

Liwen Xu, Xiao Qi, Yuexuan Wang, T. Moscibroda

引用次数: 18

Exploring the cloud from passive measurements: The Amazon AWS case 从被动测量探索云:亚马逊AWS案例

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

Ignacio Bermudez, S. Traverso, M. Mellia, M. Munafò

{"title":"Exploring the cloud from passive measurements: The Amazon AWS case","authors":"Ignacio Bermudez, S. Traverso, M. Mellia, M. Munafò","doi":"10.1109/INFCOM.2013.6566769","DOIUrl":"https://doi.org/10.1109/INFCOM.2013.6566769","url":null,"abstract":"This paper presents a characterization of Amazon's Web Services (AWS), the most prominent cloud provider that offers computing, storage, and content delivery platforms. Leveraging passive measurements, we explore the EC2, S3 and CloudFront AWS services to unveil their infrastructure, the pervasiveness of content they host, and their traffic allocation policies. Measurements reveal that most of the content residing on EC2 and S3 is served by one Amazon datacenter, located in Virginia, which appears to be the worst performing one for Italian users. This causes traffic to take long and expensive paths in the network. Since no automatic migration and load-balancing policies are offered by AWS among different locations, content is exposed to the risks of outages. The CloudFront CDN, on the contrary, shows much better performance thanks to the effective cache selection policy that serves 98% of the traffic from the nearest available cache. CloudFront exhibits also dynamic load-balancing policies, in contrast to the static allocation of instances on EC2 and S3. Information presented in this paper will be useful for developers aiming at entrusting AWS to deploy their contents, and for researchers willing to improve cloud design.","PeriodicalId":206346,"journal":{"name":"2013 Proceedings IEEE INFOCOM","volume":"1 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":"124937482","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}

引用次数: 75

Verifiable private multi-party computation: Ranging and ranking 可验证私有多方计算:范围和排名

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

Lan Zhang, Xiangyang Li, Yunhao Liu, Taeho Jung

引用次数: 48

A localized backbone renovating algorithm for wireless ad hoc and sensor networks 无线自组网和传感器网络的局部主干网更新算法

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

Kai Xing, Shuo Zhang, Lei Shi, Haojin Zhu, Yuepeng Wang

{"title":"A localized backbone renovating algorithm for wireless ad hoc and sensor networks","authors":"Kai Xing, Shuo Zhang, Lei Shi, Haojin Zhu, Yuepeng Wang","doi":"10.1109/INFCOM.2013.6567021","DOIUrl":"https://doi.org/10.1109/INFCOM.2013.6567021","url":null,"abstract":"In this paper we propose and analyze a localized backbone renovating algorithm (LBR) to renovate a broken backbone in the network. This research is motivated by the problem of virtual backbone maintenance in wireless ad hoc and sensor networks, where the coverage area of nodes are disks with identical radii. According to our theoretical analysis, the proposed algorithm has the ability to renovate the backbone in a purely localized manner with a guaranteed connectivity of the network, while keeping the backbone size within a constant factor from that of the minimum CDS. Both the communication overhead and computation overhead of the LBR algorithm are O(k), where k is the number of nodes broken or added. We also conduct extensive simulation study on connectivity, backbone size, and the communication/computation overhead. The simulation results show that the proposed algorithm can always keep the renovated backbone being connected at low communication/computation overhead with a relatively small backbone, compared with other existing schemes. Furthermore, the LBR algorithm has the ability to deal with arbitrary number of node failures and additions in the network.","PeriodicalId":206346,"journal":{"name":"2013 Proceedings IEEE INFOCOM","volume":"73 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":"122309542","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

PIPAC: Patient infusion pattern based access control scheme for wireless insulin pump system PIPAC:基于患者输注模式的无线胰岛素泵系统访问控制方案

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

X. Hei, Xiaojiang Du, Shan Lin, Insup Lee

{"title":"PIPAC: Patient infusion pattern based access control scheme for wireless insulin pump system","authors":"X. Hei, Xiaojiang Du, Shan Lin, Insup Lee","doi":"10.1109/INFCOM.2013.6567115","DOIUrl":"https://doi.org/10.1109/INFCOM.2013.6567115","url":null,"abstract":"Wireless insulin pumps have been widely deployed in hospitals and home healthcare systems. Most of these insulin pump systems have limited security mechanisms embedded to protect them from malicious attacks. In this paper, two attacks against insulin pump systems via wireless links are investigated: a single acute overdose with a significant amount of medication, and chronic overdose with an insignificant amount of extra medication over a long time period, e.g., several months. These attacks can be launched unobtrusively and may jeopardize patients' lives. It is very important and urgent to protect patients from these attacks. To address this issue, we propose a novel patient infusion pattern based access control scheme (PIPAC) for wireless insulin pumps. This scheme employs a supervised learning approach to learn normal patient infusions pattern with the dosage amount, rate, and time of infusion, which are automatically recorded in insulin pump logs. The generated regression models are used to dynamically configure a safety infusion range for abnormal infusion identification. The proposed algorithm is evaluated with real insulin pump logs used by several patients for up to 6 months. The evaluation results demonstrate that our scheme can reliably detect the single overdose attack with a success rate up to 98% and defend against the chronic overdose attack with a very high success rate.","PeriodicalId":206346,"journal":{"name":"2013 Proceedings IEEE INFOCOM","volume":"5 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":"127921742","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}

引用次数: 77

Optimizing stored video delivery for mobile networks: The value of knowing the future 为移动网络优化存储视频传输:了解未来的价值

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

Zheng Lu, G. Veciana

{"title":"Optimizing stored video delivery for mobile networks: The value of knowing the future","authors":"Zheng Lu, G. Veciana","doi":"10.1109/INFCOM.2013.6567079","DOIUrl":"https://doi.org/10.1109/INFCOM.2013.6567079","url":null,"abstract":"This paper considers the design of cross-layer opportunistic transport for stored video over wireless networks with a slow varying (average) capacity. We focus on two key ideas: (1) scheduling data transmissions when capacity is high; and (2), exploiting knowledge of future capacity variations. The latter is possible when users' mobility is known or predictable, e.g., users riding on public transportation or using navigation systems. We consider the design of cross-layer transmission schedules which minimize system utilization (and thus possibly transmit/receive energy) while avoiding, if at all possible, rebuffering/delays, in several scenarios. For the single-user anticipative case where all future capacity variations are known beforehand; we establish the optimal transmission schedule is a Generalized Piecewise Constant Thresholding (GPCT) scheme. For the single-user partially anticipative case where only a finite window of future capacity variations is known, we propose an online Greedy Fixed Horizon Control (GFHC). An upper bound on the competitive ratio of GFHC and GPCT is established showing how performance loss depends on the window size, receiver playback buffer, and capacity variability. Finally we consider the multiuser case where we can exploit both future temporal and multiuser diversity. Our simulations and evaluation based on a measured wireless capacity trace exhibit robust potential gains for our proposed transmission schemes.","PeriodicalId":206346,"journal":{"name":"2013 Proceedings IEEE INFOCOM","volume":"6 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":"128339354","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}

引用次数: 77

WheelLoc: Enabling continuous location service on mobile phone for outdoor scenarios WheelLoc:实现户外场景下手机连续定位服务

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

He Wang, Zhiyang Wang, G. Shen, Fan Li, Song Han, Feng Zhao

{"title":"WheelLoc: Enabling continuous location service on mobile phone for outdoor scenarios","authors":"He Wang, Zhiyang Wang, G. Shen, Fan Li, Song Han, Feng Zhao","doi":"10.1109/INFCOM.2013.6567082","DOIUrl":"https://doi.org/10.1109/INFCOM.2013.6567082","url":null,"abstract":"The proliferation of location-based services and applications calls for provisioning of location service as a first class system component that can return accurate location fix in short response time and is energy efficient. In this paper, we present the design, implementation and evaluation of WheelLoc - a continuous system location service for outdoor scenarios. Unlike previous localization efforts that try to directly obtain a point location fix, WheelLoc adopts an indirect approach: it seeks to capture a user mobility trace first and to obtain any point location by time- and speed-aware interpolation or extrapolation. WheelLoc avoids energy-expensive sensors completely and relies solely on commonly available cheap sensors such as accelerometer and magnetometer. With a set of novel techniques and the leverage of publicly available road maps and cell tower information, WheelLoc is able to meet those requirements of a first class component. Experimental results confirmed the effectiveness of WheelLoc. It can return a location estimate within 40ms with an accuracy about 40 meters, consumes only 240mW energy, and effectively strikes a better energy-accuracy tradeoff than GPS duty-cycling.","PeriodicalId":206346,"journal":{"name":"2013 Proceedings IEEE INFOCOM","volume":"2 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":"129454685","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}

引用次数: 37