Co-operative downloading in vehicular ad-hoc wireless networks

A. Nandan, Shirshanka Das, G. Pau, M. Gerla, M. Sanadidi
{"title":"Co-operative downloading in vehicular ad-hoc wireless networks","authors":"A. Nandan, Shirshanka Das, G. Pau, M. Gerla, M. Sanadidi","doi":"10.1109/WONS.2005.7","DOIUrl":null,"url":null,"abstract":"Increasing need for people to be \"connected\"; while at the same time remain as mobile as ever poses several interesting issues in wireless networks. It is conceivable in the near-future that wireless \"hotspots\" experience flash crowds-like traffic arrival pattern. A common phenomena in the Internet today characterized by sudden and unpredicted increase in popularity of on-line content. In this paper, we propose SPAWN, a cooperative strategy for content delivery and sharing in future vehicular networks. We study the issues involved in using such a strategy from the standpoint of vehicular ad-hoc networks. In particular, we show that not only content server but also wireless access network load reduction is critical. We propose a \"communication efficient\" swarming protocol which uses a gossip mechanism that leverages the inherent broadcast nature of the wireless medium, and a piece-selection strategy that takes proximity into account in decisions to exchange pieces. We show through simulation that gossip incorporates location-awareness into peer selection, while incurring low messaging overhead, and consequently enhancing the swarming protocol performance. We develop an analytical model to characterize the performance of SPAWN.","PeriodicalId":120653,"journal":{"name":"Second Annual Conference on Wireless On-demand Network Systems and Services","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-01-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"334","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Second Annual Conference on Wireless On-demand Network Systems and Services","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WONS.2005.7","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 334

Abstract

Increasing need for people to be "connected"; while at the same time remain as mobile as ever poses several interesting issues in wireless networks. It is conceivable in the near-future that wireless "hotspots" experience flash crowds-like traffic arrival pattern. A common phenomena in the Internet today characterized by sudden and unpredicted increase in popularity of on-line content. In this paper, we propose SPAWN, a cooperative strategy for content delivery and sharing in future vehicular networks. We study the issues involved in using such a strategy from the standpoint of vehicular ad-hoc networks. In particular, we show that not only content server but also wireless access network load reduction is critical. We propose a "communication efficient" swarming protocol which uses a gossip mechanism that leverages the inherent broadcast nature of the wireless medium, and a piece-selection strategy that takes proximity into account in decisions to exchange pieces. We show through simulation that gossip incorporates location-awareness into peer selection, while incurring low messaging overhead, and consequently enhancing the swarming protocol performance. We develop an analytical model to characterize the performance of SPAWN.
车载自组织无线网络的协同下载
人们对“互联”的需求日益增加;与此同时,仍然像以往一样移动,在无线网络中提出了几个有趣的问题。可以想象,在不久的将来,无线“热点”将经历闪电人群般的流量到达模式。当今互联网上的一种普遍现象,其特点是在线内容的流行程度突然出乎意料地增加。在本文中,我们提出了SPAWN,这是一种在未来车载网络中用于内容交付和共享的合作策略。我们从车辆自组织网络的角度研究使用这种策略所涉及的问题。特别是,我们表明,不仅内容服务器,而且无线接入网络的负载减少是至关重要的。我们提出了一种“通信高效”的蜂群协议,该协议使用利用无线媒体固有广播性质的八卦机制,以及在决定交换片段时考虑邻近性的片段选择策略。我们通过模拟表明,八卦将位置感知集成到对等选择中,同时产生较低的消息传递开销,从而提高了群集协议的性能。我们开发了一个分析模型来表征SPAWN的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信