Abstract
In this paper, we are studying a class of distributed data aggregation problems where a set of nodes in a network is interested in a function of data that is stored in another set of nodes. Assuming the function of interest is separable, we propose an algorithm based on gossiping schemes. Gossiping protocols are iterative methods based on near neighbor communications, and they are known to be efficient and robust to link/node failures. In this work, after formulating the problem mathematically, and introducing previously proposed necessary and sufficient conditions on the gossiping updates, we introduce several necessary conditions on the feasible codes which will provide significant intuition in determining the (in)feasibility of a given problem. By focusing on stochastic codes, we provide a necessary condition based on topology and discuss scenarios where the codes we seek cannot be found.
| Original language | English (US) |
|---|---|
| Title of host publication | CAMSAP 2009 - 2009 3rd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing |
| Pages | 53-56 |
| Number of pages | 4 |
| DOIs | |
| State | Published - 2009 |
| Externally published | Yes |
| Event | 2009 3rd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, CAMSAP 2009 - Aruba, Netherlands Duration: Dec 13 2009 → Dec 16 2009 |
Other
| Other | 2009 3rd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, CAMSAP 2009 |
|---|---|
| Country | Netherlands |
| City | Aruba |
| Period | 12/13/09 → 12/16/09 |
Fingerprint
Keywords
- Data aggregation
- Distributed algorithms
- Gossiping algorithms
ASJC Scopus subject areas
- Computational Theory and Mathematics
- Computer Networks and Communications
- Software
Cite this
Directed gossiping for distributed data aggregation. / Yildiz, Mehmet E.; Scaglione, Anna.
CAMSAP 2009 - 2009 3rd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing. 2009. p. 53-56 5413241.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Directed gossiping for distributed data aggregation
AU - Yildiz, Mehmet E.
AU - Scaglione, Anna
PY - 2009
Y1 - 2009
N2 - In this paper, we are studying a class of distributed data aggregation problems where a set of nodes in a network is interested in a function of data that is stored in another set of nodes. Assuming the function of interest is separable, we propose an algorithm based on gossiping schemes. Gossiping protocols are iterative methods based on near neighbor communications, and they are known to be efficient and robust to link/node failures. In this work, after formulating the problem mathematically, and introducing previously proposed necessary and sufficient conditions on the gossiping updates, we introduce several necessary conditions on the feasible codes which will provide significant intuition in determining the (in)feasibility of a given problem. By focusing on stochastic codes, we provide a necessary condition based on topology and discuss scenarios where the codes we seek cannot be found.
AB - In this paper, we are studying a class of distributed data aggregation problems where a set of nodes in a network is interested in a function of data that is stored in another set of nodes. Assuming the function of interest is separable, we propose an algorithm based on gossiping schemes. Gossiping protocols are iterative methods based on near neighbor communications, and they are known to be efficient and robust to link/node failures. In this work, after formulating the problem mathematically, and introducing previously proposed necessary and sufficient conditions on the gossiping updates, we introduce several necessary conditions on the feasible codes which will provide significant intuition in determining the (in)feasibility of a given problem. By focusing on stochastic codes, we provide a necessary condition based on topology and discuss scenarios where the codes we seek cannot be found.
KW - Data aggregation
KW - Distributed algorithms
KW - Gossiping algorithms
UR - http://www.scopus.com/inward/record.url?scp=77951138411&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77951138411&partnerID=8YFLogxK
U2 - 10.1109/CAMSAP.2009.5413241
DO - 10.1109/CAMSAP.2009.5413241
M3 - Conference contribution
AN - SCOPUS:77951138411
SN - 9781424451807
SP - 53
EP - 56
BT - CAMSAP 2009 - 2009 3rd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing
ER -