International Workshop on Mobile Opportunistic Networks最新文献

筛选
英文 中文
TACO-DTN: a time-aware content-based dissemination system for delay tolerant networks 时延容忍网络中基于时间感知内容的传播系统TACO-DTN
International Workshop on Mobile Opportunistic Networks Pub Date : 2007-06-11 DOI: 10.1145/1247694.1247711
G. Sollazzo, Mirco Musolesi, C. Mascolo
{"title":"TACO-DTN: a time-aware content-based dissemination system for delay tolerant networks","authors":"G. Sollazzo, Mirco Musolesi, C. Mascolo","doi":"10.1145/1247694.1247711","DOIUrl":"https://doi.org/10.1145/1247694.1247711","url":null,"abstract":"Content dissemination applications are becoming more and more popular on fixed infrastructure: in this paper we introduce TACO-DTN, a content dissemination system which, by virtue of being time-aware in terms of subscriptions and events, is appropriate for delay tolerant networks, where a number of nodes act as infostations, enjoying some form of connectivity to the backbone, and other nodes are mobile devices, reachable sometimes only through intermittent connectivity of carriers. Examples of applications benefiting from such a system could be travel information dissemination systems in large cities (exploiting infostations at bus stops) or on highways, advertisements dissemination at specific times, and information dissemination to remote villages. The approach is based on a novel concept of temporal utility of subscriptions and events. The temporal utility is used to govern the routing of the events to the right infostation (i.e., the one reached by the interested subscribers at the right time), avoiding unnecessary information transfer on slow links and the buffer management, in case buffer limitations are an issue. We give a description of our protocol and discuss its validation through simulation.","PeriodicalId":198518,"journal":{"name":"International Workshop on Mobile Opportunistic Networks","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114506200","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}
引用次数: 76
Performance modeling of network coding in epidemic routing 流行病路由中网络编码的性能建模
International Workshop on Mobile Opportunistic Networks Pub Date : 2007-06-11 DOI: 10.1145/1247694.1247709
Yunfeng Lin, B. Liang, Baochun Li
{"title":"Performance modeling of network coding in epidemic routing","authors":"Yunfeng Lin, B. Liang, Baochun Li","doi":"10.1145/1247694.1247709","DOIUrl":"https://doi.org/10.1145/1247694.1247709","url":null,"abstract":"Epidemic routing has been proposed to reduce the data transmission delay in opportunistic networks, in which data can be either replicated or network coded along the opportunistic multiple paths. In this paper, we introduce an analytical framework to study the performance of network coding based epidemic routing, in comparison with replication based epidemic routing. With extensive simulations, we show that our model successfully characterizes these two protocols and demonstrates the superiority of network coding in opportunistic networks when bandwidth and node buffers are limited. We then propose a priority variant of the network coding based protocol, which has the salient feature that the destination can decode a high priority sub-set of the data much earlier than it can decode any data without the priority scheme. Our analytical results provide insights into how network coding based epidemic routing with priority can reduce the data transmission delay while inducing low overhead.","PeriodicalId":198518,"journal":{"name":"International Workshop on Mobile Opportunistic Networks","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134486454","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}
引用次数: 95
Energy-efficient opportunistic topology control in wireless sensor networks 无线传感器网络中的节能机会拓扑控制
International Workshop on Mobile Opportunistic Networks Pub Date : 2007-06-11 DOI: 10.1145/1247694.1247701
Jian Ma, Qian Zhang, Chen Qian, L. Ni
{"title":"Energy-efficient opportunistic topology control in wireless sensor networks","authors":"Jian Ma, Qian Zhang, Chen Qian, L. Ni","doi":"10.1145/1247694.1247701","DOIUrl":"https://doi.org/10.1145/1247694.1247701","url":null,"abstract":"Topology control has been proposed as a promising technique to achieve energy-efficiency in wireless sensor networks (WSNs). However, existing topology control algorithms assume that wireless links are static, either connected or disconnected. Taking advantage of the time-varying characteristic of wireless links, we define the energy-efficient opportunistic topology control problem, which exploits opportunistic communication to maximize energy-efficiency as well as to satisfy given network performance requirement. After proving this problem to be NP-hard, we propose a greedy solution and show its effectiveness through simulation. To the best of our knowledge, this is the first paper to apply opportunistic communication to topology control in WSNs. We demonstrate that opportunistic topology control can significantly improve energy-efficiency without sacrificing network performance.","PeriodicalId":198518,"journal":{"name":"International Workshop on Mobile Opportunistic Networks","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120907692","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}
引用次数: 19
Prioritized epidemic routing for opportunistic networks 机会主义网络的优先流行病路由
International Workshop on Mobile Opportunistic Networks Pub Date : 2007-06-11 DOI: 10.1145/1247694.1247707
R. Ramanathan, Richard E. Hansen, P. Basu, R. Rosales-Hain, R. Krishnan
{"title":"Prioritized epidemic routing for opportunistic networks","authors":"R. Ramanathan, Richard E. Hansen, P. Basu, R. Rosales-Hain, R. Krishnan","doi":"10.1145/1247694.1247707","DOIUrl":"https://doi.org/10.1145/1247694.1247707","url":null,"abstract":"We describe PRioritized EPidemic (PREP) for routing in opportunistic networks. PREP prioritizes bundles based on costs to destination, source, and expiry time. Costs are derived from per-link \"average availability\" information that is disseminated in an epidemic manner. PREP maintains a gradient of replication density that decreases with increasing distance from the destination. Simulation results show that PREP outperforms AODV and Epidemic Routing by a factor of about 4 and 1.4 respectively, with the gap widening with decreasing density and decreasing storage. We expect PREP to be of greater value than other proposed solutions in highly disconnected and mobile networks where no schedule information or repeatable patterns exist.","PeriodicalId":198518,"journal":{"name":"International Workshop on Mobile Opportunistic Networks","volume":"185 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128152677","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}
引用次数: 352
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学术官方微信