Estimation Precision of Fastest Constant Edge Weights Algorithm over Wireless Sensor Networks with Mobile Agents

As the mobility of the sensor nodes brings many advantages, mobile wireless sensor networks have gained importance over the last years and find application in more areas than their static variant. This paper addresses the fastest constant edge weights algorithm, applied as a data aggregation mechanism for distributed averaging over mobile wireless sensor networks modeled as stationary edge-Markovian evolving graphs with varied parameters. Our goal is to analyze the performance of this algorithm over graphs with a variant birth-rate, a variant death-rate, and a changed number of the vertices in terms of the estimation precision over the iterations.