scholarly journals Random asynchronous iterations in distributed coordination algorithms

Automatica ◽  
2019 ◽  
Vol 109 ◽  
pp. 108505 ◽  
Author(s):  
Yao Chen ◽  
Weiguo Xia ◽  
Ming Cao ◽  
Jinhu Lü
Author(s):  
Mahdi Jadaliha ◽  
Joonho Lee ◽  
Jongeun Choi

In this paper, we design and analyze a class of multiagent systems that locate peaks of uncertain static fields in a distributed and scalable manner. The scalar field of interest is assumed to be generated by a radial basis function network. Our distributed coordination algorithms for multiagent systems build on techniques from adaptive control. Each agent is driven by swarming and gradient ascent efforts based on its own recursively estimated field via locally collected measurements by itself and its neighboring agents. The convergence properties of the proposed multiagent systems are analyzed. We also propose a sampling scheme to facilitate the convergence. We provide simulation results by applying our proposed algorithms to nonholonomic differentially driven mobile robots. The extensive simulation results match well with the predicted behaviors from the convergence analysis and illustrate the usefulness of the proposed coordination and sampling algorithms.


Author(s):  
Arvind Kakria ◽  
Trilok Chand Aseri

Background & Objective: Wireless communication has immensely grown during the past few decades due to significant demand for mobile access. Although cost-effective as compared to their wired counterpart, maintaining good quality-of-service (QoS) in these networks has always remained a challenge. Multiple-input Multiple-output (MIMO) systems, which consists of multiple transmitter and receiver antennas, have been widely acknowledged for their QoS and transmit diversity. Though suited for cellular base stations, MIMO systems are not suited for small-sized wireless nodes due to their hardware complexity, cost, and increased power requirements. Cooperative communication that allows relays, i.e. mobile or fixed nodes in a communication network, to share their resources and forward other node’s data to the destination node has substituted the MIMO systems nowadays. To harness the full benefit of cooperative communication, appropriate relay node selection is very important. This paper presents an efficient single-hop distributed relay supporting medium access control (MAC) protocol (EDSRS) that works in the single-hop environment and improves the energy efficiency and the life of relay nodes without compensating the throughput of the network. Methods: The protocol has been simulated using NS2 simulator. The proposed protocol is compared with energy efficient cooperative MAC protocol (EECOMAC) and legacy distributed coordination function (DCF) on the basis of throughput, energy efficiency, transmission delay and an end to end delay with various payload sizes. Result and Conclusion: The result of the comparison indicates that the proposed protocol (EDSRS) outperforms the other two protocols.


Sign in / Sign up

Export Citation Format

Share Document