Heterogeneity-Aware Graph Partitioning for Distributed Deployment of Multiagent Systems

<div>Localization is a fundamental task for optical internet</div><div>of underwater things (O-IoUT) to enable various applications</div><div>such as data tagging, routing, navigation, and maintaining link connectivity. The accuracy of the localization techniques for OIoUT greatly relies on the location of the anchors. Therefore, recently localization techniques for O-IoUT which optimize the anchor’s location are proposed. However, optimization of anchors location for all the smart objects in the network is not a useful solution. Indeed, in a network of densely populated smart objects, the data collected by some sensors are more valuable than the data collected from other sensors. Therefore, in this paper, we propose a three-dimensional accurate localization technique by optimizing the anchor’s location for a set of smart objects. Spectral graph partitioning is used to select the set of valuable</div><div>sensors.</div>

Download Full-text

Mathematics of networks

10.1093/oso/9780198805090.003.0006 ◽

2018 ◽

Author(s):

Mark Newman

Keyword(s):

Random Walks ◽

Adjacency Matrix ◽

Graph Partitioning ◽

Dynamic Networks ◽

Graph Laplacian ◽

Network Visualization ◽

Final Part ◽

Bipartite Networks ◽

Component Structure ◽

Basic Properties

An introduction to the mathematical tools used in the study of networks. Topics discussed include: the adjacency matrix; weighted, directed, acyclic, and bipartite networks; multilayer and dynamic networks; trees; planar networks. Some basic properties of networks are then discussed, including degrees, density and sparsity, paths on networks, component structure, and connectivity and cut sets. The final part of the chapter focuses on the graph Laplacian and its applications to network visualization, graph partitioning, the theory of random walks, and other problems.

Download Full-text

Partial Component Consensus of Discrete-Time Multiagent Systems

Mathematical Problems in Engineering ◽

10.1155/2019/4725418 ◽

2019 ◽

Vol 2019 ◽

pp. 1-5

Author(s):

Wenjun Hu ◽

Gang Zhang ◽

Zhongjun Ma ◽

Binbin Wu

Keyword(s):

Multiagent Systems ◽

Discrete Time ◽

Matrix Theory ◽

Pinning Control ◽

Directed Network ◽

Strong Function ◽

Partial Stability ◽

Partial Component ◽

The Matrix ◽

Error System

The multiagent system has the advantages of simple structure, strong function, and cost saving, which has received wide attention from different fields. Consensus is the most basic problem in multiagent systems. In this paper, firstly, the problem of partial component consensus in the first-order linear discrete-time multiagent systems with the directed network topology is discussed. Via designing an appropriate pinning control protocol, the corresponding error system is analyzed by using the matrix theory and the partial stability theory. Secondly, a sufficient condition is given to realize partial component consensus in multiagent systems. Finally, the numerical simulations are given to illustrate the theoretical results.

Download Full-text