2010 Proceedings IEEE INFOCOM最新文献_第2页

On the Viability of Paris Metro Pricing for Communication and Service Networks 巴黎地铁通信和服务网络定价可行性研究

2010 Proceedings IEEE INFOCOM Pub Date : 2010-03-14 DOI: 10.1109/INFCOM.2010.5461957

Chi-Kin Chau, Qian Wang, D. Chiu

引用次数: 75

Lightweight Mutual Authentication and Ownership Transfer for RFID Systems RFID系统的轻量级相互认证和所有权转移

2010 Proceedings IEEE INFOCOM Pub Date : 2010-03-14 DOI: 10.1109/INFCOM.2010.5462233

Lars Kulseng, Zhen Yu, Yawen Wei, Y. Guan

{"title":"Lightweight Mutual Authentication and Ownership Transfer for RFID Systems","authors":"Lars Kulseng, Zhen Yu, Yawen Wei, Y. Guan","doi":"10.1109/INFCOM.2010.5462233","DOIUrl":"https://doi.org/10.1109/INFCOM.2010.5462233","url":null,"abstract":"The promise of RFID technology has been evidently foreseeable due to the low cost and high convenience value of RFID tags. However, the low-cost RFID tags poses new challenges to security and privacy. Some solutions utilize expensive cryptographic primitives such as hash or encryption functions, and some lightweight approaches have been reported to be broken. In this paper, we propose a lightweight solution to Mutual Authentication for RFID systems in which only the authenticated readers and tags can successfully communicate with each other. Then, we adapt our Mutual Authentication scheme to secure the Ownership Transfer of RFID tags. Our mutual authentication and ownership transfer protocols are realized utilizing minimalistic cryptography such as Physically Unclonable Functions (PUF) and Linear Feedback Shift Registers (LFSR). PUFs and LFSRs are very efficient in hardware and particularly suitable for the low-cost RFID tags. Compared to existing solutions built on top of hash functions that require 8000 to 10000 gates, our schemes demand only 784 gates for 64-bit variables and can be easily accommodated by the cheapest RFID tags with only 2000 gates available for security functions.","PeriodicalId":259639,"journal":{"name":"2010 Proceedings IEEE INFOCOM","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114039181","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}

引用次数: 162

On the Fundamental Limits of Broadcasting in Wireless Mobile Networks 论无线移动网络中广播的基本限制

2010 Proceedings IEEE INFOCOM Pub Date : 2010-03-14 DOI: 10.1109/INFCOM.2010.5462260

G. Resta, P. Santi

引用次数: 10

An Efficient Algorithm for Constructing Maximum lifetime Tree for Data Gathering Without Aggregation in Wireless Sensor Networks 无线传感器网络中无聚合数据采集的最大生存树构造算法

2010 Proceedings IEEE INFOCOM Pub Date : 2010-03-14 DOI: 10.1109/INFCOM.2010.5462181

Junbin Liang, Jian-xin Wang, Jiannong Cao, Jianer Chen, Mingming Lu

引用次数: 67

Designing a Practical Access Point Association Protocol 设计一个实用的接入点关联协议

2010 Proceedings IEEE INFOCOM Pub Date : 2010-03-14 DOI: 10.1109/INFCOM.2010.5461909

Fengyuan Xu, C. C. Tan, Qun A. Li, Guanhua Yan, Jie Wu

引用次数: 88

FlashTrie: Hash-based Prefix-Compressed Trie for IP Route Lookup Beyond 100Gbps FlashTrie:用于超过100Gbps的IP路由查找的基于哈希的前缀压缩Trie

2010 Proceedings IEEE INFOCOM Pub Date : 2010-03-14 DOI: 10.1109/INFCOM.2010.5462142

M. Bando, H. J. Chao

{"title":"FlashTrie: Hash-based Prefix-Compressed Trie for IP Route Lookup Beyond 100Gbps","authors":"M. Bando, H. J. Chao","doi":"10.1109/INFCOM.2010.5462142","DOIUrl":"https://doi.org/10.1109/INFCOM.2010.5462142","url":null,"abstract":"It is becoming apparent that the next generation IP route lookup architecture needs to achieve speeds of 100-Gbps and beyond while supporting both IPv4 and IPv6 with fast real-time updates to accommodate ever-growing routing tables. Some of the proposed multibit-trie based schemes, such as Tree Bitmap, have been used in today's high-end routers. However, their large data structure often requires multiple external memory accesses for each route lookup. A pipelining technique is widely used to achieve high-speed lookup with a cost of using many external memory chips. Pipelining also often leads to poor memory load-balancing. In this paper, we propose a new IP route lookup architecture called FlashTrie that overcomes the shortcomings of the multibit-trie based approach. We use a hash-based membership query to limit off-chip memory accesses per lookup to one and to balance memory utilization among the memory modules. We also develop a new data structure called Prefix-Compressed Trie that reduces the size of a bitmap by more than 80%. Our simulation and implementation results show that FlashTrie can achieve 160-Gbps worst-case throughput while simultaneously supporting 2-M prefixes for IPv4 and 279-k prefixes for IPv6 using one FPGA chip and four DDR3 SDRAM chips. FlashTrie also supports incremental real-time updates.","PeriodicalId":259639,"journal":{"name":"2010 Proceedings IEEE INFOCOM","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126991830","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}

引用次数: 50

Know Thy Neighbor: Towards Optimal Mapping of Contacts to Social Graphs for DTN Routing 了解你的邻居:面向DTN路由的联系人到社交图的最佳映射

2010 Proceedings IEEE INFOCOM Pub Date : 2010-03-14 DOI: 10.1109/INFCOM.2010.5462135

T. Hossmann, T. Spyropoulos, F. Legendre

{"title":"Know Thy Neighbor: Towards Optimal Mapping of Contacts to Social Graphs for DTN Routing","authors":"T. Hossmann, T. Spyropoulos, F. Legendre","doi":"10.1109/INFCOM.2010.5462135","DOIUrl":"https://doi.org/10.1109/INFCOM.2010.5462135","url":null,"abstract":"Delay Tolerant Networks (DTN) are networks of self-organizing wireless nodes, where end-to-end connectivity is intermittent. In these networks, forwarding decisions are generally made using locally collected knowledge about node behavior (e.g., past contacts between nodes) to predict future contact opportunities. The use of complex network analysis has been recently suggested to perform this prediction task and improve the performance of DTN routing. Contacts seen in the past are aggregated to a social graph, and a variety of metrics (e.g., centrality and similarity) or algorithms (e.g., community detection) have been proposed to assess the utility of a node to deliver a content or bring it closer to the destination. In this paper, we argue that it is not so much the choice or sophistication of social metrics and algorithms that bears the most weight on performance, but rather the mapping from the mobility process generating contacts to the aggregated social graph. We first study two well-known DTN routing algorithms - SimBet and BubbleRap - that rely on such complex network analysis, and show that their performance heavily depends on how the mapping (contact aggregation) is performed. What is more, for a range of synthetic mobility models and real traces, we show that improved performances (up to a factor of 4 in terms of delivery ratio) are consistently achieved for a relatively narrow range of aggregation levels only, where the aggregated graph most closely reflects the underlying mobility structure. To this end, we propose an online algorithm that uses concepts from unsupervised learning and spectral graph theory to infer this 'correct' graph structure; this algorithm allows each node to locally identify and adjust to the optimal operating point, and achieves good performance in all scenarios considered.","PeriodicalId":259639,"journal":{"name":"2010 Proceedings IEEE INFOCOM","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124028383","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}

引用次数: 196

CSMA-Based Distributed Scheduling in Multi-hop MIMO Networks under SINR Model SINR模型下基于csma的多跳MIMO网络分布式调度

2010 Proceedings IEEE INFOCOM Pub Date : 2010-03-14 DOI: 10.1109/INFCOM.2010.5462119

Dajun Qian, D. Zheng, Junshan Zhang, N. Shroff

{"title":"CSMA-Based Distributed Scheduling in Multi-hop MIMO Networks under SINR Model","authors":"Dajun Qian, D. Zheng, Junshan Zhang, N. Shroff","doi":"10.1109/INFCOM.2010.5462119","DOIUrl":"https://doi.org/10.1109/INFCOM.2010.5462119","url":null,"abstract":"We study the problem of distributed scheduling in multi-hop MIMO networks. We first develop a ``MIMO-pipe\" model that provides the upper layers a set of rates and SINR requirements, which capture the rate-reliability tradeoff in MIMO communications. The main thrust of this study is then dedicated to developing CSMA-based MIMO-pipe scheduling under the SINR model. We choose the SINR model over the extensively studied matching or protocol-based interference models because it more naturally captures the impact of interference in wireless networks. The coupling among the links caused by the interference makes the problem of devising distributed scheduling algorithms particularly challenging. To that end, we explore CSMA-based MIMO-pipe scheduling, from two perspectives. First, we consider an idealized continuous time CSMA network. We propose a dual-band approach in which control messages are exchanged instantaneously over a channel separate from the data channel, and show that CSMA-based scheduling can achieve throughput optimality under the SINR model. Next, we consider a discrete time CSMA network. To tackle the challenge due to the coupling caused by interference, we propose a ``conservative\" scheduling algorithm in which more stringent SINR constraints are imposed based on the MIMO-pipe model. We show that this suboptimal distributed scheduling can achieve an efficiency ratio bounded from below.","PeriodicalId":259639,"journal":{"name":"2010 Proceedings IEEE INFOCOM","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123213632","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}

引用次数: 46

An Attack-Defense Game Theoretic Analysis of Multi-Band Wireless Covert Timing Networks 多波段无线隐蔽定时网络的攻防博弈论分析

2010 Proceedings IEEE INFOCOM Pub Date : 2010-03-14 DOI: 10.1109/INFCOM.2010.5461976

S. Anand, S. Sengupta, R. Chandramouli

{"title":"An Attack-Defense Game Theoretic Analysis of Multi-Band Wireless Covert Timing Networks","authors":"S. Anand, S. Sengupta, R. Chandramouli","doi":"10.1109/INFCOM.2010.5461976","DOIUrl":"https://doi.org/10.1109/INFCOM.2010.5461976","url":null,"abstract":"We discuss malicious interference based denial of service (DoS) attacks in multi-band covert timing networks using an adversarial game theoretic approach. A covert timing network operating on a set of multiple spectrum bands is considered. Each band has an associated utility which represents the critical nature of the covert data transmitted in the band. A malicious attacker wishes to cause a DoS attack by sensing and creating malicious interference on some or all of the bands. The covert timing network deploys camouflaging resources to appropriately defend the spectrum bands. A two tier game theoretic approach is proposed to model this scenario. The first tier of the game is the sensing game in which, the covert timing network determines the amount of camouflaging resources to be deployed in each band and the malicious attacker determines the optimal sensing resources to be deployed in each band. In the second tier of the game, the malicious attacker determines the optimal transmit powers on each spectral band it chooses to attack. We prove the existence of Nash equilibriums for the games. We compare the performance of our proposed game theoretic mechanism with that of other well known heuristic mechanisms and demonstrate the effectiveness of the proposed approach.","PeriodicalId":259639,"journal":{"name":"2010 Proceedings IEEE INFOCOM","volume":"566 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123519967","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}

引用次数: 16

The k-Constrained Bipartite Matching Problem: Approximation Algorithms and Applications to Wireless Networks k约束二部匹配问题:逼近算法及其在无线网络中的应用

2010 Proceedings IEEE INFOCOM Pub Date : 2010-03-14 DOI: 10.1109/INFCOM.2010.5462027

A. Berger, J. Gross, T. Harks

{"title":"The k-Constrained Bipartite Matching Problem: Approximation Algorithms and Applications to Wireless Networks","authors":"A. Berger, J. Gross, T. Harks","doi":"10.1109/INFCOM.2010.5462027","DOIUrl":"https://doi.org/10.1109/INFCOM.2010.5462027","url":null,"abstract":"In communication networks, resource assignment problems appear in several different settings. These problems are often modeled by a maximum weight matching problem in bipartite graphs and efficient matching algorithms are well known. In several applications, the corresponding matching problem has to be solved many times in a row as the underlying system operates in a time-slotted fashion and the edge weights change over time. However, changing the assignments can come with a certain cost for reconfiguration that depends on the number of changed edges between subsequent assignments. In order to control the cost of reconfiguration, we propose the k-constrained bipartite matching problem for bipartite graphs, which seeks an optimal matching that realizes at most k changes from a previous matching. We provide fast approximation algorithms with provable guarantees for this problem. Furthermore, to cope with the sequential nature of assignment problems, we introduce an online variant of the k-constrained matching problem and derive online algorithms that are based on our approximation algorithms for the k-constrained bipartite matching problem. Finally, we establish the applicability of our model and our algorithms in the context of OFDMA wireless networks finding a significant performance improvement for the proposed algorithms.","PeriodicalId":259639,"journal":{"name":"2010 Proceedings IEEE INFOCOM","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127645296","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