Optimal Share Factors in the Push-Sum Algorithm for Ring and Random Geometric Graph Sensor Networks
The convergence speed of an asynchronous point-to-point version of the push-sum algorithm in sensor networks is investigated both through numerical simulations and theoretical arguments. The main contribution of the paper consists in studying the application of such algorithm in realistic scenarios,...
Main Authors: | Elma Zanaj, Marco Baldi, Franco Chiaraluce |
---|---|
Format: | Article |
Language: | English |
Published: |
Croatian Communications and Information Society (CCIS)
2009-03-01
|
Series: | Journal of Communications Software and Systems |
Subjects: | |
Online Access: | https://jcomss.fesb.unist.hr/index.php/jcomss/article/view/210 |
Similar Items
-
Efficiency of Unicast and Broadcast Gossip Algorithms for Wireless Sensor Networks
by: Elma Zanaj, et al.
Published: (2008-06-01) -
Performance Evaluation of Some Distributed Averaging Algorithms for Sensor Networks
by: Marco Baldi, et al.
Published: (2011-10-01) -
Graph and geometric algorithms on distributed networks and databases
by: Nanongkai, Danupon
Published: (2011) -
Problems on Geometric Graphs with Applications to Wireless Networks
by: NUNEZ RODRIGUEZ, YURAI
Published: (2009) -
Local geometric routing algorithms for edge-augmented planar graphs
by: Wahid, Mohammad Abdul
Published: (2013)