{'fraction_non_alphanumeric': 0.021709633649932156, 'fraction_numerical': 0.0, 'mean_word_length': 4.548872180451128, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A survey on top-k query processing in MANETs

In mobile ad hoc networks (MANET), each node can move freely and communicate with each other in the network. The main challenges are to reduce the traffic that occurs when large amount of data is transmitted and to provide the high accuracy of transmitted data. To acquire only necessary data items, each mobile node can effectively retrieve data items using a top-k query. However, the transmission of query messages and replies from each mobile node will cause high traffic. Some techniques are provided to reduce the number of candidates in the top-k query. This paper deals with the process of top-k query, routing methods and the mechanisms that are proposed to overcome the challenges.