New Metrics for Characterizing the Significance of Nodes in Wireless Networks via Path-Based Neighborhood Analysis

Author

Maglaras, Leandros A. ; Katsaros, Dimitrios

Author_Institution

Dept. of Comput. & Commun. Eng., Univ. of Thessaly, Volos, Greece

fYear

2009

fDate

10-12 Sept. 2009

Firstpage

143

Lastpage

147

Abstract

This paper considers the problem of finding the most central nodes in neighborhoods of a given network with directed or undirected links taking into account only local information. An algorithm that calculates ranking, taking into account the n-hop neighborhood of each node is proposed. The method is compared to popular existing schemes for ranking, using Spearman´s rank correlation coefficient and other metrics. An extension to a faster algorithm which reduces the size of the examined network is described as well.

Keywords

telecommunication network topology; wireless sensor networks; Spearmans rank correlation coefficient; n-hop neighborhood; path-based neighborhood analysis; wireless networks; Bridges; Computer networks; Cooperative caching; Disruption tolerant networking; Informatics; Network topology; Social network services; Wireless application protocol; Wireless networks; Wireless sensor networks; Centrality metrics; localized algorithms; network analysis; node ranking; wireless sensor networks;

fLanguage

English

Publisher

ieee

Conference_Titel

Informatics, 2009. PCI '09. 13th Panhellenic Conference on

Conference_Location

Corfu

Print_ISBN

978-0-7695-3788-7

Type

conf

DOI

10.1109/PCI.2009.12

Filename

5298205