We consider a power-efficient communication model for wireless sensor networks where silence is used to convey information. We study the average-case and worstcase complexities of symmetric functions under this model and describe protocols that achieve them. For binaryinput functions, we determine the average complexity. For ternary-input functions, we consider a special type of protocols and provide close lower and upper bounds for their worst-case complexity. We also describe the protocol that achieves the average complexity.
Anand K. Dhulipala, Christina Fragouli, Alon Orlit