摘要
消息认证是保证信息安全性与可靠性的重要方法,然而在车辆密度很大的车联网环境中,由于节点接收到的消息数量很大,因此常常会产生认证时延,导致周边节点发来的许多重要消息丢失。为了解决这一问题,文章使用基于k-d树剪枝的k-means算法,我们把它称之为过滤算法,将收到的消息划分成若干个簇(消息区域),并映射到多优先级队列中,按照优先级的先后顺序认证,可降低重要消息的丢包率,加强消息认证的有效性。文章证明了过滤算法是一种快速高效的聚类算法,适用于对时间要求严格的车联网环境。
Message authentication is a major way to ensure the security and reliability of information transmission. However, the huge number of received messages should lead to the authentication delay, even the loss of important information. To address this issue, in this paper, we proposed a k-d tree pruning based algorithm, which is called filtering algorithm to divide the received messages into message areas to determine the information priority. Accordingly, the rate of packets loss can be reduced as well as the effectiveness of message authentication can be improved. Finally, we demonstrate that the filtering algorithm is fast and efficient, which is suitable for VANETs.
出处
《信息通信技术》
2017年第1期66-72,共7页
Information and communications Technologies
基金
国家自然科学基金资助项目(No.61571010
61471028)
