Predictive scheme for proximate interactions

Arnaud Troël, M. Banâtre, P. Couderc, F. Weis
{"title":"Predictive scheme for proximate interactions","authors":"Arnaud Troël, M. Banâtre, P. Couderc, F. Weis","doi":"10.1109/CDCS.2001.918711","DOIUrl":null,"url":null,"abstract":"Development and projections of wireless PDAs enable to envisage the design of new application classes that exploit short range and direct communications (e.g. one-hop communications). In the near future we may imagine mobile users dynamically and spontaneously exchanging information as soon as they are close enough. In such a context, a connection between two nodes may be broken at any time because of the unconstrained mobility of the nodes and the short communication range. Therefore transmitting data in the most efficient and reliable way becomes a real challenge. To give a first solution to this problem, we propose a mobility-aware software architecture that estimates the duration of a communication link before processing information exchanges.","PeriodicalId":273489,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems Workshops","volume":"54 17","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 21st International Conference on Distributed Computing Systems Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CDCS.2001.918711","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

Abstract

Development and projections of wireless PDAs enable to envisage the design of new application classes that exploit short range and direct communications (e.g. one-hop communications). In the near future we may imagine mobile users dynamically and spontaneously exchanging information as soon as they are close enough. In such a context, a connection between two nodes may be broken at any time because of the unconstrained mobility of the nodes and the short communication range. Therefore transmitting data in the most efficient and reliable way becomes a real challenge. To give a first solution to this problem, we propose a mobility-aware software architecture that estimates the duration of a communication link before processing information exchanges.
近似相互作用的预测方案
无线pda的发展和预测使人们能够设想设计利用短距离和直接通信(例如单跳通信)的新应用程序类。在不久的将来,我们可以想象手机用户只要距离足够近,就会动态地、自发地交换信息。在这种情况下,由于节点不受约束的可移动性和通信距离短,两个节点之间的连接随时可能中断。因此,以最有效、最可靠的方式传输数据成为一个真正的挑战。为了给出这个问题的第一个解决方案,我们提出了一个移动感知软件架构,该架构在处理信息交换之前估计通信链路的持续时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信