Name
Abstract | ||
|---|---|---|
We present a systematic approach to selecting cluster heads (CHs) in networked sensing systems for data aggregation based on the idea of dominating sets of a graph. A set of vertices, D of a graph G=(V,E) is a k-dominating set if every vertex v@?V, is connected to some vertex in D via path of length less than or equal to k. By focusing on regular mesh topologies, in which each node has q neighbors, q=3,4,6,8, we demonstrate an intuitive approach for identifying the CHs. If E is the energy required for a node to send a message to a collection point, e is the energy required to send a similar message to its adjacent node in the system, and C is the compression ratio achieved by aggregation techniques at a CH, we show that CHs selected in our approach are viable whenever k |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1016/j.jnca.2012.01.018 | J. Network and Computer Applications |
Keywords | DocType | Volume |
data collection,systematic approach,k-dominating set,intuitive approach,collection point,aggregation technique,cluster head,similar message,graph G,systematic selection,adjacent node,vertex v | Journal | 35 |
Issue | ISSN | Citations |
5 | 1084-8045 | 1 |
PageRank | References | Authors |
0.36 | 24 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kranthi K. Mamidisetty | 1 | 7 | 1.19 |
| Michael J. Ferrara | 2 | 16 | 2.88 |
| Shivakumar Sastry | 3 | 79 | 13.63 |