加法器:面向manet和混合有线无线网络的概率、应用层服务发现

G. Oikonomou, I. Phillips, L. Guan, A. Grigg
{"title":"加法器:面向manet和混合有线无线网络的概率、应用层服务发现","authors":"G. Oikonomou, I. Phillips, L. Guan, A. Grigg","doi":"10.1109/CNSR.2011.14","DOIUrl":null,"url":null,"abstract":"Over the past years, Mobile ad-hoc networks (MANETs) have attracted a considerable degree of research attention, with service discovery, selection and invocation being among the topics of interest of previous efforts. In this paper we introduce ADDER, a probabilistic, hybrid, directory-less service discovery mechanism. It has been designed for military IPv6-based MANETs but will work in any hybrid wired-wireless deployment. It achieves very low service acquisition time through the exchange of a very small number of short messages. Propagation of service descriptions is based on a distance vector algorithm, achieving loop and starvation freedom through a feasibility condition, which has been adopted from established and well-tested routing protocols. This paper also presents evaluation results, obtained by actual execution of the ADDER daemon on two different test beds. The experiments aim to demonstrate that the mechanism achieves good scalability with increasing number of services and network size.","PeriodicalId":272359,"journal":{"name":"2011 Ninth Annual Communication Networks and Services Research Conference","volume":"94 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"ADDER: Probabilistic, Application Layer Service Discovery for MANETs and Hybrid Wired-Wireless Networks\",\"authors\":\"G. Oikonomou, I. Phillips, L. Guan, A. Grigg\",\"doi\":\"10.1109/CNSR.2011.14\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Over the past years, Mobile ad-hoc networks (MANETs) have attracted a considerable degree of research attention, with service discovery, selection and invocation being among the topics of interest of previous efforts. In this paper we introduce ADDER, a probabilistic, hybrid, directory-less service discovery mechanism. It has been designed for military IPv6-based MANETs but will work in any hybrid wired-wireless deployment. It achieves very low service acquisition time through the exchange of a very small number of short messages. Propagation of service descriptions is based on a distance vector algorithm, achieving loop and starvation freedom through a feasibility condition, which has been adopted from established and well-tested routing protocols. This paper also presents evaluation results, obtained by actual execution of the ADDER daemon on two different test beds. The experiments aim to demonstrate that the mechanism achieves good scalability with increasing number of services and network size.\",\"PeriodicalId\":272359,\"journal\":{\"name\":\"2011 Ninth Annual Communication Networks and Services Research Conference\",\"volume\":\"94 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-05-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 Ninth Annual Communication Networks and Services Research Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CNSR.2011.14\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 Ninth Annual Communication Networks and Services Research Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CNSR.2011.14","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

摘要

在过去的几年中,移动自组织网络(manet)引起了相当程度的研究关注,服务发现、选择和调用是以前研究的感兴趣的主题之一。本文介绍了一种概率、混合、无目录的服务发现机制——ADDER。它是为军用基于ipv6的manet设计的,但可以在任何混合有线-无线部署中工作。它通过交换非常少量的短消息来实现非常低的服务获取时间。服务描述的传播基于距离矢量算法,通过可行性条件实现循环和饥饿自由,这是从已建立和经过良好测试的路由协议中采用的。本文还介绍了在两个不同的测试平台上实际执行ADDER守护进程所获得的评估结果。实验结果表明,随着服务数量和网络规模的增加,该机制具有良好的可扩展性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
ADDER: Probabilistic, Application Layer Service Discovery for MANETs and Hybrid Wired-Wireless Networks
Over the past years, Mobile ad-hoc networks (MANETs) have attracted a considerable degree of research attention, with service discovery, selection and invocation being among the topics of interest of previous efforts. In this paper we introduce ADDER, a probabilistic, hybrid, directory-less service discovery mechanism. It has been designed for military IPv6-based MANETs but will work in any hybrid wired-wireless deployment. It achieves very low service acquisition time through the exchange of a very small number of short messages. Propagation of service descriptions is based on a distance vector algorithm, achieving loop and starvation freedom through a feasibility condition, which has been adopted from established and well-tested routing protocols. This paper also presents evaluation results, obtained by actual execution of the ADDER daemon on two different test beds. The experiments aim to demonstrate that the mechanism achieves good scalability with increasing number of services and network size.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信