Name
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. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/s11134-012-9296-8 | international symposium on information theory |
Keywords | DocType | Volume |
wireless sensor networks | Journal | 72 |
Issue | ISSN | Citations |
3-4 | 0257-0130 | 4 |
PageRank | References | Authors |
0.44 | 27 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Siddhartha Banerjee | 1 | 185 | 22.85 |
| Piyush Gupta | 2 | 76 | 5.41 |
| Sanjay Shakkottai | 3 | 1467 | 147.23 |