Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
A Random-Walk Model for Distributed Computation in Energy-Limited Networks
 

Summary: A Random-Walk Model for Distributed
Computation in Energy-Limited Networks
Murat Alanyali, Venkatesh Saligrama, Onur Savas
Department of Electrical and Computer Engineering
Boston University, Boston, MA 02215, USA
Email: {alanyali,srv,savas}@bu.edu
Abstract-- We consider two distributed algorithms to com-
pute functions that admit flexible decomposition in terms of
pairwise computations. Under these algorithms a transmitting
node becomes inactive and does not transmit further messages
until it is reactivated by a message reception from another
node. The algorithms thereby have sequential nature and bear a
close relationship to random walks. We quantify their time and
message complexities on the d-dimensional torus and establish
substantial gains in message complexity with respect to gossip
algorithms. The algorithms exhibit a favorable tradeoff between
the two complexities in lower dimensions. In particular on the
2-dimensional torus with n nodes, time and per-node message
complexities scale as (n log n) and O((log n)2
) respectively,

  

Source: Alanyali, Murat - Department of Electrical and Computer Engineering, Boston University

 

Collections: Engineering