联合我们发现:使移动设备能够合作,有效地发现邻居

Mehedi Bakht, John Carlson, A. Loeb, R. Kravets
{"title":"联合我们发现:使移动设备能够合作,有效地发现邻居","authors":"Mehedi Bakht, John Carlson, A. Loeb, R. Kravets","doi":"10.1145/2162081.2162097","DOIUrl":null,"url":null,"abstract":"The recent surge in the use of mobile devices have opened up new avenues for communication. While most existing applications designed to exploit this potential are infrastructure based, there is a growing trend to leverage physical proximity between end-users to enable direct peer-to-peer communication. However, the success of these applications relies on the ability to efficiently detect contact opportunities, Devices that participate in such opportunistic communication often come equipped with multiple radios. For an individual node, performing neighbor discovery can be too expensive with a high-power, long-range radio (e.g., Wi-Fi). On the other hand, relying only on a low-power, short-range radio for detecting neighbors results in significantly fewer available contacts. To mitigate this problem, we have developed CQuest, a novel scheme for more efficient long-range neighbor discovery that leverages the clustering of nodes as well as the radio heterogeneity of mobile devices. The basic idea is that coordination over a low-power, short-range radio can help clustered nodes distribute the load of high-power, long-range scanning. We present results from extensive simulation that shows CQuest discovers significantly more contacts than a low-power only scheme but without incurring the high energy cost usually associated with long-range discovery. We also present results and experience from a successful implementation of the protocol on a testbed of Android G1/G2 phones that shows the feasibility of the protocol in a real network.","PeriodicalId":88972,"journal":{"name":"Proceedings. IEEE Workshop on Mobile Computing Systems and Applications","volume":"15 1","pages":"11"},"PeriodicalIF":0.0000,"publicationDate":"2012-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":"{\"title\":\"United we find: enabling mobile devices to cooperate for efficient neighbor discovery\",\"authors\":\"Mehedi Bakht, John Carlson, A. Loeb, R. Kravets\",\"doi\":\"10.1145/2162081.2162097\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The recent surge in the use of mobile devices have opened up new avenues for communication. While most existing applications designed to exploit this potential are infrastructure based, there is a growing trend to leverage physical proximity between end-users to enable direct peer-to-peer communication. However, the success of these applications relies on the ability to efficiently detect contact opportunities, Devices that participate in such opportunistic communication often come equipped with multiple radios. For an individual node, performing neighbor discovery can be too expensive with a high-power, long-range radio (e.g., Wi-Fi). On the other hand, relying only on a low-power, short-range radio for detecting neighbors results in significantly fewer available contacts. To mitigate this problem, we have developed CQuest, a novel scheme for more efficient long-range neighbor discovery that leverages the clustering of nodes as well as the radio heterogeneity of mobile devices. The basic idea is that coordination over a low-power, short-range radio can help clustered nodes distribute the load of high-power, long-range scanning. We present results from extensive simulation that shows CQuest discovers significantly more contacts than a low-power only scheme but without incurring the high energy cost usually associated with long-range discovery. We also present results and experience from a successful implementation of the protocol on a testbed of Android G1/G2 phones that shows the feasibility of the protocol in a real network.\",\"PeriodicalId\":88972,\"journal\":{\"name\":\"Proceedings. IEEE Workshop on Mobile Computing Systems and Applications\",\"volume\":\"15 1\",\"pages\":\"11\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-02-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"16\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. IEEE Workshop on Mobile Computing Systems and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2162081.2162097\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. IEEE Workshop on Mobile Computing Systems and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2162081.2162097","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 16

摘要

最近移动设备使用的激增为交流开辟了新的途径。虽然大多数旨在利用这一潜力的现有应用程序都是基于基础设施的,但利用最终用户之间的物理接近性来实现直接点对点通信的趋势正在增长。然而,这些应用的成功依赖于有效检测接触机会的能力,参与这种机会性通信的设备通常配备有多个无线电。对于单个节点,使用大功率、远程无线电(例如Wi-Fi)执行邻居发现可能过于昂贵。另一方面,仅依靠低功率、短距离无线电来探测邻居会导致可用的接触明显减少。为了缓解这个问题,我们开发了CQuest,这是一种利用节点集群和移动设备无线电异构性的更有效的远程邻居发现的新方案。其基本思想是,通过低功率、短程无线电进行协调,可以帮助集群节点分配高功率、远程扫描的负载。我们从广泛的模拟中得出的结果表明,CQuest比低功耗方案发现更多的接触,但不会产生通常与远程发现相关的高能量成本。我们还介绍了在Android G1/G2手机测试平台上成功实现该协议的结果和经验,证明了该协议在真实网络中的可行性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
United we find: enabling mobile devices to cooperate for efficient neighbor discovery
The recent surge in the use of mobile devices have opened up new avenues for communication. While most existing applications designed to exploit this potential are infrastructure based, there is a growing trend to leverage physical proximity between end-users to enable direct peer-to-peer communication. However, the success of these applications relies on the ability to efficiently detect contact opportunities, Devices that participate in such opportunistic communication often come equipped with multiple radios. For an individual node, performing neighbor discovery can be too expensive with a high-power, long-range radio (e.g., Wi-Fi). On the other hand, relying only on a low-power, short-range radio for detecting neighbors results in significantly fewer available contacts. To mitigate this problem, we have developed CQuest, a novel scheme for more efficient long-range neighbor discovery that leverages the clustering of nodes as well as the radio heterogeneity of mobile devices. The basic idea is that coordination over a low-power, short-range radio can help clustered nodes distribute the load of high-power, long-range scanning. We present results from extensive simulation that shows CQuest discovers significantly more contacts than a low-power only scheme but without incurring the high energy cost usually associated with long-range discovery. We also present results and experience from a successful implementation of the protocol on a testbed of Android G1/G2 phones that shows the feasibility of the protocol in a real network.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
HotMobile '22: The 23rd International Workshop on Mobile Computing Systems and Applications, Tempe, Arizona, USA, March 9 - 10, 2022 Splitting the bill for mobile data with SIMlets Quantifying the potential of ride-sharing using call description records Enabling the transition to the mobile web with WebSieve The case for psychological computing
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1