Average Bridge Consensus: Dealing With Active-Passive Sensors

2015 ◽  
Author(s):  
David W. Casbeer ◽  
Yongcan Cao ◽  
Eloy Garcia ◽  
Dejan Milutinović
Keyword(s):  
Network Communication ◽  
Consensus Problem ◽  
Solution Properties ◽  
Initial Value ◽  
Large Networks ◽  
Network Nodes ◽  
Numerical Example ◽  
Average Consensus ◽  
Passive Sensors ◽  
Failed Node

In network average consensus problems, a failure, in which a node cannot provide the initial value, but can communicate with its neighbors gives rise to the bridge consensus problem. In its formulation, the failed node serves as a bridge which maintains the network communication connectivity, and its failure to provide the value does not impact the capability of the rest of the network nodes to reach a consensus. The proposed bridge consensus solution can deal with multiple failing nodes and large networks in a scalable manner. The solution properties are proven and illustrated by a numerical example.

Weak average consensus of multi-agent system with partial flowing nodes

2016 ◽  
Vol 39 (8) ◽  
pp. 1216-1224 ◽  
Author(s):  
Jinping Mou ◽  
Huafeng Ge ◽  
Jie Wang
Keyword(s):  
Lyapunov Function ◽  
Iterative Method ◽  
Consensus Problem ◽  
Multi Agent System ◽  
Agent System ◽  
Numerical Example ◽  
Common Value ◽  
Average Consensus ◽  
Multi Agent

A weak average consensus problem is investigated for a distributed multi-agent system with partial flowing nodes (MASPFN), which is composed of subsystem I and subsystem II: subsystem I consists of a fixed agent set, whereas subsystem II consists of a varying agent set in which some agents may join in or quit from the multi-agent system with partial flowing nodes randomly. The weak average consensus refers to the fact that states of all agents in subsystem I approach a common value under the influence of subsystem II. Based on the Lyapunov function and the iterative method, several consensus criteria are obtained. One numerical example shows the reliability of the proposed methods.

scholarly journals An Energy Efficient Simultaneous-Node Repositioning Algorithm for Mobile Sensor Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-14 ◽  
Author(s):  
Muhammad Amir Khan ◽  
Halabi Hasbullah ◽  
Babar Nazir ◽  
Imran Ali Khan
Keyword(s):  
Energy Efficient ◽  
Mobile Sensor Networks ◽  
Wireless Sensor ◽  
Mobile Nodes ◽  
Network Nodes ◽  
Connectivity Restoration ◽  
Communication Problems ◽  
Area Of Interest ◽  
Simulation Results ◽  
Failed Node

Recently, wireless sensor network (WSN) applications have seen an increase in interest. In search and rescue, battlefield reconnaissance, and some other such applications, so that a survey of the area of interest can be made collectively, a set of mobile nodes is deployed. Keeping the network nodes connected is vital for WSNs to be effective. The provision of connectivity can be made at the time of startup and can be maintained by carefully coordinating the nodes when they move. However, if a node suddenly fails, the network could be partitioned to cause communication problems. Recently, several methods that use the relocation of nodes for connectivity restoration have been proposed. However, these methods have the tendency to not consider the potential coverage loss in some locations. This paper addresses the concerns of both connectivity and coverage in an integrated way so that this gap can be filled. A novel algorithm for simultaneous-node repositioning is introduced. In this approach, each neighbour of the failed node, one by one, moves in for a certain amount of time to take the place of the failed node, after which it returns to its original location in the network. The effectiveness of this algorithm has been verified by the simulation results.

scholarly journals Nonlinear Consensus Protocol Modified from Doubly Stochastic Quadratic Operators in Networks of Dynamic Agents

Symmetry ◽  
2019 ◽  
Vol 11 (12) ◽  
pp. 1519 ◽  
Author(s):  
Rawad Abdulghafor ◽  
Sultan Almotairi ◽  
Hamad Almohamedh ◽  
Sherzod Turaev ◽  
Badr Almutairi
Keyword(s):  
Theoretical Analysis ◽  
Consensus Problem ◽  
Multi Agent Systems ◽  
Consensus Protocol ◽  
Agent Systems ◽  
Doubly Stochastic ◽  
Average Consensus ◽  
Multi Agent ◽  
Mathematical Equations ◽  
Simulation Results

This article explores nonlinear convergence to limit the effects of the consensus problem that usually occurs in multi-agent systems. Most of the existing research essentially considers the outline of linear protocols, using complex mathematical equations in various orders. In this work, however, we designed and developed an alternative nonlinear protocol based on simple and effective mathematical approaches. The designed protocol in this sense was modified from the Doubly Stochastic Quadratic Operators (DSQO) and was aimed at resolving consensus problems. Therefore, we called it Modified Doubly Stochastic Quadratic Operators (MDSQO). The protocol was derived in the context of coordinated systems to overcome the consensus issue related to multi-agent systems. In the process, we proved that by using the proposed nonlinear protocol, the consensus could be reached via a common agreement among the agents (average consensus) in a fast and easy fashion without losing any initial status. Moreover, the investigated nonlinear protocol of MDSQO realized the reaching consensus always as well as DSQO in some cases, which could not reach consensus. Finally, simulation results were given to prove the validity of the theoretical analysis.

scholarly journals Adaptive Consensus of Distributed Varying Scale Wireless Sensor Networks under Tolerable Jamming Attacks

2013 ◽  
Vol 2013 ◽  
pp. 1-11
Author(s):  
Jinping Mou
Keyword(s):  
Wireless Sensor Networks ◽  
Dwell Time ◽  
Lyapunov Method ◽  
Wireless Sensor ◽  
Consensus Problem ◽  
Consensus Protocol ◽  
Jamming Attacks ◽  
Jamming Attack ◽  
Average Consensus ◽  
The Given

Consensus problem is investigated for a varying scale wireless sensor network (VSWSN) under tolerable jamming attacks, where the scale of the network is increasing or decreasing due to the newly joined nodes or the removed nodes, respectively; the tolerable jamming attack means that the attack strength is limited. It supposes that during the communications, all nodes may encounter with the tolerable jamming attacks; when the attack power is larger than the given value, the attacked nodes fall asleep, or otherwise the nodes are awakened. Under the sleep method, based on the Lyapunov method, it shows that if the communicating graph is the global limited intersectional connection (GLI connection) and the system has the enough dwell time in the intersectional topology, then under the designed consensus protocol, all nodes achieve the global average consensus.

scholarly journals Optimal strategies in the average consensus problem

2009 ◽  
Vol 58 (10-11) ◽  
pp. 759-765 ◽  
Author(s):  
Jean-Charles Delvenne ◽  
Ruggero Carli ◽  
Sandro Zampieri
Keyword(s):  
Optimal Strategies ◽  
Consensus Problem ◽  
Average Consensus

scholarly journals A Practical Framework for the Analysis of Average Consensus Problem: Laplacian Generator and Analyzer Algorithm

2016 ◽  
Vol 49 (3) ◽  
pp. 341-346
Author(s):  
Mustafa Saraoğlu ◽  
Aydın Polat ◽  
İlhan Mutlu ◽  
Mehmet Turan Söylemez
Keyword(s):  
Consensus Problem ◽  
Average Consensus
Sign in / Sign up

Export Citation Format

Share Document