Skip to main content
Log in

Consensus in sensor networks in presence of hybrid faults

  • Published:
Peer-to-Peer Networking and Applications Aims and scope Submit manuscript

Abstract

Consensus in the presence of faults is a challenging task, particularly for wireless sensors that are prone to failures and are often deployed in inhospitable terrains. Consensus in Wireless Sensor Networks (WSNs) is possible if the link-densities among the neighboring nodes are adequate such that the effect of failures due to various types of faults can be masked. The theoretical results in literature place strict requirements on the link-density of each sensor (node) as the prerequisite to consensus. Furthermore, these results are not scalable in large randomly distributed WSNs. This research investigates the consensus problem, herein referred to as Global Convergence (GC), to determine the effect of varying link-densities on GC in the presence of faults and to design algorithms that are better suited to reach GC. The intertwined relationship among various parameters that affect GC are investigated as well. To achieve these goals, a GUI simulator has been developed that illustrates the effectiveness of the algorithms designed and that provides better insight into the application of GC to real-world applications in large WSNs.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15

Similar content being viewed by others

References

  1. Lamport L, Shostak R, Pease M (1982) The Byzantine Generals Problem. ACM Trans Program Lang Syst 4(3):382–401

    Article  Google Scholar 

  2. Olfati-Saber R, Shamma JS (2005) Consensus filters for sensor networks and distributed sensor fusion. IEEE Conf on Decision and Control

  3. Bauso D, Giarre L, Presenti R (2003) “Attitude alignment of a team of UAVs under decentralized information structure. IEEE Conf Control Appl 1:486–491

    Article  Google Scholar 

  4. Bonomi S, Del Pozzo A, Potop-Butucaru M, Tixeuil S (2019) Approximate agreement under mobile Byzantine faults. Theoret Comput Sci 758:17–29

    Article  MathSciNet  Google Scholar 

  5. Bouzid Z, Potop-Butucaru MG, Tixeuil S (2010) Optimal Byzantine resilient convergence in uni-dimensional robot networks. Theoret Comput Sci 411:3154–3168

    Article  MathSciNet  Google Scholar 

  6. Clouqueur T, Saluja K, Ramanathan P (2004) Fault-tolerance in collaborative sensor networks for target detection. IEEE Trans Comput 53(3):320–333

    Article  Google Scholar 

  7. Hussein S, Krings A, Azadmanesh A (2017) VANET clock synchronization for resilient DSRC safety applications. Resilient Week Symposia, Resilient Cyber Systems: 18–24

  8. LeBlanc HJ, Zhang H, Koutsoukos X, Sundaram S (2013) Resilient asymptotic consensus in robust networks. IEEE J Sel Areas Commun 31(4):766–781

    Article  Google Scholar 

  9. Li Q, Rus D (2004) Global clock synchronization in sensor networks. Proc of the Twenty-third Annual Joint Conf of the IEEE Computer and Communications Societies 1:564–574

  10. Liu G-P, Zhang S (2018) A survey of formation control of small satellites. Proc IEEE 106(3):440–457

    Article  Google Scholar 

  11. Lynch NA (1996) Distributed Algorithms. Morgan Kaufmann, San Francisco

    MATH  Google Scholar 

  12. Plunkett R, Fekete A (1998) Optimal approximate agreement with omission faults. Algorithm Comput 1533:468–475

    Article  MathSciNet  Google Scholar 

  13. Avizienis A (2004) Basic concepts and taxonomy of dependable and secure computing. IEEE Trans Dependable Secure Comput 1(1):11–33

    Article  Google Scholar 

  14. Azadmanesh A, Gai M, Li T (2016) Consensus in dynamic networks with hybrid faults. Performance Evaluation of Computer and Telecommunication Systems

  15. Azadmanesh MH, Kieckhafer RM (2000) Exploiting omissive faults in synchronous approximate agreement. IEEE Trans Comput 49(10):1031–1042

    Article  MathSciNet  Google Scholar 

  16. Dolev D, Lynch NA, Pinter SS, Stark EW, WeihI WC (1986) Reaching approximate agreement in the presence of faults. J ACM 33(3):499–516

    Article  MathSciNet  Google Scholar 

  17. Charron-Bost B, Fugger M, Nowak T (2015) Approximate consensus in highly dynamic networks: The role of averaging algorithms. In: Halldórsson M, Iwama K, Kobayashi N, Speckmann B (eds) Int’l Colloquium on Automata, Languages, and Programming. Springer, Berlin, pp 528–539

    Chapter  Google Scholar 

  18. Kieckhafer RM, Azadmanesh MH (1994) Reaching approximate agreement with mixed-mode faults. IEEE Trans Parallel Distrib Syst 5(1):53–63

    Article  Google Scholar 

  19. Azadmanesh MH, Kieckhafer RM (1995) The general convergence problem: A unification of synchronous and asynchronous systems. In: Cristian F, Le Lann G, Lunt T (eds) Dependable Computing for Critical Applications 4, Dependable Computing and Fault Tolerant systems (vol 9). Springer, Vienna, pp 251–267

    Google Scholar 

  20. Park H, Hutchinson SA (2017) Fault tolerant rendezvous of multi-robot systems. IEEE Trans Rob 33(3):565–582

    Article  Google Scholar 

  21. Azadmanesh MH, Kieckhafer RM (1996) New hybrid fault models for asynchronous approximate agreement. IEEE Trans Comput 45(4):439–449

    Article  Google Scholar 

  22. Azadmanesh M, Krings AW (1999) Network convergence in the presence of omission faults. Proc 12th Int Parallel and Distributed Computing Systems: 416–423

  23. Srinivasan S, Azadmanesh A (2013) Survivable data aggregation in multi-agent network systems with hybrid faults. IEEE Trans Comput 62(10):2054–2068

    Article  MathSciNet  Google Scholar 

  24. Azadmanesh MH, Kieckhafer RM (2002) Asynchronous approximate agreement in partially connected networks. Int J Parallel Distrib Syst Netw 5(1):26–34

    Google Scholar 

  25. Kieckhafer RM, Azadmanesh A (1993) Low cost approximate agreement in partially connected networks. J Comput Inf 3(1):53–85

    MathSciNet  Google Scholar 

  26. Azadmanesh A, Krings A, Ghahramani B (2003) Global convergence in partially fully connected networks with limited relays. Inf Technol Decis Mak 2(2):265–285

    Article  Google Scholar 

  27. Kieckhafer RM, Azadmanesh MH (1992) Fault-tolerant convergent voting in large sparsely connected networks. Proc Complex Systems Eng Synthesis and Assessment Technology Workshop: 31–51

  28. Mishra A (2020) Global convergence in large sensor networks under hybrid faults. University of Nebraska-Omaha (Thesis)

    Google Scholar 

  29. LeBlanc H, Koutsoukos X (2011) Consensus in networked multi-agent systems with adversaries. 14th Int’l Conf. on Hybrid Systems: Computation and Control (HSCC)

  30. Meyer FJ, Pradhan DK (1987) Consensus with Dual Failure Modes. Proc 17th Fault-Tolerant Computing Symp: 48–54

  31. Pease M, Shostak R, Lamport L (1980) Reaching agreement in the presence of faults. J ACM 27(2):228–234

    Article  MathSciNet  Google Scholar 

  32. Plunkett R, Fekete A (1998) Approximate agreement with mixed mode faults. Proc 12th Int'l Symp On Distributed Computing 333–346

  33. Thambidurai PM, Park YK (1988) Interactive consistency with multiple failure modes. Proc 7th Reliable Distributed Systems Symp

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Azad Azadmanesh.

Ethics declarations

Conflicts of interest

The authors declare that there is no conflict of interest.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Mishra, A., Azadmanesh, A. & Najjar, L. Consensus in sensor networks in presence of hybrid faults. Peer-to-Peer Netw. Appl. 15, 1757–1774 (2022). https://doi.org/10.1007/s12083-022-01314-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12083-022-01314-7

Keywords

Navigation