McDisc: A Reliable Neighbor Discovery Protocol in Low Duty Cycle and Multi-channel Wireless Networks

Maotian Zhang, Lei Zhang, Panlong Yang, Yubo Yan
{"title":"McDisc: A Reliable Neighbor Discovery Protocol in Low Duty Cycle and Multi-channel Wireless Networks","authors":"Maotian Zhang, Lei Zhang, Panlong Yang, Yubo Yan","doi":"10.1109/NAS.2013.7","DOIUrl":null,"url":null,"abstract":"Neighbor discovery is the very first step for many mobile applications. Previous neighbor discovery protocols that use single channel may be failed when faced with unreliable channel environment, whereas most of multi-channel schemes do not focus on neighbor discovery in low duty cycle wireless networks. The key challenge for multi-channel slotted neighbor discovery is how to effectively assign the channel during each active slot. We propose McDisc, an energy-efficient and reliable duty-cycle-based neighbor discovery protocol that is built on two basic idea. First, it leverages randomized approach to establish the multi-channel discovery schedule, where the node is assigned to the chosen channel during each active slot randomly. Randomized approach may suffer from extremely low discovery probability in worst case. In tackling this problem, we then employ deterministic channel assignment that can ensure bounded discovery latency. The theoretical analysis and simulation results confirm that McDisc can cope with unreliable channel environment ensuring reliable and low latency discovery efficiently. In terms of 60% packet loss ratio, McDisc outperforms U-Connect [1] by approximate 100% in the worst-case discovery latency.","PeriodicalId":213334,"journal":{"name":"2013 IEEE Eighth International Conference on Networking, Architecture and Storage","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE Eighth International Conference on Networking, Architecture and Storage","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NAS.2013.7","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

Neighbor discovery is the very first step for many mobile applications. Previous neighbor discovery protocols that use single channel may be failed when faced with unreliable channel environment, whereas most of multi-channel schemes do not focus on neighbor discovery in low duty cycle wireless networks. The key challenge for multi-channel slotted neighbor discovery is how to effectively assign the channel during each active slot. We propose McDisc, an energy-efficient and reliable duty-cycle-based neighbor discovery protocol that is built on two basic idea. First, it leverages randomized approach to establish the multi-channel discovery schedule, where the node is assigned to the chosen channel during each active slot randomly. Randomized approach may suffer from extremely low discovery probability in worst case. In tackling this problem, we then employ deterministic channel assignment that can ensure bounded discovery latency. The theoretical analysis and simulation results confirm that McDisc can cope with unreliable channel environment ensuring reliable and low latency discovery efficiently. In terms of 60% packet loss ratio, McDisc outperforms U-Connect [1] by approximate 100% in the worst-case discovery latency.
McDisc:低占空比和多通道无线网络中的可靠邻居发现协议
邻居发现是许多移动应用程序的第一步。以往使用单通道的邻居发现协议在面对不可靠的信道环境时可能会失败,而在低占空比无线网络中,大多数多通道协议都不关注邻居发现。多通道槽邻居发现面临的关键挑战是如何在每个活动槽期间有效地分配信道。McDisc是一种基于两个基本思想的节能可靠的基于占空比的邻居发现协议。首先,它利用随机方法建立多通道发现调度,在每个活动时隙中随机将节点分配给所选的通道。在最坏的情况下,随机化方法的发现概率极低。为了解决这个问题,我们采用确定性信道分配,以确保有限的发现延迟。理论分析和仿真结果表明,McDisc能够有效地应对不可靠的信道环境,保证发现的可靠性和低延迟。在60%的丢包率方面,McDisc在最坏情况下的发现延迟比U-Connect[1]高出约100%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信