Top-k Query Processing and Malicious Node Identification Based on Node Grouping in MANETs

Abstract

Recovering data items using top-k query is effective in mobile ad hoc networks (MANETs).
However, when malicious nodes are present, accurate results may not be obtained in environments.we assume that malicious nodes attempt to replace unnecessary data items (we call these data replacement attacks) and propose methods for top-k query processing and malicious node identification based on MANET node grouping.

Projects on Top-k Query Processing  Nodes reply with k data items with the highest score along multiple routes to maintain the accuracy of the query result, and the query-issuing node attempts to detect attacks from the information attached to the reply messages.

After detecting attacks, the query-issuing node attempts to identify the malicious nodes by exchanging messages with other nodes. When multiple malicious nodes are present, the query-issuing node may not be able to identify all malicious nodes in a single query.

Introduction

Top-k Query Processing and Malicious Recently, there has been an increasing interest in mobile ad hoc network (MANET), which is constructed by only mobile nodes.Since such self-distributed networks do not require pre-existing base stations, it is expected that they will apply to different situations such as military affairs and disaster rescue work.

Conclusion

Projects on Top-k Query Processing  We proposed methods for top-k query processing and the identification of malicious nodes based on MANET node grouping.Nodes reply with k data items with the highest score along multiple routes in order to maintain high accuracy of the query result and detect attacks.
Projects reports on Top-k Query Processing After detecting attacks, the query-issuing node narrows down the malicious node candidates and then tries to identify the malicious nodes by exchanging messages with other nodes.