一种高效的车联网协同视频监控服务邻居发现方法

Taekeun Park, Suk-Kyoon Lee
{"title":"一种高效的车联网协同视频监控服务邻居发现方法","authors":"Taekeun Park, Suk-Kyoon Lee","doi":"10.9716/KITS.2016.15.4.097","DOIUrl":null,"url":null,"abstract":"The rapid deployment of millions of mobile sensors and smart devices has resulted in high demand for opportunistic encounter-based networking. For the cooperative video surveillance of dashboard cameras in nearby vehicles, a fast and energy-efficient asynchronous neighbor discovery protocol is indispensable because a dashboard camera is an energy-hungry device after the vehicle's engine has turned off. In the existing asynchronous neighbor discovery protocols, all nodes always try to discover all neighbors. However, a dashboard camera needs to discover nearby dashboard cameras when an event is detected. In this paper, we propose a fast and energy-efficient asynchronous neighbor discovery protocol, which enables nodes : 1) to have different roles in neighbor discovery, 2) to discover neighbors within a search range, and 3) to report promptly the exact discovery result. The proposed protocol has two modes: periodic wake-up mode and active discovery mode. A node begins with the periodic wake-up mode to be discovered by other nodes, switches to the active discovery mode on receiving a neighbor discovery request, and returns to the periodic wake-up mode when the active discovery mode finishes. In the periodic wake-up mode, a node wakes up at multiples of number α , where α is determined by the node’s remaining battery power. In the active discovery mode, a node wakes up for consecutive γ slots. Then, the node operating in the active discovery mode can discover all neighbors waking up at multiples of β for β ≤ γ within γ time slots. Since the proposed protocol assigns one half of the duty cycle to each mode, it consumes equal to or less energy than the existing protocols. A performance comparison shows that the proposed protocol outperforms the existing protocols in terms of discovery latency and energy consumption, where the frequency of neighbor discovery requests by car accidents is not constantly high.","PeriodicalId":272384,"journal":{"name":"Journal of the Korea society of IT services","volume":"49 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An Efficient Neighbor Discovery Method for Cooperative Video Surveillance Services in Internet of Vehicles\",\"authors\":\"Taekeun Park, Suk-Kyoon Lee\",\"doi\":\"10.9716/KITS.2016.15.4.097\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The rapid deployment of millions of mobile sensors and smart devices has resulted in high demand for opportunistic encounter-based networking. For the cooperative video surveillance of dashboard cameras in nearby vehicles, a fast and energy-efficient asynchronous neighbor discovery protocol is indispensable because a dashboard camera is an energy-hungry device after the vehicle's engine has turned off. In the existing asynchronous neighbor discovery protocols, all nodes always try to discover all neighbors. However, a dashboard camera needs to discover nearby dashboard cameras when an event is detected. In this paper, we propose a fast and energy-efficient asynchronous neighbor discovery protocol, which enables nodes : 1) to have different roles in neighbor discovery, 2) to discover neighbors within a search range, and 3) to report promptly the exact discovery result. The proposed protocol has two modes: periodic wake-up mode and active discovery mode. A node begins with the periodic wake-up mode to be discovered by other nodes, switches to the active discovery mode on receiving a neighbor discovery request, and returns to the periodic wake-up mode when the active discovery mode finishes. In the periodic wake-up mode, a node wakes up at multiples of number α , where α is determined by the node’s remaining battery power. In the active discovery mode, a node wakes up for consecutive γ slots. Then, the node operating in the active discovery mode can discover all neighbors waking up at multiples of β for β ≤ γ within γ time slots. Since the proposed protocol assigns one half of the duty cycle to each mode, it consumes equal to or less energy than the existing protocols. A performance comparison shows that the proposed protocol outperforms the existing protocols in terms of discovery latency and energy consumption, where the frequency of neighbor discovery requests by car accidents is not constantly high.\",\"PeriodicalId\":272384,\"journal\":{\"name\":\"Journal of the Korea society of IT services\",\"volume\":\"49 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-12-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of the Korea society of IT services\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.9716/KITS.2016.15.4.097\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of the Korea society of IT services","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.9716/KITS.2016.15.4.097","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

数以百万计的移动传感器和智能设备的快速部署导致了对基于机会遭遇的网络的高需求。由于仪表盘摄像头是车辆熄火后的耗能设备,因此对于附近车辆仪表盘摄像头的协同视频监控来说,一种快速、节能的异步邻居发现协议必不可少。在现有的异步邻居发现协议中,所有节点总是尝试发现所有邻居。然而,当检测到事件时,仪表板摄像头需要发现附近的仪表板摄像头。本文提出了一种快速、节能的异步邻居发现协议,该协议使节点能够:1)在邻居发现中扮演不同的角色,2)在搜索范围内发现邻居,3)及时报告准确的发现结果。该协议有两种模式:周期性唤醒模式和主动发现模式。节点以等待其他节点发现的周期唤醒模式开始,收到邻居发现请求后切换到主动发现模式,主动发现模式结束后返回到周期唤醒模式。在周期性唤醒模式中,节点以数α的倍数唤醒,其中α由节点的剩余电池电量决定。在主动发现模式下,一个节点在连续的γ个槽中被唤醒。然后,在主动发现模式下工作的节点可以发现所有在γ个时隙内以β的倍数唤醒的β≤γ的邻居。由于该协议为每种模式分配了一半的占空比,因此它消耗的能量等于或低于现有协议。性能比较表明,在车祸邻居发现请求的频率不是一直很高的情况下,所提出的协议在发现延迟和能耗方面优于现有协议。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Efficient Neighbor Discovery Method for Cooperative Video Surveillance Services in Internet of Vehicles
The rapid deployment of millions of mobile sensors and smart devices has resulted in high demand for opportunistic encounter-based networking. For the cooperative video surveillance of dashboard cameras in nearby vehicles, a fast and energy-efficient asynchronous neighbor discovery protocol is indispensable because a dashboard camera is an energy-hungry device after the vehicle's engine has turned off. In the existing asynchronous neighbor discovery protocols, all nodes always try to discover all neighbors. However, a dashboard camera needs to discover nearby dashboard cameras when an event is detected. In this paper, we propose a fast and energy-efficient asynchronous neighbor discovery protocol, which enables nodes : 1) to have different roles in neighbor discovery, 2) to discover neighbors within a search range, and 3) to report promptly the exact discovery result. The proposed protocol has two modes: periodic wake-up mode and active discovery mode. A node begins with the periodic wake-up mode to be discovered by other nodes, switches to the active discovery mode on receiving a neighbor discovery request, and returns to the periodic wake-up mode when the active discovery mode finishes. In the periodic wake-up mode, a node wakes up at multiples of number α , where α is determined by the node’s remaining battery power. In the active discovery mode, a node wakes up for consecutive γ slots. Then, the node operating in the active discovery mode can discover all neighbors waking up at multiples of β for β ≤ γ within γ time slots. Since the proposed protocol assigns one half of the duty cycle to each mode, it consumes equal to or less energy than the existing protocols. A performance comparison shows that the proposed protocol outperforms the existing protocols in terms of discovery latency and energy consumption, where the frequency of neighbor discovery requests by car accidents is not constantly high.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信