Aggregation and compression of distributed binary decisions in a wireless sensor network

An aggregation and compression architecture for wireless sensor networks without a fusion center is proposed. In this architecture, sensors are grouped into pairs whose local binary decisions are combined to form half as many new one-bit decisions. The new decisions are paired and combined until a single one-bit global decision is reached. A simple recursive algorithm is presented and proved to find the minimum size of the network required to achieve a given global error probability.

[1]  Wendi Heinzelman,et al.  Energy-efficient communication protocol for wireless microsensor networks , 2000, Proceedings of the 33rd Annual Hawaii International Conference on System Sciences.

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

[3]  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).

[4]  Edward J. Coyle,et al.  Minimizing communication costs in hierarchically clustered networks of wireless sensors , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[5]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[6]  Brian M. Sadler,et al.  Fundamentals of energy-constrained sensor network systems , 2005, IEEE Aerospace and Electronic Systems Magazine.

[7]  Andrea J. Goldsmith,et al.  Design challenges for energy-constrained ad hoc wireless networks , 2002, IEEE Wirel. Commun..