Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSING, VOL. 5, NO. 4, AUGUST 2011 817 A Token-Based Approach for Distributed
 

Summary: IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSING, VOL. 5, NO. 4, AUGUST 2011 817
A Token-Based Approach for Distributed
Computation in Sensor Networks
Venkatesh Saligrama and Murat Alanyali
Abstract--We consider distributed algorithms for data aggre-
gation and function computation in sensor networks. The algo-
rithms perform pairwise computations along edges of an under-
lying communication graph. A token is associated with each sensor
node, which acts as a transmission permit. Nodes with active to-
kens have transmission permits; they generate messages at a con-
stant rate and send each message to a randomly selected neighbor.
By using different strategies to control the transmission permits we
can obtain tradeoffs between message and time complexity. Gossip
corresponds to the case when all nodes have permits all the time.
We study algorithms where permits are revoked after transmission
and restored upon reception. Examples of such algorithms include
Simple-Random Walk (SRW), Coalescent-Random-Walk (CRW),
and Controlled Flooding (CFLD) and their hybrid variants. SRW
has a single node permit, which is passed on in the network. CRW,
initially has a permit for each node but these permits are revoked

  

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

 

Collections: Engineering