{'fraction_non_alphanumeric': 0.015312131919905771, 'fraction_numerical': 0.0, 'mean_word_length': 5.343283582089552, '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}}
In-Network Distributed Algorithm for Energy Optimal Routing Based on Dual Decomposition of Linear Programming

This work proposes an in-network distributed algorithm for the energy optimal routing in a wireless sensor network. The routing problem is described as a minimum-cost multi-commodity network flow problem by Linear programming. Based on the convex programming theory we use the dual decomposition theorem to derive the distributed algorithm on a mathematical basic. The algorithm computes the exact energy optimal routing in the network without any central node or the knowledge about the whole network structure, using only peer-to-peer communication between neighboring nodes. In contrast to other works in this area, the presented approach is not limited to strictly convex objective functions and it handles linear objective functions.