Efficient collaboration in opportunistic networks

U. Sadiq
{"title":"Efficient collaboration in opportunistic networks","authors":"U. Sadiq","doi":"10.1109/PERCOMW.2011.5766918","DOIUrl":null,"url":null,"abstract":"Content sharing, dissemination and collaboration in open environments require the ability to send and combine data packets across network even in the absence of an end-to-end connected path [1]. User mobility plays a fundamental role in selection of intermediate relays for multi-hop communication [2]. Current schemes do not take into account the effect of power law distribution of inter-contact times, flight lengths and pause duration between flights that are shown to be statistically significant in real traces [3]. We analyze how these properties can be utilized for forwarding data and composition of services available at devices in an open environment (parks, malls, streets in a city etc.) where citizens interact. Contributions of this dissertation include: i) an analytical model to infer user's location over time; ii) a distributed algorithm with low overhead and complexity to infer network topology; iii) a scheme for efficient route discovery between mobile users; and iv) a scheme for scheduling requests to compose services available across the network to provide enhanced functionality in minimal time. Initial simulations on simple forwarding in real environments show improved delivery ratios and reduced delays in comparison to existing schemes.","PeriodicalId":369430,"journal":{"name":"2011 IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops)","volume":"95 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PERCOMW.2011.5766918","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Content sharing, dissemination and collaboration in open environments require the ability to send and combine data packets across network even in the absence of an end-to-end connected path [1]. User mobility plays a fundamental role in selection of intermediate relays for multi-hop communication [2]. Current schemes do not take into account the effect of power law distribution of inter-contact times, flight lengths and pause duration between flights that are shown to be statistically significant in real traces [3]. We analyze how these properties can be utilized for forwarding data and composition of services available at devices in an open environment (parks, malls, streets in a city etc.) where citizens interact. Contributions of this dissertation include: i) an analytical model to infer user's location over time; ii) a distributed algorithm with low overhead and complexity to infer network topology; iii) a scheme for efficient route discovery between mobile users; and iv) a scheme for scheduling requests to compose services available across the network to provide enhanced functionality in minimal time. Initial simulations on simple forwarding in real environments show improved delivery ratios and reduced delays in comparison to existing schemes.
机会主义网络中的有效合作
开放环境中的内容共享、传播和协作要求在没有端到端连接路径的情况下,也能够跨网络发送和组合数据包[1]。用户移动性在多跳通信中间中继的选择中起着重要的作用[2]。目前的方案没有考虑到幂律分布对接触时间、飞行长度和航班间暂停时间的影响,而这些在真实轨迹中具有统计显著性[3]。我们分析了如何利用这些属性来转发数据和在开放环境(公园、商场、城市街道等)中公民互动的设备上可用的服务组合。本文的贡献包括:i)一个分析模型来推断用户的位置随时间的变化;Ii)一种低开销、低复杂度的分布式网络拓扑推断算法;Iii)移动用户间有效路由发现方案;iv)调度请求的方案,以组合网络上可用的服务,以便在最短的时间内提供增强的功能。在真实环境中对简单转发的初步仿真表明,与现有方案相比,该方案提高了传输率,减少了延迟。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信