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: | , , |
|---|---|
| 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 |
| Summary: | 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, represented by non fully-meshed networks. Simulations show that, in this case, convergence may be strongly dependent on the adopted share factor, whose value should be optimized as a function of the connectivity level of the network. Optimum shares are derived for some common topologies, like the ring and the random geometric graph. The effect of possible link failures is also investigated. |
|---|---|
| ISSN: | 1845-6421 1846-6079 |