Fast Information Exchange in Proximity-Based Multichannel Wireless Networks

A. Gonga, Themistoklis Charalambous, M. Johansson
{"title":"Fast Information Exchange in Proximity-Based Multichannel Wireless Networks","authors":"A. Gonga, Themistoklis Charalambous, M. Johansson","doi":"10.1109/WMNC.2015.24","DOIUrl":null,"url":null,"abstract":"This paper considers the problem of distributed neighbor discovery in multi-channel wireless networks. We propose a protocol in which nodes randomly select a channel and decide whether to transmit or listen for neighbor discovery beacons. When nodes transmit, they use epidemic information dissemination to spread knowledge about all the nodes they have discovered so far. Theoretical guarantees on discovery times are complemented by extensive simulations and practical implementations. The evaluations show that multi-channel communication effectively reduces the number of collisions between nodes in the network (especially in dense networks) and that epidemic information dissemination yields both significant speed-ups and increased resilience to packet losses. Finally, we also show that our protocol compares favorably to previously proposed solutions in the literature.","PeriodicalId":240086,"journal":{"name":"2015 8th IFIP Wireless and Mobile Networking Conference (WMNC)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 8th IFIP Wireless and Mobile Networking Conference (WMNC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WMNC.2015.24","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

This paper considers the problem of distributed neighbor discovery in multi-channel wireless networks. We propose a protocol in which nodes randomly select a channel and decide whether to transmit or listen for neighbor discovery beacons. When nodes transmit, they use epidemic information dissemination to spread knowledge about all the nodes they have discovered so far. Theoretical guarantees on discovery times are complemented by extensive simulations and practical implementations. The evaluations show that multi-channel communication effectively reduces the number of collisions between nodes in the network (especially in dense networks) and that epidemic information dissemination yields both significant speed-ups and increased resilience to packet losses. Finally, we also show that our protocol compares favorably to previously proposed solutions in the literature.
基于邻近的多通道无线网络中的快速信息交换
研究了多通道无线网络中的分布式邻居发现问题。我们提出了一种协议,其中节点随机选择一个信道,并决定是否发送或侦听邻居发现信标。节点传播时,利用疫情信息传播,将目前发现的所有节点的知识进行传播。广泛的模拟和实际实现补充了发现时间的理论保证。评估表明,多通道通信有效地减少了网络中节点之间的碰撞次数(特别是在密集网络中),并且流行信息的传播既可以显著提高速度,又可以增强对包丢失的恢复能力。最后,我们还表明,我们的协议比较有利的先前提出的解决方案在文献中。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信