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

Reliability Gain of Network Coding in Lossy Wireless Networks 有损无线网络中网络编码的可靠性增益

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

Majid Ghaderi, D. Towsley, J. Kurose

{"title":"Reliability Gain of Network Coding in Lossy Wireless Networks","authors":"Majid Ghaderi, D. Towsley, J. Kurose","doi":"10.1109/INFOCOM.2008.284","DOIUrl":"https://doi.org/10.1109/INFOCOM.2008.284","url":null,"abstract":"The capacity gain of network coding has been extensively studied in wired and wireless networks. Recently, it has been shown that network coding improves network reliability by reducing the number of packet retransmissions in lossy networks. However, the extent of the reliability benefit of network coding is not known. This paper quantifies the reliability gain of network coding for reliable multicasting in wireless networks, where network coding is most promising. We define the expected number of transmissions per packet as the performance metric for reliability and derive analytical expressions characterizing the performance of network coding. We also analyze the performance of reliability mechanisms based on rateless codes and automatic repeat request (ARQ), and compare them with network coding. We first study network coding performance in an access point model, where an access point broadcasts packets to a group of K receivers over lossy wireless channels. We show that the expected number of transmissions using ARQ, compared to network coding, scales as ominus (log K) as the number of receivers becomes large. We then use the access point model as a building block to study reliable multicast in a tree topology. In addition to scaling results, we derive expressions for the expected number of transmissions for finite multicast groups as well. Our results show that network coding significantly reduces the number of retransmissions in lossy networks compared to an ARQ scheme. However, rateless coding achieves asymptotic performance results similar to that of network coding.","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":"124013497","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}

引用次数: 232

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

引用次数: 11

BAKE: A Balanced Kautz Tree Structure for Peer-to-Peer Networks 点对点网络的平衡Kautz树结构

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

Deke Guo, Yunhao Liu, Xiangyang Li

{"title":"BAKE: A Balanced Kautz Tree Structure for Peer-to-Peer Networks","authors":"Deke Guo, Yunhao Liu, Xiangyang Li","doi":"10.1109/INFOCOM.2008.315","DOIUrl":"https://doi.org/10.1109/INFOCOM.2008.315","url":null,"abstract":"In order to improve scalability and reduce maintenance overhead for structured peer-to-peer systems, researchers design optimal architectures with constant degree and logarithmical diameter. The expected topologies, however, require the number of peers to be some given values determined by the average degree and the diameter. Hence, existing designs fail to address the issue due to the fact that (1) we cannot guarantee how many peers to join a P2P system at a given time, and (2) a P2P system is typically dynamic with peers frequently coming and leaving. In this work, we propose BAKE scheme based on balanced Kautz tree structure with logdn in diameter and constant degree even the number of peers is an arbitrary value. Resources that are similar in single or multi-dimensional attributes space are stored on a same peer or neighboring peers. Through formal analysis and comprehensive simulations, we show that BAKE achieves optimal diameter and good connectivity as the Kautz digraph does. Indeed, the concepts of balanced Kautz tree introduced in this work can also be extended and applied to other interconnection networks after minimal modifications, for example, de Bruijn digraph.","PeriodicalId":447520,"journal":{"name":"IEEE INFOCOM 2008 - The 27th Conference on Computer Communications","volume":"2 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":"127497206","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}

引用次数: 28

Underwater Localization in Sparse 3D Acoustic Sensor Networks 稀疏三维声传感器网络的水下定位

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

Wei Cheng, Amin Y. Teymorian, Liran Ma, Xiuzhen Cheng, Xicheng Lu, Zexin Lu

引用次数: 185

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

Stable Peers: Existence, Importance, and Application in Peer-to-Peer Live Video Streaming 稳定对等体:在点对点视频直播中的存在、重要性及应用

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

Feng Wang, Jiangchuan Liu, Y. Xiong

{"title":"Stable Peers: Existence, Importance, and Application in Peer-to-Peer Live Video Streaming","authors":"Feng Wang, Jiangchuan Liu, Y. Xiong","doi":"10.1109/INFOCOM.2008.194","DOIUrl":"https://doi.org/10.1109/INFOCOM.2008.194","url":null,"abstract":"This paper presents a systematic in-depth study on the existence, importance, and application of stable nodes in peer- to-peer live video streaming. Using traces from a real large-scale system as well as analytical models, we show that, while the number of stable nodes is small throughout a whole session, their longer lifespans make them constitute a significant portion in a per-snapshot view of a peer-to-peer overlay. As a result, they have substantially affected the performance of the overall system. Inspired by this, we propose a tiered overlay design, with stable nodes being organized into a tier-1 backbone for serving tier-2 nodes. It offers a highly cost-effective and deployable alternative to proxy-assisted designs. We develop a comprehensive set of algorithms for stable node identification and organization. Specifically, we present a novel structure, Labeled Tree, for the tier-1 overlay, which, leveraging stable peers, simultaneously achieves low overhead and high transmission reliability. Our tiered framework flexibly accommodates diverse existing overlay structures in the second tier. Our extensive simulation results demonstrated that the customized optimization using selected stable nodes boosts the streaming quality and also effectively reduces the control overhead. This is further validated through prototype experiments over the PlanetLab network.","PeriodicalId":447520,"journal":{"name":"IEEE INFOCOM 2008 - The 27th Conference on Computer Communications","volume":"117 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":"116627568","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}

引用次数: 176

BodyQoS: Adaptive and Radio-Agnostic QoS for Body Sensor Networks 身体QoS:身体传感器网络的自适应和无线不可知QoS

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

Gang Zhou, Jian Lu, Chieh-Yih Wan, M. Yarvis, J. Stankovic

{"title":"BodyQoS: Adaptive and Radio-Agnostic QoS for Body Sensor Networks","authors":"Gang Zhou, Jian Lu, Chieh-Yih Wan, M. Yarvis, J. Stankovic","doi":"10.1109/INFOCOM.2008.105","DOIUrl":"https://doi.org/10.1109/INFOCOM.2008.105","url":null,"abstract":"As wireless devices and sensors are increasingly deployed on people, researchers have begun to focus on wireless body-area networks. Applications of wireless body sensor networks include healthcare, entertainment, and personal assistance, in which sensors collect physiological and activity data from people and their environments. In these body sensor networks, quality of service is needed to provide reliable data communication over prioritized data streams. This paper proposes BodyQoS, the first running QoS system demonstrated on an emulated body sensor network. BodyQoS adopts an asymmetric architecture, in which most processing is done on a resource rich aggregator, minimizing the load on resource limited sensor nodes. A virtual MAC is developed in BodyQoS to make it radio-agnostic, allowing a BodyQoS to schedule wireless resources without knowing the implementation details of the underlying MAC protocols. Another unique property of BodyQoS is its ability to provide adaptive resource scheduling. When the effective bandwidth of the channel degrades due to RF interference or body fading effect, BodyQoS adaptively schedules remaining bandwidth to meet QoS requirements. We have implemented BodyQoS in NesC on top of TinyOS, and evaluated its performance on MicaZ devices. Our system performance study shows that BodyQoS delivers significantly improved performance over conventional solutions in combating channel impairment.","PeriodicalId":447520,"journal":{"name":"IEEE INFOCOM 2008 - The 27th Conference on Computer Communications","volume":"8 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":"116756672","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}

引用次数: 157

Delay Analysis for Maximal Scheduling in Wireless Networks with Bursty Traffic 突发业务流无线网络最大调度的延迟分析

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

M. Neely

引用次数: 58

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

引用次数: 7

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

引用次数: 5