Optimal Computation of Symmetric Boolean Functions in Collocated Networks Academic Article uri icon

abstract

  • We consider collocated wireless sensor networks, where each node's transmissions can be heard by every other node. Each node has a Boolean measurement and the goal of the network is to compute a given Boolean function of these measurements. We first consider the worst case setting and study optimal block computation strategies for computing symmetric Boolean functions. We study three classes of functions: threshold functions, delta functions and interval functions. We provide optimal strategies for the first two classes, and a scaling law order-optimal strategy with optimal preconstant for interval functions. We extend the results to the case of integer measurements and certain integer-valued functions. Next, we address the problem of minimizing the expected total number of bits that are transmitted when node measurements are random and drawn from independent Bernoulli distributions. In the case of computing a single instance of a Boolean threshold function, the problem reduces to one of determining the optimal order in which the nodes should transmit. We show that the optimal order of transmissions depends in an extremely simple way on the values of previously transmitted bits and the ordering of the marginal probabilities of the Boolean variables according to the k-th least likely rule: At any transmission, the node that transmits is the one that has the k-th least likely value of its Boolean variable, where k reduces by one whenever a node transmits a one. Initially the value of k is (n +1-Threshold). Interestingly, the order of transmissions does not depend on the exact values of the probabilities of the Boolean variables. In the case of identically distributed measurements, we further show that the average-case complexity of block computation of a Boolean threshold function is O(θ), where θ is the threshold. We further show how to generalize to a pulse model of communication. One can also consider the related problem of approximate computation given a fixed number of bits. For the special case of the parity function, we show that the greedy strategy is optimal. © 1983-2012 IEEE.

author list (cited authors)

  • Kowshik, H., & Kumar, P. R.

citation count

  • 16

publication date

  • April 2013