Abstract
In sensor networks, average consensus and gossiping algorithms, featuring only near neighbor communications, present advantages over flooding and epidemic algorithms in a number of distributed signal processing applications. This chapter looks into the implementation of average consensus algorithms within the constraints of current sensor network technology. Our event-based protocols work in the real event-based environment provided by a common Mica2 platform and use its wireless CSMA packet-switched network interface. Within this architecture our chapter derives different protocols according to an event-based software architecture that are suitable for an environment like TinyOS, the most used operating system for low-power mote platforms. Theoretical and simulation results are presented, and the main advantage over traditional routing protocols is given by the fully distributed and scalable nature this approach follows.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
D. Agrawal, A. El Abbadi, and R. C. Steinke, “Epidemic algorithms in replicated databases,” in PODS ’97: Proceedings of the Sixteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, New York, NY, USA, 1997, ACM Press, New York, pp. 161–172.
W. Ren and R. W. Beard, “Consensus seeking in multi-agent systems under dynamically changing interaction topologies,” IEEE Trans. Autom. Control, Technote, vol. 50, no. 5, pp. 655–661, 2003.
S. Boyd, P. Diaconis, and L. Xiao, “Fastest mixing Markov chain on a graph,” SIAM Rev., vol. 46, no. 4, pp. 667–689, 2003.
C. Y. Chong and S. P. Kumar, “Sensor networks: evolution, opportunities, and challenges,” in Proceedings of IEEE, San Antonio, TX, August 2003, pp. 1247–1256.
A. Demers, D. Greene, C. Hauser, W. Irish, J. Larson, S. Shenker, H. Sturgis, D. Swinehart, and D. Terry, ‘Epidemic algorithms for replicated database maintenance,” in PODC ’87: Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing, New York, NY, USA, 1987, ACM Press, New York, pp. 1–12.
J. Elson, L. Girod, and D. Estrin, “Fine-grained network time synchronization using reference broadcasts,” SIGOPS Oper. Syst. Rev., vol. 36, no. SI,p. 147–163, 2002.
D. Ganesan, B. Krishnamachari, A. Woo, D. Culler, D. Estrin, and S. Wicker, “An empirical study of epidemic algorithms in large scale multihop wireless networks,” Tech. Rep., University of California, Los Angeles, 2002.
P. Gupta and P. Kumar, “Performance analysis of the IEEE 802.11 distributed coordination function,” IEEE Trans. Inf. Theory, vol. 18, no. 3, pp. 535–547, 2000.
P. Gupta and P. Kumar, “Capacity of wireless networks,” IEEE Trans. Inf. Theory, vol. 46, no. 2, pp. 388–404, 2000.
L. Lamport, “Time, clocks, and the ordering of events in a distributed system,” Commun. ACM, vol. 21, no. 7, pp. 558–565, 1978.
Q. Lindsey, D. Lymberopoulos, and A. Savvides, “An empirical analysis of radio signal strength variability in IEEE 802.15.4 networks using monopole antennas,” Tech. Rep., Yale University, ENALAB, 2006.
A. Mainwaring, J. Polastre, R. Szewczyk, D. Culler, and J. Anderson, “Wireless sensor networks for habitat monitoring,” in ACM WSNA, Atlanta, GA, 2002.
M. Maroti, “Directed flood-routing framework for wireless sensor networks,” in Middleware ’04: Proceedings of the 5th ACM/IFIP/USENIX International Conference on Middleware, New York, NY, USA, 2004, Springer, New York, pp. 99–114.
M. Maroti, B. Kusy, G. Simon, and A. Ledeczi, “The flooding time synchronization protocol,” in SenSys ’04: Proceedings of the 2nd International Conference on Embedded Networked Sensor Systems, New York, NY, USA, 2004, ACM Press, New York, pp. 39–49.
M. Mehyar, D. Spanos, J. Pongsajapan, S. Low, and R. Murray, “Asynchronous distributed averaging on communication networks,” IEEE Trans. Netw., vol. 18, no. 3, pp. 535–547, 2007.
D. L. Mills, “Internet time synchronization: the network time protocol,” IEEE Trans. Commun., vol. 39, no. 10, pp. 1482–1493, 1991.
M. Mock, R. Frings, E. Nett, and S. Trikaliotis,“Continuous clock synchronization in wireless real-tim applications,” in The 19th IEEE Symposium on Reliable Distributed Systems, SRDS’00, Washington–Brussels–Tokyo, 2000, pp. 125–133.
L. Murray, “Stability of multiagent systems with time-dependent communication links,” IEEE Trans. Autom. Control, vol. 50, no. 2, pp. 169–182, 2005.
R. Olfati Saber and R. M. Murray, “Consensus protocols for networks of dynamic agents,” in American Control Conference, 2003.
R. O. Saber and R. M. Murray, “Consensus problems in networks of agents with switching topology and time-delays,” IEEE Trans. Autom. Controls, vol. 49, no. 9, pp. 1520–1533, 2004.
K. Romer, “Time synchronization in ad hoc networks,” in MobiHoc 2001, Long Beach, USA, 2001.
R. O. Saber and R. M. Murray, “Consensus roblems in networks of agents with switching topology and time-delays,” IEEE Trans. Autom. Controls, vol. 49, no. 9, pp. 1520–1533, 2004.
M. L. Sichitiu and C. Veerarittiphan, “Simple, accurate time synchronization for wireless sensor networks,” in Proceedings of the IEEE Wireless Communications and Networking Conference, WCNC’2003, New Orleans, LA, USA, 2003.
W. Su and I. F. Akyildiz, “Time-diffusion synchronization protocol for wireless sensor networks,” IEEE/ACM Trans. Netw., vol. 13, no. 2, pp. 384–397, 2005.
L. Xiao and S. Boyd, “Fast linear iterations for distributed averaging,” Syst. Control Lett., vol. 53, pp. 65–78, 2004.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer Science+Business Media, LLC
About this paper
Cite this paper
Pagliari, R., Scaglione, A. (2009). Implementation of Average Consensus Protocols for Commercial Sensor Networks Platforms. In: Davoli, F., Meyer, N., Pugliese, R., Zappatore, S. (eds) Grid Enabled Remote Instrumentation. Signals and Communication Technology. Springer, New York, NY. https://doi.org/10.1007/978-0-387-09663-6_5
Download citation
DOI: https://doi.org/10.1007/978-0-387-09663-6_5
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-09662-9
Online ISBN: 978-0-387-09663-6
eBook Packages: EngineeringEngineering (R0)