{'fraction_non_alphanumeric': 0.01569506726457399, 'fraction_numerical': 0.0029895366218236174, 'mean_word_length': 4.821739130434783, '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}}
Random Walk on Random Graph based Outlier Detection in Wireless Sensor Networks

Wireless Sensor Network (WSN) is characterized with limited battery power and limited computation capability. Sensor nodes which produce a data set that is different from their counter parts are called Outlier nodes. For example, in a particular room, if we expect temperature of 25degC and if we receive a temperature reading of 73degC. This is called outlier data and the node which produces this data is called outliers nodes. We are considering a system where user is interested only in outlier data. We assumed that outlier data is generated due to the ambiance parameter. We also assumed that instead of sending all the sensed data, nodes are required to send the outlier data in response to a query from the base station. In this paper we found that using traditional routing protocol for communications is not an optimum solution. Traditional routing protocols consume more memory and battery power in the route-request process. We have also suggested that use of "Random Walk on Random Graph Technique" reduces the overhead of transmitting packets. We have proved this with analysis and simulation. We argue that with random walk on random graph mechanism, energy consumption is minimized and numbers of packets flooded in the network is very less.