Heterogeneous multi-channel neighbor discovery formobile sensing applications: theoretical foundationand protocol design

Lin Chen, Kaigui Bian, M. Zheng
{"title":"Heterogeneous multi-channel neighbor discovery formobile sensing applications: theoretical foundationand protocol design","authors":"Lin Chen, Kaigui Bian, M. Zheng","doi":"10.1145/2632951.2632972","DOIUrl":null,"url":null,"abstract":"Neighbor discovery is of paramount importance in mobile sensing applications that rely heavily on data timely collected and shared among nearby users. Guaranteed discovery with bounded latency and supporting heterogenous duty cycles to provide fine-grained control of energy conservation levels are among the most crucial requirements in the design of efficient neighbor discovery protocols. While simultaneously satisfying these two requirements is non-trivial, the situation is exacerbated if the operating frequencies of mobile devices span multiple channels and discovery occurs only if nodes switch to the same channel. In this paper, we formulate this problem as heterogeneous multi-channel neighbor discovery problem and establish a theoretical framework of the problem, under which we derive the performance bound of any neighbor discovery protocol. Based on the theoretical results, we then develop Mc-Dis (Multi-channel Discovery), a novel multi-channel discovery protocol that (1) achieves guaranteed discovery with order-minimal worst-case discovery delay and (2) supports almost all duty cycles to provide fine-grained control of energy conservation levels.","PeriodicalId":425643,"journal":{"name":"ACM Interational Symposium on Mobile Ad Hoc Networking and Computing","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Interational Symposium on Mobile Ad Hoc Networking and Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2632951.2632972","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 15

Abstract

Neighbor discovery is of paramount importance in mobile sensing applications that rely heavily on data timely collected and shared among nearby users. Guaranteed discovery with bounded latency and supporting heterogenous duty cycles to provide fine-grained control of energy conservation levels are among the most crucial requirements in the design of efficient neighbor discovery protocols. While simultaneously satisfying these two requirements is non-trivial, the situation is exacerbated if the operating frequencies of mobile devices span multiple channels and discovery occurs only if nodes switch to the same channel. In this paper, we formulate this problem as heterogeneous multi-channel neighbor discovery problem and establish a theoretical framework of the problem, under which we derive the performance bound of any neighbor discovery protocol. Based on the theoretical results, we then develop Mc-Dis (Multi-channel Discovery), a novel multi-channel discovery protocol that (1) achieves guaranteed discovery with order-minimal worst-case discovery delay and (2) supports almost all duty cycles to provide fine-grained control of energy conservation levels.
移动传感应用的异构多通道邻居发现:理论基础和协议设计
邻居发现在移动传感应用中是至关重要的,它严重依赖于及时收集和在附近用户之间共享的数据。在设计高效的邻居发现协议时,具有有限延迟的保证发现和支持异构占空比以提供对节能级别的细粒度控制是最关键的要求。虽然同时满足这两个要求并非易事,但如果移动设备的工作频率跨越多个信道,并且只有在节点切换到同一信道时才会发现,情况就会恶化。本文将该问题表述为异构多通道邻居发现问题,建立了该问题的理论框架,并在此框架下推导了任意邻居发现协议的性能界。基于理论结果,我们开发了Mc-Dis(多通道发现),这是一种新的多通道发现协议,它(1)以最小的最坏情况发现延迟实现有保证的发现,(2)支持几乎所有占空比,以提供对节能水平的细粒度控制。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信