1887

Abstract

This work considers the deployment of the binary consensus algorithm in wireless sensor networks (WSN). This algorithm is applied for the evaluation of the average measurement with the presence of a faulty/attacked node. As this algorithm has been tested theoretically, we deploy it in real life, including its distributed and routing features. In this paper, we propose the development, under simulation environment, of a distributed binary consensus algorithm. We formulate the algorithm into nesC derived from C language and running over the tiny operating system (TinyOS). The implementation was tested on sensor nodes using the TinyOSSimulator (Tossim) for a large number of nodes N and a testbed with a limited number of nodes. In performance evaluation, we considered the analysis of the average convergence time for node states to a consensus value. As in analytical results, in the simulations we applied the distributed algorithm for fully connected, paths, cycles Erdos Reny random, and starr-shaped graph topologies. Our achieved results of simulation and hardware implementations are consistent with theory.

Loading

Article metrics loading...

/content/papers/10.5339/qfarf.2012.CSP21
2012-10-01
2019-12-16
Loading full text...

Full text loading...

http://instance.metastore.ingenta.com/content/papers/10.5339/qfarf.2012.CSP21
Loading
This is a required field
Please enter a valid email address
Approval was a Success
Invalid data
An Error Occurred
Approval was partially successful, following selected items could not be processed due to error