Towards a queueing-based framework for in-network function computation

Authors:
Siddhartha Banerjee;Piyush Gupta;Sanjay Shakkottai
Affiliations:
Department of ECE, The University of Texas at Austin, Austin, USA 78705;Mathematics of Networks and Communications, Bell Labs, Alcatel-Lucent, Murray Hill, USA 07974;Department of ECE, The University of Texas at Austin, Austin, USA 78705
Venue:
Queueing Systems: Theory and Applications
Year:
2012

Citing 18
Cited 0

The Impact of Data Aggregation in Wireless Sensor Networks

ICDCSW '02 Proceedings of the 22nd International Conference on Distributed Computing Systems
TAG: a Tiny AGgregation service for ad-hoc sensor networks

ACM SIGOPS Operating Systems Review - OSDI '02: Proceedings of the 5th symposium on Operating systems design and implementation
SCHEDULING IN A QUEUING SYSTEM WITH ASYNCHRONOUSLY VARYING SERVICE RATES

Probability in the Engineering and Informational Sciences
Maximizing Queueing Network Utility Subject to Stability: Greedy Primal-Dual Algorithm

Queueing Systems: Theory and Applications
Resource allocation and cross-layer control in wireless networks

Foundations and Trends® in Networking
The worst-case capacity of wireless sensor networks

Proceedings of the 6th international conference on Information processing in sensor networks
Energy-aware routing in sensor networks: A large system approach

Ad Hoc Networks
Optimal resource allocation for multicast flows in multihop wireless networks

ACM SIGMETRICS Performance Evaluation Review
Dynamic data compression in multi-hop wireless networks

Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
Delay analysis for maximal scheduling with flow control in wireless networks with bursty traffic

IEEE/ACM Transactions on Networking (TON)
Routing without routes: the backpressure collection protocol

Proceedings of the 9th ACM/IEEE International Conference on Information Processing in Sensor Networks
Stable and utility-maximizing scheduling for stochastic processing networks

Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
A unified modeling framework for distributed resource allocation of general fork and join processing networks

Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
The capacity of wireless networks

IEEE Transactions on Information Theory
Coding for computing

IEEE Transactions on Information Theory
Minimizing energy consumption in large-scale sensor networks through distributed data compression and hierarchical aggregation

IEEE Journal on Selected Areas in Communications
Computing and communicating functions over sensor networks

IEEE Journal on Selected Areas in Communications
A tutorial on cross-layer optimization in wireless networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We seek to develop network algorithms for function computation in sensor networks. Specifically, we want dynamic joint aggregation, routing, and scheduling algorithms that have analytically provable performance benefits due to in-network computation as compared to simple data forwarding. To this end, we define a class of functions, the Fully-Multiplexible functions, which includes several functions such as parity, MAX, and kth-order statistics. For such functions we characterize the maximum achievable refresh rate of the network in terms of an underlying graph primitive, the min-mincut. In acyclic wireline networks we show that the maximum refresh rate is achievable by a simple algorithm that is dynamic, distributed, and only dependent on local information. In the case of wireless networks we provide a MaxWeight-like algorithm with dynamic flow-splitting, which is shown to be throughput-optimal.