面向多网数据替换攻击的Top-k查询处理及恶意节点识别

Takuji Tsuda, Yuka Komai, Yuya Sasaki, T. Hara, S. Nishio
{"title":"面向多网数据替换攻击的Top-k查询处理及恶意节点识别","authors":"Takuji Tsuda, Yuka Komai, Yuya Sasaki, T. Hara, S. Nishio","doi":"10.1109/MDM.2014.40","DOIUrl":null,"url":null,"abstract":"In mobile ad hoc networks (MANETs), it is effective for mobile nodes to retrieve data items using top-k queries, in which data items are ordered according to a particular attribute score, and the query-issuing node acquires the data items with the k highest scores. However, accurate results may not be acquired in environments where malicious nodes are present. In top-k queries, it is important to neutralize attacks in which malicious nodes attempt to replace necessary data items with unnecessary ones (we call these, data replacement attacks). In this paper, we propose methods for top-k query processing and malicious node identification against data replacement attack in MANETs. In the top-k query processing method, in order to maintain accuracy of the query result, nodes reply with data items with the k highest scores, along multiple routes. Moreover, to enable detection of data replacement attacks, reply messages include information on the route along which reply messages are forwarded, and thus the query-issuing node can know the data items that properly belong to the message. In the malicious node identification method, the query-issuing node first narrows down the malicious node candidates, using the received message information, and then requests information on the data items sent by these candidates. In this way, the query-issuing node can identify the malicious node. Finally, we verify, through simulation experiments, that the proposed top-k query processing method achieves high accuracy of the query result, and that the malicious node identification method effectively identifies a malicious node.","PeriodicalId":322071,"journal":{"name":"2014 IEEE 15th International Conference on Mobile Data Management","volume":"34 44 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Top-k Query Processing and Malicious Node Identification against Data Replacement Attack in MANETs\",\"authors\":\"Takuji Tsuda, Yuka Komai, Yuya Sasaki, T. Hara, S. Nishio\",\"doi\":\"10.1109/MDM.2014.40\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In mobile ad hoc networks (MANETs), it is effective for mobile nodes to retrieve data items using top-k queries, in which data items are ordered according to a particular attribute score, and the query-issuing node acquires the data items with the k highest scores. However, accurate results may not be acquired in environments where malicious nodes are present. In top-k queries, it is important to neutralize attacks in which malicious nodes attempt to replace necessary data items with unnecessary ones (we call these, data replacement attacks). In this paper, we propose methods for top-k query processing and malicious node identification against data replacement attack in MANETs. In the top-k query processing method, in order to maintain accuracy of the query result, nodes reply with data items with the k highest scores, along multiple routes. Moreover, to enable detection of data replacement attacks, reply messages include information on the route along which reply messages are forwarded, and thus the query-issuing node can know the data items that properly belong to the message. In the malicious node identification method, the query-issuing node first narrows down the malicious node candidates, using the received message information, and then requests information on the data items sent by these candidates. In this way, the query-issuing node can identify the malicious node. Finally, we verify, through simulation experiments, that the proposed top-k query processing method achieves high accuracy of the query result, and that the malicious node identification method effectively identifies a malicious node.\",\"PeriodicalId\":322071,\"journal\":{\"name\":\"2014 IEEE 15th International Conference on Mobile Data Management\",\"volume\":\"34 44 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-07-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 IEEE 15th International Conference on Mobile Data Management\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MDM.2014.40\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE 15th International Conference on Mobile Data Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MDM.2014.40","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

摘要

在移动自组织网络(manet)中,移动节点使用top-k查询来检索数据项是有效的,其中数据项根据特定的属性得分排序,查询发出节点获取得分最高的k个数据项。然而,在存在恶意节点的环境中可能无法获得准确的结果。在top-k查询中,重要的是要消除恶意节点试图用不必要的数据项替换必要数据项的攻击(我们称之为数据替换攻击)。在本文中,我们提出了针对manet中数据替换攻击的top-k查询处理和恶意节点识别方法。在top-k查询处理方法中,为了保持查询结果的准确性,节点会沿着多条路径回复得分最高的k个数据项。此外,为了检测数据替换攻击,应答消息中包含了应答消息转发的路由信息,这样,查询发出节点就可以知道哪些数据项属于该消息。在恶意节点识别方法中,查询发布节点首先利用接收到的消息信息缩小恶意节点候选范围,然后请求这些候选节点发送的数据项的信息。这样,发出查询的节点就可以识别出恶意节点。最后,通过仿真实验验证了所提出的top-k查询处理方法对查询结果的准确率较高,恶意节点识别方法对恶意节点的识别效果较好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Top-k Query Processing and Malicious Node Identification against Data Replacement Attack in MANETs
In mobile ad hoc networks (MANETs), it is effective for mobile nodes to retrieve data items using top-k queries, in which data items are ordered according to a particular attribute score, and the query-issuing node acquires the data items with the k highest scores. However, accurate results may not be acquired in environments where malicious nodes are present. In top-k queries, it is important to neutralize attacks in which malicious nodes attempt to replace necessary data items with unnecessary ones (we call these, data replacement attacks). In this paper, we propose methods for top-k query processing and malicious node identification against data replacement attack in MANETs. In the top-k query processing method, in order to maintain accuracy of the query result, nodes reply with data items with the k highest scores, along multiple routes. Moreover, to enable detection of data replacement attacks, reply messages include information on the route along which reply messages are forwarded, and thus the query-issuing node can know the data items that properly belong to the message. In the malicious node identification method, the query-issuing node first narrows down the malicious node candidates, using the received message information, and then requests information on the data items sent by these candidates. In this way, the query-issuing node can identify the malicious node. Finally, we verify, through simulation experiments, that the proposed top-k query processing method achieves high accuracy of the query result, and that the malicious node identification method effectively identifies a malicious node.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信