Fast Distributed Algorithms for Computing Separable Functions

The problem of computing functions of values at the nodes in a network in a fully distributed manner, where nodes do not have unique identities and make decisions based only on local information, has applications in sensor, peer-to-peer, and ad hoc networks. The task of computing separable functions...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on information theory Vol. 54; no. 7; pp. 2997 - 3007
Main Authors:	Mosk-Aoyama, D., Shah, D.
Format:	Journal Article
Language:	English
Published:	New York, NY IEEE 01.07.2008 Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Ad hoc networks Algorithm design and analysis Algorithms Applied sciences Computation Computer networks Data aggregation Distributed algorithms Distributed computing Electronics Exact sciences and technology Functions gossip algorithms Graphs Grid computing Information theory Information, signal and communications theory Iterative algorithms Mathematical analysis Mathematical models Network topology Peer to peer computing Protocols Randomized algorithms Running Spectra Studies Subroutines Telecommunications Telecommunications and information theory Teleprocessing networks. Isdn Valuation and optimization of characteristics. Simulation Averaging method Peer to peer Subroutine Wireless telecommunication Data aggregation Iterative method gossip algorithms Resource sharing Distributed computing Linear combination Computer network distributed algorithms randomized algorithms Distributed algorithm Fast algorithm Ad hoc network
ISSN:	0018-9448, 1557-9654
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!