Εμφάνιση απλής εγγραφής

dc.creatorMaglaras, L. A.en
dc.creatorKatsaros, D.en
dc.date.accessioned2015-11-23T10:38:19Z
dc.date.available2015-11-23T10:38:19Z
dc.date.issued2009
dc.identifier10.1109/PCI.2009.12
dc.identifier.isbn9780769537887
dc.identifier.urihttp://hdl.handle.net/11615/30478
dc.description.abstractThis 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.en
dc.source.urihttp://www.scopus.com/inward/record.url?eid=2-s2.0-70849107144&partnerID=40&md5=47c5a8b59ece273efca6ae876ac27c0f
dc.subjectCentrality metricsen
dc.subjectLocalized algorithmsen
dc.subjectNetwork analysisen
dc.subjectNode rankingen
dc.subjectWireless sensor networksen
dc.subjectLocalized algorithmen
dc.subjectNeighborhood analysisen
dc.subjectPath-baseden
dc.subjectSpearman's rank correlation coefficientsen
dc.subjectAlgorithmsen
dc.subjectComputer peripheral equipmenten
dc.subjectElectric network analysisen
dc.subjectInterfaces (computer)en
dc.subjectSensor networksen
dc.subjectWireless telecommunication systemsen
dc.titleNew metrics for characterizing the significance of nodes in wireless networks via path-based neighborhood analysisen
dc.typeconferenceItemen


Αρχεία σε αυτό το τεκμήριο

ΑρχείαΜέγεθοςΤύποςΠροβολή

Δεν υπάρχουν αρχεία που να σχετίζονται με αυτό το τεκμήριο.

Αυτό το τεκμήριο εμφανίζεται στις ακόλουθες συλλογές

Εμφάνιση απλής εγγραφής