Roteamento baseado em centralidade para redes sensores sem fio

Abstract

The use of topological features, more specifically, the importance of an element related to its structural position is a subject widely studied. For instance, complex networks theory provides some general use centrality measures that have been applied in a large variety of knowledge fields. This work aims to use centrality information in the design of routing algorithms for Wireless Sensor Networks (WSN). In this context, we propose two new topological measures, the Sink Stress, and Sink Betweenness, distributed algorithms to calculate them, and devise tree-based routing algorithms that take advantage of them. Simulations comparing the proposed approach with some of the most efficient data fusion algorithms from the literature, show that the proposed tree algorithms generate consistent quality trees, using a significantly smaller number of messages in the construction of the tree.