pith. sign in

arxiv: 2104.10407 · v1 · submitted 2021-04-21 · 💻 cs.DC

Analysis of Distributed Average Consensus Algorithms for Robust IoT networks

Sateeshkrishna Dhuli , Fouzul Atik This is my paper

Pith reviewed 2026-05-24 13:58 UTC · model grok-4.3

classification 💻 cs.DC
keywords IoT networksdistributed consensusLaplacian eigenvaluesq-triangular graphsconvergence timenetwork coherencecommunication delayscale-free topologies
0
0 comments X

The pith

Q-triangular r-regular ring networks make noise and communication delays negligible in distributed consensus for IoT.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper models heterogeneous IoT networks as q-triangular r-regular ring graphs because these topologies combine small-world and scale-free properties that resist random failures. It obtains closed-form expressions for every eigenvalue of the associated Laplacian matrix. Those eigenvalues are inserted into standard formulas to compute convergence time, network coherence, and the largest tolerable communication delay. The resulting expressions show that added noise and time delays produce only vanishingly small effects on the consensus value. The authors locate the source of this stability in the q-triangulation step used to build the graphs.

Core claim

For q-triangular r-regular ring networks the effects of noise and communication delay on the consensus process are negligible; the q-triangulation operation itself supplies the strong robustness with respect to both perturbations.

What carries the argument

The full set of Laplacian eigenvalues of the q-triangular r-regular ring network, which yield explicit formulas for convergence time, coherence, and maximum delay tolerance.

If this is right

  • Consensus-based resource allocation and synchronization remain accurate even when packet delays vary across the network.
  • Network coherence stays high, so the variance of node states around the average stays small under realistic sensor noise.
  • Maximum allowable communication delay grows with the triangulation parameter q, relaxing timing requirements for IoT device firmware.
  • The same eigenvalue formulas can be reused to predict performance when the network size or degree r changes.
  • Topology design can prioritize q-triangulation to achieve robustness without adding extra hardware links.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same Laplacian spectra could be used to bound performance in other distributed algorithms such as leader election or formation control on the identical graphs.
  • If real IoT deployments deviate from perfect ring-plus-triangle structure, the negligible-noise claim may require an additional error term that grows with the deviation.
  • Testing the formulas on measured delay distributions from actual wireless traces would give a direct check on the analytic maximum-delay bound.

Load-bearing premise

That q-triangular r-regular ring networks are a faithful model for the connectivity and attack resilience of real heterogeneous IoT deployments.

What would settle it

Direct measurement of steady-state consensus error versus increasing noise variance on a physical q-triangular r-regular testbed compared with the same testbed without the triangulation edges.

Figures

Figures reproduced from arXiv: 2104.10407 by Fouzul Atik, Sateeshkrishna Dhuli.

Figure 1
Figure 1. Figure 1: 4-regular ring network [PITH_FULL_IMAGE:figures/full_fig_p004_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: q-triangular 2-regular ring network r-regular ring network in [PITH_FULL_IMAGE:figures/full_fig_p004_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Convergence Time versus q for Average Gossip Algorithm (n=100). 0 2 4 6 8 10 12 14 16 18 20 q 0 500 1000 1500 2000 2500 3000 3500 4000 Convergence Time (T) n=10 n=20 n=30 n=40 n=50 n=60 n=70 [PITH_FULL_IMAGE:figures/full_fig_p006_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: Convergence Time versus q for Average Gossip Algorithm (r=4). we plot the first order network coherence versus triangulation parameter for r = 4 and observed that network coherence exponentially decreases with the triangulation parameter and decreases with the node degree. To observe the effect of node degree on second order network coherence, we plot the [PITH_FULL_IMAGE:figures/full_fig_p006_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: Maximum Communication Time-Delay versus q for Average Gossip Algorithm (r=50). 0 2 4 6 8 10 12 14 16 18 20 q 0 0.05 0.1 0.15 0.2 0.25 Maximum Communication Time-Delay(Tmax ) r=5 r=6 r=7 r=8 r=9 r=10 r=11 [PITH_FULL_IMAGE:figures/full_fig_p007_5.png] view at source ↗
Figure 8
Figure 8. Figure 8: Second Order Coherence versus q for Average Gossip Algorithm (n=100). 0 10 20 30 40 50 60 70 80 90 100 q 0 2 4 6 8 10 12 14 16 18 20 First Order Network Coherence n=100 n=200 n=300 n=400 n=500 [PITH_FULL_IMAGE:figures/full_fig_p007_8.png] view at source ↗
Figure 9
Figure 9. Figure 9: First Order Coherence versus q for Average Gossip Algorithm (r=5) [PITH_FULL_IMAGE:figures/full_fig_p007_9.png] view at source ↗
read the original abstract

Internet of Things(IoT) is a heterogeneous network consists of various physical objects such as large number of sensors, actuators, RFID tags, smart devices, and servers connected to the internet. IoT networks have potential applications in healthcare, transportation, smart home, and automotive industries. To realize the IoT applications, all these devices need to be dynamically cooperated and utilize their resources effectively in a distributed fashion. Consensus algorithms have attracted much research attention in recent years due to their simple execution, robustness to topology changes, and distributed philosophy. These algorithms are extensively utilized for synchronization, resource allocation, and security in IoT networks. Performance of the distributed consensus algorithms can be effectively quantified by the Convergence Time, Network Coherence, Maximum Communication Time-Delay. In this work, we model the IoT network as a q-triangular r-regular ring network as q-triangular topologies exhibit both small-world and scale-free features. Scale-free and small-world topologies widely applied for modelling IoT as these topologies are effectively resilient to random attacks. In this paper, we derive explicit expressions for all eigenvalues of Laplacian matrix for q-triangular r-regular networks. We then apply the obtained eigenvalues to determine the convergence time, network coherence, and maximum communication timedelay. Our analytical results indicate that the effects of noise and communication delay on the consensus process are negligible for q-triangular r-regular networks. We argue that q-triangulation operation is responsible for the strong robustness with respect to noise and communication time-delay in the proposed network topologies.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 3 minor

Summary. The manuscript models IoT networks as q-triangular r-regular ring graphs, citing their small-world and scale-free properties for resilience. It derives explicit closed-form expressions for all eigenvalues of the Laplacian matrix of these graphs. These eigenvalues are then substituted into standard formulas to obtain the convergence time, network coherence, and maximum communication time-delay of distributed average consensus algorithms. The resulting expressions are used to argue that noise and delay effects are negligible, with the q-triangulation step credited for the observed robustness.

Significance. The provision of explicit, parameter-free Laplacian eigenvalue formulas for this graph family enables exact analytic evaluation of consensus metrics without numerical approximation or simulation. This is a clear strength for theoretical work in distributed computing and graph-based network analysis, directly supporting falsifiable predictions about performance under noise and delay.

minor comments (3)
  1. [Abstract] Abstract: the assertion that q-triangular topologies exhibit small-world and scale-free features is invoked to justify the IoT modeling choice but is not accompanied by a reference or short justification; a citation to prior work on these properties would clarify the motivation.
  2. The integer constraints on parameters q and r, as well as the precise construction of the q-triangular operation, should be stated explicitly in the first section where the graph family is introduced to avoid ambiguity for readers.
  3. A brief numerical verification (e.g., comparison of the derived eigenvalue formulas against direct computation for small q,r) would improve readability even if not required for the central derivation.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive summary, recognition of the significance of the closed-form Laplacian eigenvalues, and recommendation of minor revision. The referee's description of the manuscript is accurate. No specific major comments appear in the report, so we provide no point-by-point rebuttals below.

Circularity Check

0 steps flagged

No significant circularity; derivations are independent graph-theoretic results

full rationale

The paper derives explicit Laplacian eigenvalues for q-triangular r-regular ring networks as a self-contained graph theory exercise, then substitutes those eigenvalues into standard consensus formulas for convergence time, coherence, and delay bounds. These steps do not reduce by construction to fitted parameters, self-definitions, or prior self-citations; the eigenvalue expressions are presented as first-principles results for the given family. The IoT modeling and robustness attribution are motivational framing only and are not required for the algebraic steps to hold. No load-bearing self-citation, ansatz smuggling, or renaming of known results is evident in the abstract or described derivation chain.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

Review performed on abstract only; the central claim rests on the unverified correctness of the eigenvalue derivations and on the modeling assumption that the chosen topology captures IoT characteristics. No free parameters are fitted to data in the abstract. No new entities are postulated.

axioms (1)
  • domain assumption Eigenvalues of the graph Laplacian determine convergence time, network coherence, and maximum tolerable communication delay in average consensus algorithms
    Standard result from consensus literature invoked when the abstract states that the obtained eigenvalues are applied to determine those three metrics.

pith-pipeline@v0.9.0 · 5805 in / 1350 out tokens · 27305 ms · 2026-05-24T13:58:29.063816+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

34 extracted references · 34 canonical work pages · 2 internal anchors

  1. [1]

    Consensus protocols for net works of dynamic agents,

    R. O. Saber and R. M. Murray, “Consensus protocols for net works of dynamic agents,” 2003

    work page 2003

  2. [2]

    Distributed average con sensus with least-mean-square deviation,

    L. Xiao, S. Boyd, and S.-J. Kim, “Distributed average con sensus with least-mean-square deviation,” Journal of parallel and distributed computing, vol. 67, no. 1, pp. 33–46, 2007

    work page 2007

  3. [3]

    Consensus and coherence in f ractal networks,

    S. Patterson and B. Bamieh, “Consensus and coherence in f ractal networks,” IEEE Transactions on Control of Network Systems , vol. 1, no. 4, pp. 338–348, 2014

    work page 2014

  4. [4]

    C oherence in large-scale networks: Dimension-dependent limitation s of local feed- back,

    B. Bamieh, M. R. Jovanovic, P . Mitra, and S. Patterson, “C oherence in large-scale networks: Dimension-dependent limitation s of local feed- back,” IEEE Transactions on Automatic Control , vol. 57, no. 9, pp. 2235–2249, 2012

    work page 2012

  5. [5]

    Consensus problems in networks of agents with switching topology and time-delays,

    R. Olfati-Saber and R. M. Murray, “Consensus problems in networks of agents with switching topology and time-delays,” IEEE Transactions on automatic control , vol. 49, no. 9, pp. 1520–1533, 2004

    work page 2004

  6. [6]

    Convergence analys is for regular wireless consensus networks,

    S. Dhuli, K. Gaurav, and Y . N. Singh, “Convergence analys is for regular wireless consensus networks,” IEEE Sensors Journal , vol. 15, no. 8, pp. 4522–4531, 2015

    work page 2015

  7. [7]

    Convergence rate a nalysis of periodic gossip algorithms for one-dimensional lattice wsns,

    S. Kouachi, S. Dhuli, and Y . N. Singh, “Convergence rate a nalysis of periodic gossip algorithms for one-dimensional lattice wsns,” IEEE Sensors Journal, vol. 20, no. 21, pp. 13 150–13 160, 2020

    work page 2020

  8. [8]

    An int elligent robust networking mechanism for the internet of things,

    N. Chen, T. Qiu, X. Zhou, K. Li, and M. Atiquzzaman, “An int elligent robust networking mechanism for the internet of things,” IEEE Commu- nications Magazine , vol. 57, no. 11, pp. 91–95, 2019

    work page 2019

  9. [9]

    Tosg: A topolog y op- timization scheme with global small world for industrial he terogeneous internet of things,

    T. Qiu, B. Li, W. Qu, E. Ahmed, and X. Wang, “Tosg: A topolog y op- timization scheme with global small world for industrial he terogeneous internet of things,” IEEE Transactions on Industrial Informatics , vol. 15, no. 6, pp. 3174–3184, 2018

    work page 2018

  10. [10]

    A data- driven robustness algorithm for the internet of things in sm art cities,

    T. Qiu, J. Liu, W. Si, M. Han, H. Ning, and M. Atiquzzaman, “A data- driven robustness algorithm for the internet of things in sm art cities,” IEEE Communications Magazine , vol. 55, no. 12, pp. 18–23, 2017

    work page 2017

  11. [11]

    Small-world and scale-free network models fo r iot systems,

    I. Sohn, “Small-world and scale-free network models fo r iot systems,” Mobile Information Systems , vol. 2017, 2017

    work page 2017

  12. [12]

    Scale-free loopy str ucture is resistant to noise in consensus dynamics in complex networks,

    Y . Yi, Z. Zhang, and S. Patterson, “Scale-free loopy str ucture is resistant to noise in consensus dynamics in complex networks,” IEEE transactions on cybernetics , vol. 50, no. 1, pp. 190–200, 2018

    work page 2018

  13. [13]

    Hitting times and resistance distances of $q$-triangulation graphs: Accurate results and applications

    Y . Zeng and Z. Zhang, “Hitting times and resistance dist ances of q- triangulation graphs: Accurate results and applications, ” arXiv preprint arXiv:1808.01025, 2018

    work page internal anchor Pith review Pith/arXiv arXiv 2018

  14. [14]

    A generalized distributed consensus algorithm for monitoring and decision making in t he iot,

    D. Carvin, P . Owezarski, and P . Berthou, “A generalized distributed consensus algorithm for monitoring and decision making in t he iot,” in 2014 International Conference on Smart Communications in N etwork Technologies (SaCoNeT). IEEE, 2014, pp. 1–6

    work page 2014

  15. [15]

    A distributed consensus algorithm for decision making in ser vice-oriented internet of things,

    S. Li, G. Oikonomou, T. Tryfonas, T. M. Chen, and L. Da Xu, “A distributed consensus algorithm for decision making in ser vice-oriented internet of things,” IEEE Transactions on Industrial Informatics , vol. 10, no. 2, pp. 1461–1468, 2014

    work page 2014

  16. [16]

    The problem of t ask allocation in the internet of things and the consensus-based approach,

    G. Colistra, V . Pilloni, and L. Atzori, “The problem of t ask allocation in the internet of things and the consensus-based approach, ” Computer Networks, vol. 73, pp. 98–111, 2014

    work page 2014

  17. [17]

    Consensus-based resource al location among objects in the internet of things,

    V . Pilloni and L. Atzori, “Consensus-based resource al location among objects in the internet of things,” Annals of Telecommunications, vol. 72, no. 7, pp. 415–429, 2017

    work page 2017

  18. [18]

    Robust gossiping for distr ibuted average consensus in iot environments,

    B. Orostica and F. N´ u˜ nez, “Robust gossiping for distr ibuted average consensus in iot environments,” IEEE Access , vol. 7, pp. 994–1005, 2018

    work page 2018

  19. [19]

    A multi-cast algorithm fo r robust average consensus over internet of things environments,

    B. Or´ ostica and F. N´ u˜ nez, “A multi-cast algorithm fo r robust average consensus over internet of things environments,” Computer Communi- cations, vol. 140, pp. 15–22, 2019

    work page 2019

  20. [20]

    Distributed soft clu stering algorithm for iot based on finite time average consensus,

    H. Y u, H. Chen, S. Zhao, and Q. Shi, “Distributed soft clu stering algorithm for iot based on finite time average consensus,” IEEE Internet of Things Journal , 2020

    work page 2020

  21. [21]

    A surve y on consensus methods in blockchain for resource-constrained iot networ ks,

    M. Salimitari, M. Chatterjee, and Y . P . Fallah, “A surve y on consensus methods in blockchain for resource-constrained iot networ ks,” Internet of Things , p. 100212, 2020

    work page 2020

  22. [22]

    Towards secure industrial iot: Blockchain system with credit-base d consensus mechanism,

    J. Huang, L. Kong, G. Chen, M.-Y . Wu, X. Liu, and P . Zeng, “ Towards secure industrial iot: Blockchain system with credit-base d consensus mechanism,” IEEE Transactions on Industrial Informatics, vol. 15, no. 6, pp. 3680–3689, 2019

    work page 2019

  23. [23]

    Towards multiple-mix-attac k detection via consensus-based trust management in iot networks,

    Z. Ma, L. Liu, and W. Meng, “Towards multiple-mix-attac k detection via consensus-based trust management in iot networks,” Computers & Security, vol. 96, p. 101898, 2020

    work page 2020

  24. [24]

    Poah: A novel consensus algorithm for fast scalable private block chain for large-scale iot frameworks,

    D. Puthal, S. P . Mohanty, V . P . Y anambaka, and E. Kougian os, “Poah: A novel consensus algorithm for fast scalable private block chain for large-scale iot frameworks,” arXiv preprint arXiv:2001.07297 , 2020

    work page arXiv 2001

  25. [25]

    Pobt: A lightweight consensus algorithm for scalable iot b usiness blockchain,

    S. Biswas, K. Sharif, F. Li, S. Maharjan, S. P . Mohanty, a nd Y . Wang, “Pobt: A lightweight consensus algorithm for scalable iot b usiness blockchain,” IEEE Internet of Things Journal , vol. 7, no. 3, pp. 2343– 2355, 2019

    work page 2019

  26. [26]

    Consensus-based dis tributed clustering for iot,

    H. Chen, H. Y u, S. Zhao, and Q. Shi, “Consensus-based dis tributed clustering for iot,” in ICASSP 2020-2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) . IEEE, 2020, pp. 8324–8328

    work page 2020

  27. [27]

    Tree-chain: A fast lightweight consensus algorithm for iot applications,

    A. Dorri and R. Jurdak, “Tree-chain: A fast lightweight consensus algorithm for iot applications,” in 2020 IEEE 45th Conference on Local Computer Networks (LCN) . IEEE, 2020, pp. 369–372

    work page 2020

  28. [28]

    A Survey on Consensus Protocols in Blockchain for IoT Networks

    M. Salimitari and M. Chatterjee, “A survey on consensus protocols in blockchain for iot networks,” arXiv preprint arXiv:1809.05613 , 2018

    work page internal anchor Pith review Pith/arXiv arXiv 2018

  29. [29]

    Integration of internet of things and blockchain t oward portabil- ity and low-energy consumption,

    S. Maitra, V . P . Y anambaka, D. Puthal, A. Abdelgawad, an d K. Y ela- marthi, “Integration of internet of things and blockchain t oward portabil- ity and low-energy consumption,” Transactions on Emerging Telecom- munications Technologies, p. e4103, 2020

    work page 2020

  30. [30]

    Robustness of noisy consensus dynamics with directed communication,

    G. F. Y oung, L. Scardovi, and N. E. Leonard, “Robustness of noisy consensus dynamics with directed communication,” in Proceedings of the 2010 American Control Conference . IEEE, 2010, pp. 6312–6317

    work page 2010

  31. [31]

    Consensus in self-simi lar hierarchical graphs and sierpi´ nski graphs: Convergence speed, delay ro bustness, and coherence,

    Y . Qi, Z. Zhang, Y . Yi, and H. Li, “Consensus in self-simi lar hierarchical graphs and sierpi´ nski graphs: Convergence speed, delay ro bustness, and coherence,” IEEE transactions on cybernetics , vol. 49, no. 2, pp. 592– 603, 2018

    work page 2018

  32. [32]

    A consensus base d network intrusion detection system,

    M. Toulouse, B. Q. Minh, and P . Curtis, “A consensus base d network intrusion detection system,” in IT Convergence and Security (ICITCS), 2015 5th International Conference on . IEEE, 2015, pp. 1–6

    work page 2015

  33. [33]

    A local ave rage consensus algorithm for wireless sensor networks,

    K. Avrachenkov, M. El Chamie, and G. Neglia, “A local ave rage consensus algorithm for wireless sensor networks,” 2011

    work page 2011

  34. [34]

    R. B. Bapat, Graphs and matrices . Springer, 2010, vol. 27

    work page 2010