Jul 2026· International Conference on Control, Decision and Information Technologies· pp. 1946-1950· 0 citations· 44 references
Abstract
Wireless Sensor Networks (WSNs) require precise time synchronization to ensure coordinated monitoring operations and data coherence across distributed multi-agent systems. Consensus-based protocols offer a robust, fully distributed solution for synchronizing clock offsets and frequencies by leveraging local information exchange. The convergence speed of such algorithms is heavily dependent on the algebraic connectivity of the network graph, structurally quantified by the second smallest eigenvalue of the graph’s Laplacian matrix. This paper investigates the reduction of convergence time in WSNs by strategically introducing a single dynamic node to an existing network topology. Three distinct criteria for determining the connections of the new node are proposed and mathematically analyzed: an exhaustive search for optimal positioning, a maximum degree constraint approach, and a Twin criterion that emulates the topology of an existing node. Numerical simulations establish that maximizing the second eigenvalue significantly accelerates synchronization. Furthermore, the integration of optimal node placement strategies provides a comprehensive framework for optimizing both resource cost and convergence speed.
This paper investigates the node optimization problem for robust localization and communication in multi-node integrated sensing and communications networks, where the communication users and the target are randomly distributed in a two-dimensional area according to Poisson distribution and uniform distribution, respec...
Kai-Qian Qu, Chen-Hao Qi, Hao-Jin Li et al.· IEEE Transactions on Communi...· 1 citation
Ensuring the stability of the communication structure in robotic swarms with limited communication range requires the development of effective mechanisms for adapting the interaction topology between agents. In dynamically changing environments, conventional fixed-topology approaches prove inadequate, necessitating a...
A. A. Prikhodsky, U. Belkin· Mekhatronika Avtomatizatsiya...· 0 citations
This work develops an edge-based event-triggered distributed inexact gradient descent algorithm that departs from the conventional requirement of full state exchange at every iteration, and shows that the static regret of every agent grows at a sublinear rate of OT provided that the step size, gradient error bound, and...
Adaptive Peer Clustering with Hierarchical RLNC is presented, a system that dynamically groups peers by exponentially weighted moving average (EWMA) reliability metrics and applies multi-tier network coding within and across clusters and establishes adaptive clustering as a foundational primitive for AI-native 6G wirel...
In large-scale network systems, there is a high demand for online optimization, for instance to track time-varying targets in sensor network systems. This article investigates distributed online composite optimization over time-varying, unbalanced multiagent systems with communication delays. Each network node minimize...
Cong Wang, De-Ming Yuan, Qian Ma et al.· IEEE Transactions on Cyberne...· 0 citations
Future low-altitude wireless networks (LAWNs) are expected to simultaneously support sensing, communication, and charging, resulting in tightly coupled multi-objective optimization problems with strong interdependencies among heterogeneous functions. However, existing multi-objective frameworks typically rely on comple...
Han Yu, Jia-Jun He, Zhao-Feng Liu et al.· IEEE Transactions on Vehicul...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.