Routing Protocol Using Bloom Filters for Mobile Ad Hoc Networks

Tomoyuki Osano, Yoshitaka Uchida, N. Ishikawa
{"title":"Routing Protocol Using Bloom Filters for Mobile Ad Hoc Networks","authors":"Tomoyuki Osano, Yoshitaka Uchida, N. Ishikawa","doi":"10.1109/MSN.2008.38","DOIUrl":null,"url":null,"abstract":"We propose a novel routing protocol for mobile ad hoc networks, which uses bloom filters and the topology information about neighbor nodes. A bloom filter is often used as a content discovery method. In this case, content's ID is hashed to one value and a bloom filter is generated from the value. In our proposed protocol, node ID is hashed to one value, and a bloom filter is generated from such values. The generated bloom filter is propagated over a mobile ad hoc network. While each node propagates the bloom filter to neighbor nodes, it uses the received bloom filter for forwarding received packets over the mobile ad hoc network. We compared the performance of the proposed routing protocol with DSR and show its feasibility as a routing protocol for mobile ad hoc networks.","PeriodicalId":135604,"journal":{"name":"2008 The 4th International Conference on Mobile Ad-hoc and Sensor Networks","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 The 4th International Conference on Mobile Ad-hoc and Sensor Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MSN.2008.38","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

Abstract

We propose a novel routing protocol for mobile ad hoc networks, which uses bloom filters and the topology information about neighbor nodes. A bloom filter is often used as a content discovery method. In this case, content's ID is hashed to one value and a bloom filter is generated from the value. In our proposed protocol, node ID is hashed to one value, and a bloom filter is generated from such values. The generated bloom filter is propagated over a mobile ad hoc network. While each node propagates the bloom filter to neighbor nodes, it uses the received bloom filter for forwarding received packets over the mobile ad hoc network. We compared the performance of the proposed routing protocol with DSR and show its feasibility as a routing protocol for mobile ad hoc networks.
移动Ad Hoc网络中使用Bloom过滤器的路由协议
我们提出了一种新的移动自组织网络路由协议,该协议使用了布隆滤波器和邻居节点的拓扑信息。布隆过滤器通常用作内容发现方法。在这种情况下,内容的ID被散列到一个值,并从该值生成bloom过滤器。在我们提出的协议中,节点ID被散列到一个值,并从这些值生成一个bloom过滤器。生成的布隆过滤器在移动自组织网络上传播。当每个节点将布隆过滤器传播给相邻节点时,它使用接收到的布隆过滤器在移动自组织网络上转发接收到的数据包。我们将所提出的路由协议与DSR的性能进行了比较,并证明了其作为移动自组织网络路由协议的可行性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信