{'fraction_non_alphanumeric': 0.01741884402216944, 'fraction_numerical': 0.0, 'mean_word_length': 5.288557213930348, '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}}
Realization of centrality measure on Wireless Sensor Network

The routing algorithms for wireless sensor networks (WSN) are in process of optimization for addressing issues like energy conservation, delay and throughput in presence of limited resources in terms of memory, CPU processing power and power source (batteries). Although, it has not been possible to date, a development of routing algorithm addressing all the issues of WSN. Various tradeoffs exists between different routing algorithms. Network analysis metric ‘centrality’, has been found to be a useful parameter used in judging the importance of a vertex, a network node, for its contribution towards data routing in the network. Betweenness centrality metric has been used in this research paper to develop a routing algorithm for Wireless Sensor Networks and therefore a network structure has been developed on the fly based on Betweenness values of nodes neighbors. The Betweenness centrality allows to identify nodes in the network having brokerage role and hence they can be equipped with extra resources like battery power. The routing algorithm developed has been programmed and tested on real hardware (test bed) and data routing is performed by each node based on the algorithm developed.