In this paper, we consider the second-order globally nonlinear consensus in a multiagent network with general directed topology and random interconnection failure by characterizing the behavior of stochastic dynamical system with the corresponding time-averaged system. A criterion for the second-order consensus is derived by constructing a Lyapunov function for the time-averaged network. By associating the…
Category: MS IN OMNET++
A comprehensive survey of routing protocols in wireless sensor networks
A wireless sensor network is composed of multifunctional sensor nodes scattered in sensing fields. Wireless sensor networks (WSNs) are widely used in applications like Military, Environmental monitoring, Health (Scanning), Space Exploration, Smart homes, Mechanical stress levels of attached objects, disaster management etc. [30] The transmission of information is a tedious task in WSN due to…
A Novel Computational Model for Non-linear Divisible Loads on a Linear Network
This work investigates the problem of a non-linear divisible load distribution on a homogeneous linear network. A novel computational model of non-linear loads that includes complete steps for processing them, is proposed. This model solves the problem of the classical model, whose performance degrades by separating the load. This work also presents an algorithm S…
ANC-ERA: Random Access for Analog Network Coding in Wireless Networks
Analog network coding (ANC) is effective in improving spectrum efficiency. To coordinate ANC among multiple nodes without relying on complicated scheduling algorithm and network optimization, a new random access MAC protocol, called ANC-ERA, is developed to dynamically form ANC-cooperation groups in an ad hoc network. ANC-ERA includes several key mechanisms to maintain high performance in…
Predictable Dynamics of Opinion Forming for Networks With Antagonistic Interactions
For communities of agents which are not necessarily cooperating, distributed processes of opinion forming are naturally represented by signed graphs, with positive edges representing friendly and cooperative interactions and negative edges the corresponding antagonistic counterpart. Unlike for nonnegative graphs, the outcome of a dynamical system evolving on a signed graph is not obvious and it…