A clustering method that uses lossy aggregation of data

ABSTRACT

Wireless sensor networks are characterized by dense deployment of sensor nodes which collectively communicate sensed data to the sink. However, due to the spatial correlation between sensor observations, it is not necessary for every node to transmit its data. We propose a clustering method which exploits the above observation. We do not make any assumption on the nature of data, and hence the algorithm will be valid for a broad range of conditions. The paper shows how to calculate the optimal cluster size. We also discuss the structure of the complete architecture which is still under development.

REFERENCES

• 1: A. Jindal and K. Psounis. Modelling Spatially-Correlated Sensor Network Data. In Technical Report, CENG-2004-10, USC, 2004.
• 2: O. Younis and S. Fahmy. Distributed Clustering in Ad-hoc Sensor Networks: A Hybrid, Energy-Efficient Approach. In Proceedings of IEEE Infocom'04, Mar. 2004.
• 3: S. Bandyopadhyay and E. Coyle. An Energy-Efficient Hierarchical Clustering Algorithm for Wireless Sensor Networks. In Proceedings of IEEE Infocom'03, Apr. 2003.
• 4: W. Heinzelman and A. Chandrakasan and H. Balakrishnan. An Application-Specific Protocol Architecture for Wireless Microsensor Networks. IEEE Transactions on Wireless Communications 1:660--670, Oct. 2002.
• 5: M. C. Vuran and I. F. Akyildiz. Spatial Correlation-based Collaborative Medium Access Control in Wireless Sensor Networks. submitted for publication, 2004
• 6: C.F. Chiasserini and I. Chlamtac and P. Monti and A. Nucci. Energy Efficient design of Wireless Ad Hoc Networks. In Proceedings of European Wireless, feb. 2002

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.1 Network Architecture and Design

General Terms:
Algorithms, Performance

Keywords:
cluster, energy distortion tradeoff, lossy data aggregation, spatial correlation, wireless sensor networks