Effect of partially correlated data on clustering in wireless sensor networks

In wireless sensor networks, clustering allows the aggregation of sensor data. It is well known that leveraging the correlation between different samples of the observed data will lead to better utilization of energy reserve. However, no previous work has analyzed the effect of non-ideal data aggregation in multi-hop sensor networks. In this paper, we propose a novel analytical framework to study how partially correlated data affect the performance of clustering algorithms. We analyze the behavior of multi-hop routing and, by combining random geometry techniques and rate distortion theory, predict the total energy consumption and network lifetime. We show that when a moderate amount of correlation is available, the optimal probabilities that lead to minimum energy consumption are far from optimality in terms of network lifetime. In addition, we study the sensitivity of the total energy consumption and network lifetime to the amount of correlation and compression distortion constraint.

[1]  Anthony Ephremides,et al.  The Architectural Organization of a Mobile Radio Network via a Distributed Algorithm , 1981, IEEE Trans. Commun..

[2]  Zygmunt J. Haas,et al.  Virtual backbone generation and maintenance in ad hoc network mobility management , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[3]  Mingyan Liu,et al.  Analysis of energy consumption and lifetime of heterogeneous wireless sensor networks , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[4]  Saurabh Ganeriwal,et al.  Aggregation in sensor networks: an energy-accuracy trade-off , 2003, Ad Hoc Networks.

[5]  Toby Berger,et al.  Rate distortion theory : a mathematical basis for data compression , 1971 .

[6]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[7]  Ravi Prakash,et al.  Max-min d-cluster formation in wireless ad hoc networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[8]  Ian F. Akyildiz,et al.  Sensor Networks , 2002, Encyclopedia of GIS.

[9]  Edward J. Coyle,et al.  An energy efficient hierarchical clustering algorithm for wireless sensor networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[10]  Gregory J. Pottie,et al.  Wireless integrated network sensors , 2000, Commun. ACM.

[11]  Dharma P. Agrawal,et al.  An Analytical Model for Information Retrieval in Wireless Sensor Networks Using Enhanced APTEEN Protocol , 2002, IEEE Trans. Parallel Distributed Syst..

[12]  Jiandong Li,et al.  Performance analysis of random database group scheme for mobility management in ad hoc networks , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[13]  Robert Tappan Morris,et al.  Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks , 2002, Wirel. Networks.

[14]  Jan M. Rabaey,et al.  Data funneling: routing with aggregation and compression for wireless sensor networks , 2003, Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications, 2003..

[15]  Deborah Estrin,et al.  ASCENT: adaptive self-configuring sensor networks topologies , 2004, IEEE Transactions on Mobile Computing.

[16]  Imrich Chlamtac,et al.  Energy Efficient Design of Wireless Ad Hoc Networks , 2002, NETWORKING.

[17]  S. Fossy,et al.  On a Voronoi Aggregative Process Related to a Bivariate Poisson Process , 1996 .

[18]  Anna Scaglione,et al.  Routing and data compression in sensor networks: stochastic models for sensor data that guarantee scalability , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[19]  Sajal K. Das,et al.  WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks , 2002, Cluster Computing.

[20]  S. Foss,et al.  On a Voronoi aggregative process related to a bivariate Poisson process , 1996, Advances in Applied Probability.

[21]  Kannan Ramchandran,et al.  A distributed and adaptive signal processing approach to reducing energy consumption in sensor networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[22]  A. Ephremides,et al.  A design concept for reliable mobile radio networks with frequency hopping signaling , 1987, Proceedings of the IEEE.

[23]  Deborah Estrin,et al.  Directed diffusion for wireless sensor networking , 2003, TNET.

[24]  Zygmunt J. Haas,et al.  Ad Hoc mobility management with uniform quorum systems , 1999, TNET.

[25]  Deborah Estrin,et al.  ASCENT : Adaptive Self-Configuring sEnsor Networks Topologies . , 2002 .

[26]  Chee-Yee Chong,et al.  Sensor networks: evolution, opportunities, and challenges , 2003, Proc. IEEE.

[27]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[28]  Ossama Younis,et al.  Distributed clustering in ad-hoc sensor networks: a hybrid, energy-efficient approach , 2004, IEEE INFOCOM 2004.

[29]  Robert Tappan Morris,et al.  Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks , 2001, MobiCom '01.

[30]  Anantha P. Chandrakasan,et al.  An application-specific protocol architecture for wireless microsensor networks , 2002, IEEE Trans. Wirel. Commun..