IEEE INFOCOM 2008 - The 27th Conference on Computer Communications最新文献_第7页

Towards Energy-Optimal and Reliable Data Collection via Collision-Free Scheduling in Wireless Sensor Networks 基于无冲突调度的无线传感器网络能量优化和可靠数据采集

IEEE INFOCOM 2008 - The 27th Conference on Computer Communications Pub Date : 2008-04-13 DOI: 10.1109/INFOCOM.2008.268

Huang Lee, Abtin Keshavarzian

引用次数: 40

On Transient-Constrained Wavelength Assignment 关于瞬态约束波长分配

IEEE INFOCOM 2008 - The 27th Conference on Computer Communications Pub Date : 2008-04-13 DOI: 10.1109/INFOCOM.2008.262

Guangzhi Li, A. Chiu, R. Doverspike, M. Birk, Don Husa, Nick Zanki

引用次数: 1

An Empirical Activity Model for WLAN Users WLAN用户的经验活动模型

IEEE INFOCOM 2008 - The 27th Conference on Computer Communications Pub Date : 2008-04-13 DOI: 10.1109/INFOCOM.2008.272

Caleb T. Phillips, Suresh Singh

引用次数: 8

Design of a Channel Characteristics-Aware Routing Protocol 信道特征感知路由协议的设计

IEEE INFOCOM 2008 - The 27th Conference on Computer Communications Pub Date : 2008-04-13 DOI: 10.1109/INFOCOM.2008.314

Rupa Krishnan, Ashish Raniwala, T. Chiueh

引用次数: 14

Time Blocking Analysis in Time-Driven Switching Networks 时间驱动交换网络中的时间阻塞分析

IEEE INFOCOM 2008 - The 27th Conference on Computer Communications Pub Date : 2008-04-13 DOI: 10.1109/INFOCOM.2008.243

V. Nguyen, M. Telek

引用次数: 12

Verifiable Privacy-Preserving Range Query in Two-Tiered Sensor Networks 双层传感器网络中可验证隐私保护距离查询

IEEE INFOCOM 2008 - The 27th Conference on Computer Communications Pub Date : 2008-04-13 DOI: 10.1109/INFOCOM.2008.18

Bo Sheng, Qun A. Li

引用次数: 157

Dynamic Jamming Mitigation for Wireless Broadcast Networks 无线广播网络的动态干扰抑制

IEEE INFOCOM 2008 - The 27th Conference on Computer Communications Pub Date : 2008-04-13 DOI: 10.1109/INFOCOM.2008.177

Jerry T. Chiang, Yih-Chun Hu

{"title":"Dynamic Jamming Mitigation for Wireless Broadcast Networks","authors":"Jerry T. Chiang, Yih-Chun Hu","doi":"10.1109/INFOCOM.2008.177","DOIUrl":"https://doi.org/10.1109/INFOCOM.2008.177","url":null,"abstract":"Wireless communications are inherently symmetric; that is, it takes an attacker the same amount of power to modulate a signal as it does for a legitimate node to modulate the same signal. As a result, wireless communications are often susceptible to the jamming attack in which the attacker injects a high level of noise into the system. Spread spectrum has long been used to resist jamming attacks in unicast environments, or when the jammer has less information than the other receivers. Recently, we proposed a scheme for broadcast jamming mitigation based on spread spectrum and a binary key tree and showed some improvements over a multiple-unicast system. In this paper, we extend our previous work in five ways. First, we provide a theoretical result that under our scheme, jammers can cause only a limited number of losses. Second, we develop a dynamic tree-remerging scheme that achieves higher power efficiency than previously proposed schemes, and scales to an arbitrary number of receivers without increasing the number of codes in use; in particular, we send each transmission on at most 2j + 1 codes, where j is the number of jammers. Third, we show that our scheme is close to optimal, demonstrating that under certain realistic restrictions, the system cannot escape jamming without using at least j +1 codes. Fourth, we provide a detailed analysis of false alarm rates, showing both experimental and theoretical results. Finally, we perform a more extensive analysis of our system using both a chip-accurate MATLAB simulation and a bit-accurate event-driven simulation in the ns-2 network simulator; these simulations demonstrate that our scheme approaches the best possible performance.","PeriodicalId":447520,"journal":{"name":"IEEE INFOCOM 2008 - The 27th Conference on Computer Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122383071","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}

引用次数: 86

Achieving Honest Ratings with Reputation-Based Fines in Electronic Markets 在电子市场以信誉为基础的罚款实现诚实评级

IEEE INFOCOM 2008 - The 27th Conference on Computer Communications Pub Date : 2008-04-13 DOI: 10.1109/INFOCOM.2008.158

Thanasis G. Papaioannou, G. Stamoulis

{"title":"Achieving Honest Ratings with Reputation-Based Fines in Electronic Markets","authors":"Thanasis G. Papaioannou, G. Stamoulis","doi":"10.1109/INFOCOM.2008.158","DOIUrl":"https://doi.org/10.1109/INFOCOM.2008.158","url":null,"abstract":"The effectiveness of online feedback mechanisms for rating the performance of providers in electronic markets is vulnerable to the submission of dishonest ratings. In this paper, we deal with how to elicit honest such ratings in a competitive electronic market where each participant can occasionally act both as provider and as client. We assume that each service provision is rated by both parties involved; only upon agreement, this rating is included in the calculation of reputation for the provider's performance. We first study as a single-shot game the effectiveness of inducing, upon evidence of lying (i.e. disagreement of the submitted feedback), fixed fines to both transacted parties, yet different ones for the provider and the client. We prove that the submission of honest feedback can be a stable equilibrium for the whole market under certain initial system conditions. Then, we refine our game-model for repeated transactions and calculate proper different reputation-based fines for lying. These fines enable the submission of honest feedback as a stable Nash equilibrium of the repeated game and reduce the social losses due to unfair punishments. Finally, we argue that our model is appropriate for analyzing actual electronic markets, and we investigate the impact of employing our approach to the feedback schemes of such markets.","PeriodicalId":447520,"journal":{"name":"IEEE INFOCOM 2008 - The 27th Conference on Computer Communications","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122394197","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}

引用次数: 21

Unified Energy-Efficient Routing for Multi-Hop Wireless Networks 多跳无线网络的统一节能路由

IEEE INFOCOM 2008 - The 27th Conference on Computer Communications Pub Date : 2008-04-13 DOI: 10.1109/INFOCOM.2008.90

Sungoh Kwon, N. Shroff

引用次数: 13

Designing a Fault-Tolerant Network Using Valiant Load-Balancing 基于Valiant负载均衡的容错网络设计

IEEE INFOCOM 2008 - The 27th Conference on Computer Communications Pub Date : 2008-04-13 DOI: 10.1109/INFOCOM.2008.305

Rui Zhang-Shen, N. McKeown

引用次数: 59