Defining Minimum Requirements of Inter-Collaborated Nodes by Measuring the Weight of Node Interactions.
Stelios SotiriadisNik BessisYe HuangPaul SantCarsten MaplePublished in: Int. J. Distributed Syst. Technol. (2011)
Keyphrases
- hidden nodes
- edge weights
- directed graph
- graph structure
- neighboring nodes
- intermediate nodes
- root node
- spanning tree
- minimum cost
- undirected graph
- node selection
- leaf nodes
- tree nodes
- shortest distance
- sink node
- destination node
- network nodes
- shortest path
- overlapping communities
- malicious nodes
- mobile nodes
- centrality measures
- nodes of a graph
- weighted graph
- black hole
- path length
- labeling scheme
- finding the shortest path
- node failures
- random walk
- tree structure
- energy consumption
- message exchange
- dominating set
- wireless networks
- betweenness centrality
- approximation algorithms
- search tree
- topology control
- source node
- strongly connected
- interaction model