Convergence Analysis for Regular Wireless Consensus Networks

Dhuli, Sateeshkrishna; Gaurav, Kumar; Singh, Yatindra Nath

doi:10.1109/jsen.2015.2420952

Cited by 25 publications

(22 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…and η i (t) tend to be steady values c i , d i ∈ R, respectively. Since the matrix A + is irreducible, the 4 Complexity largest invariant sets of system (9 3) are satisfied with expression (4) for i � 1, 2, . .…”

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Consensus of Second-Order Multiagent Systems with Directed Signed Networks and Communication Delays

Pei

Lai

Li³

2020

Complexity

View full text Add to dashboard Cite

This paper is concerned with the consensus problem for second-order multiagent systems (MASs) with directed signed networks and local communication delays. First, under a strongly connected directed graph, some properties for signed digraph and the model of second-order MASs are provided. A distributed nonlinear consensus control protocol is proposed for implementing consensus of second-order MASs with signed digraph and communication delay. Then, for structurally balanced and unbalanced networks, the consensus of second-order MASs with directed signed networks and local delays is proved via the Lyapunov method and Barbalat lemma. Simulation examples are given to demonstrate the effectiveness of our results.

show abstract

Section: Resultsmentioning

confidence: 99%

“…Consensus is known as an important fundamental branch of cooperative control of MASs, which means all agents can be assured to reach the same state value for any initial states of agents. Moreover, it has a wide range of applications, such as mobile robots [2], unmanned aerial vehicle [3], and sensor networks [4].…”

Section: Introductionmentioning

confidence: 99%

Consensus of Second-Order Multiagent Systems with Directed Signed Networks and Communication Delays

Pei

Lai

Li³

2020

Complexity

View full text Add to dashboard Cite

show abstract

“…Consensus algorithms are based on a self‐organizing behavior of animal groups such as birds, ants, and honeybee, which led to the fundamental understanding in group decision making. This algorithm has gained much popularity and is widely used in wireless sensor networks, spatial distributed control mode and peer‐to‐peer networks . However, in consensus algorithms, link failure or noisy channel during the state updation process, lack of synchronisation among the nodes in each subsequent iteration, may affect the network.…”

Section: Related Workmentioning

confidence: 99%

Mitigating spectrum sensing data falsification attack in ad hoc cognitive radio networks

Rajkumari

Marchang

2018

Int J Communication

View full text Add to dashboard Cite

In a cognitive radio ad hoc network, there is no central authority. Hence, distributed collaborative spectrum sensing (CSS) plays a major role in achieving an accurate spectrum sensing result. However, CSS is sensitive to spectrum sensing data falsification (SSDF) attack, in which a malicious user falsifies its local sensing report before disseminating it into the network. To capture such abnormal behavior of a node, we present an approach for detecting SSDF attack based on dissimilarity score. A secondary user (SU) computes the dissimilarity score of its neighbors from the messages received from its h-hop neighbors. Further, we also present how the proposed scheme can be used on the sequence of sensing reports to detect and isolate the malicious SUs on the fly. KEYWORDScognitive radio, collaborative spectrum sensing, consensus, dissimilarity score, infrastructure-less cognitive radio network, SSDF attack Int J Commun Syst. 2019;32:e3852.wileyonlinelibrary.com/journal/dac

show abstract

“…In reality, time synchronization protocols are highly vulnerable to different security threats like Sybil attack, jamming attack, message (time-stamp) manipulation attack, root node destruction and can badly affect the working of other protocols and applications. Recently, few works started on security threats to distributed consensusbased time synchronization algorithms and attack resilient CTS algorithms have been proposed [3]. Still, many CTS algorithms are not studied and extensively analyzed under different security threats.…”

Section: Introductionmentioning

confidence: 99%

Security Threat Analysis and Countermeasures on Consensus-Based Time Synchronization Algorithms for Wireless Sensor Network

Jha

Gupta

Panigrahi³

2021

SN COMPUT. SCI.

View full text Add to dashboard Cite

Time synchronization is an indispensable and fundamental requirement for all types of wireless sensor networks (WSNs) protocols and applications. The consistency and correctness of other protocols like localization, routing, etc., are highly dependent on time synchronization. However, due to the hostile deployment of wireless sensor networks, they are prone to cyber-physical attacks that create different threats to time synchronization protocols as well. Recently, consensus-based time synchronization (CTS) algorithms are gaining popularity due to their distributed nature and robustness toward different types of threats such as denial-of-service and node destruction. But, the inherent properties of the consensus-based approach of making in-network averaging make these algorithms vulnerable to message manipulation attacks. In this paper, an in-depth simulation-based analysis is conducted using pymote, a python-based discrete event simulator for WSN, on state-of-the-art CTS algorithms in the presence of message manipulation attacks. A novel and generic algorithm, Message Manipulation Attack Resilient CTS (MMAR-CTS) is proposed embedding which the state-of-the-art algorithms are extensively evaluated based on standard performance metrics, e.g., convergence speed, global synchronization error, and local synchronization error in the presence of the attack, and sufficient observations are derived to show the behavior of these algorithms. The comparison of protocols is validated with simulation results. Simulation results show that MMAR-CTS embedded SATS algorithm is 75% more efficient as compared to other candidate algorithms, measured in terms of convergence speed (number of iterations) and nearly 40% improvement in global and local synchronization error.

show abstract

Convergence Analysis for Regular Wireless Consensus Networks

Cited by 25 publications

References 17 publications

Consensus of Second-Order Multiagent Systems with Directed Signed Networks and Communication Delays

Consensus of Second-Order Multiagent Systems with Directed Signed Networks and Communication Delays

Mitigating spectrum sensing data falsification attack in ad hoc cognitive radio networks

Security Threat Analysis and Countermeasures on Consensus-Based Time Synchronization Algorithms for Wireless Sensor Network

Contact Info

Product

Resources

About