DocumentCode :
3433131
Title :
Centrality-based routing for Wireless Sensor Networks
Author :
Oliveira, Eduardo M R ; Ramos, Heitor S. ; Loureiro, Antonio A F
Author_Institution :
Dept. of Comput. Sci., Fed. Univ. of Minas Gerais, Belo Horizonte, Brazil
fYear :
2010
fDate :
20-22 Oct. 2010
Firstpage :
1
Lastpage :
5
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 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 tree-based algorithm improves the routing overlap, favoring data fusion.
Keywords :
telecommunication network routing; wireless sensor networks; Sink Betweenness; Tree-based routing algorithm; centrality-based routing; data fusion; routing algorithms design; wireless sensor networks; Arrays; Complex networks; Context; Distributed algorithms; Measurement; Routing; Wireless sensor networks; Wireless sensor networks; centrality metrics; complex networks; routing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Wireless Days (WD), 2010 IFIP
Conference_Location :
Venice
ISSN :
2156-9711
Print_ISBN :
978-1-4244-9230-5
Electronic_ISBN :
2156-9711
Type :
conf
DOI :
10.1109/WD.2010.5657731
Filename :
5657731
Link To Document :
بازگشت