Top-k Query Processing and Malicious Node Identification Based on Node Grouping in MANETs
In mobile ad hoc networks (MANETs), it is effective to retrieve data items using top-k query. However, accurate results may not be acquired in environments when malicious nodes are present. In this paper, we assume that malicious nodes attempt to replace necessary data items with unnecessary ones (w...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2016-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/7433393/ |
| _version_ | 1818619827090096128 |
|---|---|
| author | Takuji Tsuda Yuka Komai Takahiro Hara Shojiro Nishio |
| author_facet | Takuji Tsuda Yuka Komai Takahiro Hara Shojiro Nishio |
| author_sort | Takuji Tsuda |
| collection | DOAJ |
| description | In mobile ad hoc networks (MANETs), it is effective to retrieve data items using top-k query. However, accurate results may not be acquired in environments when malicious nodes are present. In this paper, we assume that malicious nodes attempt to replace necessary data items with unnecessary ones (we call these data replacement attacks), and propose methods for top-k query processing and malicious node identification based on node grouping in MANETs. In order to maintain the accuracy of the query result, nodes reply with k data items with the highest score along multiple routes, and the query-issuing node tries to detect attacks from the information attached to the reply messages. After detecting attacks, the query-issuing node tries to identify the malicious nodes through message exchanges with other nodes. When multiple malicious nodes are present, the query-issuing node may not be able to identify all malicious nodes at a single query. It is effective for a node to share information about the identified malicious nodes with other nodes. In our method, each node divides all nodes into groups by using the similarity of the information about the identified malicious nodes. Then, it identifies malicious nodes based on the information on the groups. We conduct simulation experiments by using a network simulator, QualNet5.2, to verify that our method achieves high accuracy of the query result and identifies malicious nodes. |
| first_indexed | 2024-12-16T17:43:40Z |
| format | Article |
| id | doaj.art-ed85074e321b4645b2d302b987febd1f |
| institution | Directory Open Access Journal |
| issn | 2169-3536 |
| language | English |
| last_indexed | 2024-12-16T17:43:40Z |
| publishDate | 2016-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Access |
| spelling | doaj.art-ed85074e321b4645b2d302b987febd1f2022-12-21T22:22:31ZengIEEEIEEE Access2169-35362016-01-014993100710.1109/ACCESS.2016.25418647433393Top-k Query Processing and Malicious Node Identification Based on Node Grouping in MANETsTakuji Tsuda0Yuka Komai1Takahiro Hara2Shojiro Nishio3Department of Multimedia EngineeringGraduate School of Information Science and Technology, Osaka University, Osaka, JapanDepartment of Multimedia EngineeringGraduate School of Information Science and Technology, Osaka University, Osaka, JapanDepartment of Multimedia EngineeringGraduate School of Information Science and Technology, Osaka University, Osaka, JapanDepartment of Multimedia EngineeringGraduate School of Information Science and Technology, Osaka University, Osaka, JapanIn mobile ad hoc networks (MANETs), it is effective to retrieve data items using top-k query. However, accurate results may not be acquired in environments when malicious nodes are present. In this paper, we assume that malicious nodes attempt to replace necessary data items with unnecessary ones (we call these data replacement attacks), and propose methods for top-k query processing and malicious node identification based on node grouping in MANETs. In order to maintain the accuracy of the query result, nodes reply with k data items with the highest score along multiple routes, and the query-issuing node tries to detect attacks from the information attached to the reply messages. After detecting attacks, the query-issuing node tries to identify the malicious nodes through message exchanges with other nodes. When multiple malicious nodes are present, the query-issuing node may not be able to identify all malicious nodes at a single query. It is effective for a node to share information about the identified malicious nodes with other nodes. In our method, each node divides all nodes into groups by using the similarity of the information about the identified malicious nodes. Then, it identifies malicious nodes based on the information on the groups. We conduct simulation experiments by using a network simulator, QualNet5.2, to verify that our method achieves high accuracy of the query result and identifies malicious nodes.https://ieeexplore.ieee.org/document/7433393/ad hoc networkstop-k query processingdata replacement attackgrouping |
| spellingShingle | Takuji Tsuda Yuka Komai Takahiro Hara Shojiro Nishio Top-k Query Processing and Malicious Node Identification Based on Node Grouping in MANETs IEEE Access ad hoc networks top-k query processing data replacement attack grouping |
| title | Top-k Query Processing and Malicious Node Identification Based on Node Grouping in MANETs |
| title_full | Top-k Query Processing and Malicious Node Identification Based on Node Grouping in MANETs |
| title_fullStr | Top-k Query Processing and Malicious Node Identification Based on Node Grouping in MANETs |
| title_full_unstemmed | Top-k Query Processing and Malicious Node Identification Based on Node Grouping in MANETs |
| title_short | Top-k Query Processing and Malicious Node Identification Based on Node Grouping in MANETs |
| title_sort | top k query processing and malicious node identification based on node grouping in manets |
| topic | ad hoc networks top-k query processing data replacement attack grouping |
| url | https://ieeexplore.ieee.org/document/7433393/ |
| work_keys_str_mv | AT takujitsuda topkqueryprocessingandmaliciousnodeidentificationbasedonnodegroupinginmanets AT yukakomai topkqueryprocessingandmaliciousnodeidentificationbasedonnodegroupinginmanets AT takahirohara topkqueryprocessingandmaliciousnodeidentificationbasedonnodegroupinginmanets AT shojironishio topkqueryprocessingandmaliciousnodeidentificationbasedonnodegroupinginmanets |