Temporal and spatial correlation in the sensed data in wireless distributed sensor networks gives room for better energy efficiency in the network. Several data aggregation schemes have been suggested in the literature. However a clear-cut solution which quantitatively describes most energy-efficient routing scheme is still lacking. In this paper, we propose a novel, generalized clustering-based aggregation scheme, called "annular slicing-based clustering (ASC)" and show that by varying the cluster size and the distribution of clusters in the deployment area, one can approach the most energy-efficient aggregation scheme. Analytical expressions for the optimal cluster size and distribution have been arrived at, for a specific correlation model and a cost function based on the Euclidean distance traversed by the transmitted data. With the help of numerical simulation, it has been found that the proposed aggregation technique can achieve optimality over a wide range of correlation
[1]
Miroslav Chlebík,et al.
Approximation Hardness of the Steiner Tree Problem on Graphs
,
2002,
SWAT.
[2]
Brad Karp,et al.
GPSR : Greedy Perimeter Stateless Routing for Wireless
,
2000,
MobiCom 2000.
[3]
Michael L. Overton,et al.
Two Heuristics for the Steiner Tree
,
1996
.
[4]
Baltasar Beferull-Lozano,et al.
Networked Slepian-Wolf: theory, algorithms, and scaling laws
,
2005,
IEEE Transactions on Information Theory.
[5]
Baltasar Beferull-Lozano,et al.
On network correlated data gathering
,
2004,
IEEE INFOCOM 2004.
[6]
Derek R. Dreyer,et al.
Two Heuristics for the Euclidean Steiner Tree Problem
,
1998,
J. Glob. Optim..
[7]
Steven Skiena,et al.
The Algorithm Design Manual
,
2020,
Texts in Computer Science.