New metrics for characterizing the significance of nodes in wireless networks via path-based neighborhood analysis
Data
2009Soggetto
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 nhop 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. © 2009 IEEE.
Collections
Related items
Showing items related by title, author, creator and subject.
-
CONTENT project: Considerations towards a cloud-based internetworking paradigm
(2013)Although cloud computing and the Software Defined Network (SDN) framework are fundamentally changing the way we think about network services, multi-domain and multitechnology problems are not sufficiently investigated. ... -
Backbone formation in military multi-layer ad hoc networks using complex network concepts
(2016)Modern battlefields are characterized by increasing deployment of ad hoc communications among allied entities. These networks can be seen as a complex multi-layer ad hoc network, where each layer may be an independently ... -
Query sensitive storage for wireless sensor networks
(2009)Storage management in wireless sensor networks is an area that has started to attract significant attention, and several methods have been proposed, such as Local Storage (LS), Data-Centric Storage (DCS) and more recently ...