Centrality-based routing for Wireless Sensor Networks

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 of centrality measures that have been applied to 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 a new topological measure, the Sink Betweenness, a distributed algorithm to calculate it, and devise a tree-based routing algorithm that takes advantage of it. Simulations comparing our approach to some well-known algorithms show that our treebased algorithm improves the routing overlap, favoring data fusion.

• Type: Journal
• Year: 2010
• Where: WD
• Authors: Eduardo M. R. Oliveira, Heitor S. Ramos, Antonio Alfredo Ferreira Loureiro
• Keywords: Algorithm, Routing, Tree-based Routing Algorithm, WD 2010, Wireless Networks