IEEE INFOCOM 2008 - The 27th Conference on Computer Communications最新文献

筛选
英文 中文
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
Utility-Driven Spatiotemporal Sampling Using Mobile Sensors 使用移动传感器的实用驱动时空采样
IEEE INFOCOM 2008 - The 27th Conference on Computer Communications Pub Date : 2008-04-13 DOI: 10.1109/INFOCOM.2008.290
Yang Yu, Loren J. Rittle
{"title":"Utility-Driven Spatiotemporal Sampling Using Mobile Sensors","authors":"Yang Yu, Loren J. Rittle","doi":"10.1109/INFOCOM.2008.290","DOIUrl":"https://doi.org/10.1109/INFOCOM.2008.290","url":null,"abstract":"Many real-world applications for sensor networks require event sampling with sufficient resolution over both spatial and temporal dimensions. When the deployed nodes are insufficient to fully cover the sensor field to satisfy this spatiotemporal sampling requirements of all events, nodes with intelligent mobility are crucial to improve the sampling quality. We measure the sampling quality using a utility function that incorporates both the importance and spatiotemporal properties of events. We then describe a Utility Driven Mobility (UDM) scheme, which enables autonomous mobility scheduling of nodes in a distributed fashion. We evaluate the performance of UDM via extensive simulation studies. Our work provides a practical framework for spatiotemporal sampling using mobile sensor networks.","PeriodicalId":447520,"journal":{"name":"IEEE INFOCOM 2008 - The 27th Conference on Computer Communications","volume":"7 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":"128595304","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}
引用次数: 5
Prioritized Repeated Eliminations Multiple Access: A Novel Protocol for Wireless Networks 优先重复消除多址:无线网络的一种新协议
IEEE INFOCOM 2008 - The 27th Conference on Computer Communications Pub Date : 2008-04-13 DOI: 10.1109/INFOCOM.2008.216
Greger Wikstrand, T. Nilsson, M. Dougherty
{"title":"Prioritized Repeated Eliminations Multiple Access: A Novel Protocol for Wireless Networks","authors":"Greger Wikstrand, T. Nilsson, M. Dougherty","doi":"10.1109/INFOCOM.2008.216","DOIUrl":"https://doi.org/10.1109/INFOCOM.2008.216","url":null,"abstract":"A new and simple MAC protocol is proposed. Each node transmits a burst with length sampled from a geometric distribution with parameter q followed by a carrier sense slot. A node repeats the previous operations until it senses a busy slot. A node will access the channel and transmit its payload when it has sensed h idle slots. The parameter q can be adjusted for each node to achieve desired levels of relative priority with little impact on channel utilization and without a need for explicit knowledge about other traffic. Comparison to existing tree-splitting, carrier sensing and bursting protocols through analysis and simulations shows that our algorithm scales very well to the number of nodes. It has very high success probability, channel utilization and fairness. Extensions are provided for hidden terminal scenarios and are shown in simulations to provide adequate 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":"128912410","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
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
{"title":"Design of a Channel Characteristics-Aware Routing Protocol","authors":"Rupa Krishnan, Ashish Raniwala, T. Chiueh","doi":"10.1109/INFOCOM.2008.314","DOIUrl":"https://doi.org/10.1109/INFOCOM.2008.314","url":null,"abstract":"Radio channel quality of real-world wireless networks tends to exhibit both short-term and long-term temporal variations that are in general difficult to model. To maximize the utilization efficiency of radio resources, it is critical that these temporal fluctuations in radio signal quality be incorporated into wireless routing decisions. In this paper, we explore the design considerations in leveraging accurate real-time radio channel quality information when making routing decisions. Specifically, we propose a channel characteristics-aware routing protocol (CARP) that (1) uses per-packet transmission time to estimate the effective residual capacity of a wireless link, (2) employs a bandwidth probability distribution model to better approximate a wireless path's capacity profile, and (3) applies multi-path routing to exploit diversity among alternative paths and deliver more robust throughputs despite temporal fluctuations in wireless link quality. We evaluated the performance gains of incorporating each of these mechanisms on a miniaturized multi-hop wireless network testbed- MiNT-m.","PeriodicalId":447520,"journal":{"name":"IEEE INFOCOM 2008 - The 27th Conference on Computer Communications","volume":"15 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":"129659605","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
Link Lifetimes and Randomized Neighbor Selection in DHTs dht中的链路生存时间和随机邻居选择
IEEE INFOCOM 2008 - The 27th Conference on Computer Communications Pub Date : 2008-04-13 DOI: 10.1109/INFOCOM.2008.38
Z. Yao, D. Loguinov
{"title":"Link Lifetimes and Randomized Neighbor Selection in DHTs","authors":"Z. Yao, D. Loguinov","doi":"10.1109/INFOCOM.2008.38","DOIUrl":"https://doi.org/10.1109/INFOCOM.2008.38","url":null,"abstract":"Several models of user churn, resilience, and link lifetime have recently appeared in the literature [12], [13], [34], [35]; however, these results do not directly apply to classical distributed hash tables (DHTs) in which neighbor replacement occurs not only when current users die, but also when new user arrive into the system, and where replacement choices are often restricted to the successor of the failed zone in the DHT space. To understand neighbor churn in such networks, this paper proposes a simple, yet accurate, model for capturing link dynamics in structured P2P systems and obtains the distribution of link lifetimes for fairly generic DHTs. Similar to [8], our results show that deterministic networks (e.g., Chord [28], CAN [24]) unfortunately do not extract much benefit from heavy-tailed user lifetimes since link durations are dominated by small remaining lifetimes of newly arriving users that replace the more reliable existing neighbors. We also examine link lifetimes in randomized DHTs equipped with multiple choices for each link and show that users in such systems should prefer neighbors with smaller zones rather than larger age as suggested in prior work [13], [30]. We finish the paper by demonstrating the effectiveness of the proposed min-zone neighbor selection for heavy-tailed user lifetime distributions with the shape parameter alpha obtained from recent measurements [4], [31].","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":"130374864","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}
引用次数: 4
A New ACK Policy To Mitigate the Effects of Coexisting IEEE 802.11/802.11e Devices 一种新的ACK策略减轻IEEE 802.11/802.11e设备共存的影响
IEEE INFOCOM 2008 - The 27th Conference on Computer Communications Pub Date : 2008-04-13 DOI: 10.1109/INFOCOM.2008.271
Haithem Al-Mefleh, J. M. Chang
{"title":"A New ACK Policy To Mitigate the Effects of Coexisting IEEE 802.11/802.11e Devices","authors":"Haithem Al-Mefleh, J. M. Chang","doi":"10.1109/INFOCOM.2008.271","DOIUrl":"https://doi.org/10.1109/INFOCOM.2008.271","url":null,"abstract":"In IEEE 802.11 wireless networks, EDCA users' performance may be degraded because of the existence of legacy users and therefore would get a lower priority service. Such effects are mainly due to the fact that EDCA users are controlled by different contention parameters that are distributed in the beacon frames, but there is no control over legacy users as their contention parameters are PHY dependent, i.e. they have constant values. In this paper, we discuss different aspects of the legacy DCF and EDCA users coexistence. Also, we propose a simple distributed management scheme (called NZ-ACK) to mitigate the influence of legacy DCF on EDCA performance in networks consisting of both types of users without any modifications to legacy users. Finally, we use Opnet simulation to evaluate the performance of NZ-ACK. Results show that NZ-ACK outperforms 802.11 in terms of maintaining the priority of service and delay bounds of EDCA users while providing acceptable throughput for legacy users.","PeriodicalId":447520,"journal":{"name":"IEEE INFOCOM 2008 - The 27th Conference on Computer Communications","volume":"11 4 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":"128173149","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}
引用次数: 7
The Speed of Information Propagation in Large Wireless Networks 大型无线网络中的信息传播速度
IEEE INFOCOM 2008 - The 27th Conference on Computer Communications Pub Date : 2008-04-13 DOI: 10.1109/INFOCOM.2008.12
Yi Xu, Wenye Wang
{"title":"The Speed of Information Propagation in Large Wireless Networks","authors":"Yi Xu, Wenye Wang","doi":"10.1109/INFOCOM.2008.12","DOIUrl":"https://doi.org/10.1109/INFOCOM.2008.12","url":null,"abstract":"This paper investigates the speed limit of information propagation in large wireless networks, which provides fundamental understanding of the fastest information transportation and delivery that a wireless network is able to accommodate. We show that there is a unified speed upper bound for broadcast and unicast communications in large wireless networks. When network connectivity and successful packet delivery are considered, this speed upper bound is a function of node density. As this bound is unreachable with finite node density, we also quantify the gap between the actually achieved speed and the desired upper bound, which converges to zero exponentially as the node density increases to infinity.","PeriodicalId":447520,"journal":{"name":"IEEE INFOCOM 2008 - The 27th Conference on Computer Communications","volume":"42 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":"123189472","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}
引用次数: 26
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
{"title":"Unified Energy-Efficient Routing for Multi-Hop Wireless Networks","authors":"Sungoh Kwon, N. Shroff","doi":"10.1109/INFOCOM.2008.90","DOIUrl":"https://doi.org/10.1109/INFOCOM.2008.90","url":null,"abstract":"In this paper, we develop an energy-efficient routing scheme that takes into account three key wireless system elements: transmission power; interference; and residual energy. Since energy is a scarce resource, many energy-aware routing algorithms have been proposed to improve network performance. However, previous algorithms have been designed for a subset of these three main elements, which could limit their applicability. Thus, our contribution is here to develop a unified routing algorithm called the Energy-efficient Unified Routing (EURo) algorithm that accommodates any combination of these above key elements. We show via simulations that EURo outperforms the state-of-the-art.","PeriodicalId":447520,"journal":{"name":"IEEE INFOCOM 2008 - The 27th Conference on Computer Communications","volume":"20 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":"122570952","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
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
{"title":"Towards Energy-Optimal and Reliable Data Collection via Collision-Free Scheduling in Wireless Sensor Networks","authors":"Huang Lee, Abtin Keshavarzian","doi":"10.1109/INFOCOM.2008.268","DOIUrl":"https://doi.org/10.1109/INFOCOM.2008.268","url":null,"abstract":"We consider the problem of supervision or periodic data collection for stationary wireless sensor networks and present a practical, energy-efficient, and reliable solution. Energy-efficiency is achieved by combining three design methods: (a) adopting network flow optimization techniques, the optimal scheme for balancing the communication load among all the nodes in the network is calculated. This gives the lower bound for the energy required for data collection process, (b) instead of using a fixed network topology (communication tree), a set of optimized trees is constructed and the communication tree varies over different data collection cycles. We show that this method achieves an average energy consumption rate very close to the optimal value, (c) the packet exchange procedure is designed based on collision-free schedules, to minimize the number of packets and the transmission and reception times for each node. Reliability of the process is guaranteed by including many retransmission opportunities in the schedules. The performance is evaluated through simulations.","PeriodicalId":447520,"journal":{"name":"IEEE INFOCOM 2008 - The 27th Conference on Computer Communications","volume":"92 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":"122618908","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}
引用次数: 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
{"title":"On Transient-Constrained Wavelength Assignment","authors":"Guangzhi Li, A. Chiu, R. Doverspike, M. Birk, Don Husa, Nick Zanki","doi":"10.1109/INFOCOM.2008.262","DOIUrl":"https://doi.org/10.1109/INFOCOM.2008.262","url":null,"abstract":"In a network with Reconfigurable Optical Add/drop Multiplexers (ROADMs), transient effects from network failures trigger sudden power changes to channels, even on spans (ROADM-to-ROADM links) upstream/downstream from the failure. Some ROADMs rely on restrictive wavelength assignment rules, called field-of-use (FOU), to insure surviving channels meet performance objectives. Drop depth (DD) (ratio of surviving channels) and span overlap count (SOC) (length of spans of overlapping lightpaths) are two parameters defined for FOU guidelines. For a given DD, FOU guidelines specify a corresponding maximum SOC for each wavelength. Generally, a wavelength can support a longer span overlap count under a smaller drop depth restriction. However, the measured drop-depth changes as wavelengths are assigned. We propose methods to optimize transient-constrained wavelength assignment in commercial ROADM networks. Our solutions have been shown to provide 40% more channels than with typical FOU guidelines.","PeriodicalId":447520,"journal":{"name":"IEEE INFOCOM 2008 - The 27th Conference on Computer Communications","volume":"32 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":"126140720","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}
引用次数: 1
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信