Node Clustering in Wireless Sensor Networks by Considering Structural Characteristics of the Network Graph.
Nikos DimokasDimitrios KatsarosYannis ManolopoulosPublished in: ITNG (2007)
Keyphrases
- wireless sensor networks
- neighboring nodes
- transmission range
- sink node
- mobile nodes
- graph structure
- topology control
- directed graph
- node selection
- overlapping communities
- residual energy
- energy consumption
- densely connected
- graph theoretic
- routing protocol
- path length
- finding the shortest path
- data gathering
- graph clustering
- source node
- energy efficient
- malicious nodes
- sensor networks
- energy efficiency
- k means
- routing algorithm
- clustering algorithm
- clustering method
- multi hop
- intermediate nodes
- computer networks
- undirected graph
- wireless sensor nodes
- edge weights
- sensor nodes
- weighted graph
- network structure
- graph theory
- strongly connected
- graph model
- small world networks
- wireless communication
- wireless networks
- data points
- heterogeneous social networks
- key management
- data transmission
- graph partitioning
- graph mining
- base station
- bipartite graph
- communication networks
- random graphs
- clustering coefficient
- small world
- network connectivity
- hidden nodes
- shortest path
- network management
- community discovery
- spanning tree
- network nodes