scholarly journals Explicit and Tight Bounds of the Convergence Time of Average-Based Population Protocols

Author(s):  
Yves Mocquard ◽  
Bruno Sericola ◽  
Emmanuelle Anceaume
2018 ◽  
Vol 24 (5) ◽  
pp. 66
Author(s):  
Thamer M. Jamel ◽  
Faez Fawzi Hammood

In this paper, several combination algorithms between Partial Update LMS (PU LMS) methods and previously proposed algorithm (New Variable Length LMS (NVLLMS)) have been developed. Then, the new sets of proposed algorithms were applied to an Acoustic Echo Cancellation system (AEC) in order to decrease the filter coefficients, decrease the convergence time, and enhance its performance in terms of Mean Square Error (MSE) and Echo Return Loss Enhancement (ERLE). These proposed algorithms will use the Echo Return Loss Enhancement (ERLE) to control the operation of filter's coefficient length variation. In addition, the time-varying step size is used.The total number of coefficients required was reduced by about 18% , 10% , 6%, and 16% using Periodic, Sequential, Stochastic, and M-max PU NVLLMS algorithms respectively, compared to that used by a full update method which  is very important, especially in the application of mobile communication since the power consumption must be considered. In addition, the average ERLE and average Mean Square Error (MSE) for M-max PU NVLLMS are better than other proposed algorithms.  


Author(s):  
Vaishali R. Kulkarni ◽  
Veena Desai ◽  
Raghavendra Kulkarni

Background & Objective: Location of sensors is an important information in wireless sensor networks for monitoring, tracking and surveillance applications. The accurate and quick estimation of the location of sensor nodes plays an important role. Localization refers to creating location awareness for as many sensor nodes as possible. Multi-stage localization of sensor nodes using bio-inspired, heuristic algorithms is the central theme of this paper. Methodology: Biologically inspired heuristic algorithms offer the advantages of simplicity, resourceefficiency and speed. Four such algorithms have been evaluated in this paper for distributed localization of sensor nodes. Two evolutionary computation-based algorithms, namely cultural algorithm and the genetic algorithm, have been presented to optimize the localization process for minimizing the localization error. The results of these algorithms have been compared with those of swarm intelligence- based optimization algorithms, namely the firefly algorithm and the bee algorithm. Simulation results and analysis of stage-wise localization in terms of number of localized nodes, computing time and accuracy have been presented. The tradeoff between localization accuracy and speed has been investigated. Results: The comparative analysis shows that the firefly algorithm performs the localization in the most accurate manner but takes longest convergence time. Conclusion: Further, the cultural algorithm performs the localization in a very quick time; but, results in high localization error.


Robotica ◽  
2021 ◽  
pp. 1-17
Author(s):  
Seyed Mostafa Almodarresi ◽  
Marzieh Kamali ◽  
Farid Sheikholeslam

Abstract In this paper, new distributed adaptive methods are proposed for solving both leaderless and leader–follower consensus problems in networks of uncertain robot manipulators, by estimating only the gravitational torque forces. Comparing with the existing adaptive methods, which require the estimation of the whole dynamics, presented methods reduce the excitation levels required for efficient parameter search, the convergence time, and the complexity of the regressor. Additionally, proposed schemes eliminate the need for velocity information exchange between the agents. Global asymptotic synchronization is shown by introducing new Lyapunov functions. Simulation results are provided for a network of 10 4-DOF robot manipulators.


Electronics ◽  
2021 ◽  
Vol 10 (12) ◽  
pp. 1484
Author(s):  
Yunyoung Choi ◽  
Jaehyung Park ◽  
Jiwon Jung ◽  
Younggoo Kwon

In home and building automation applications, wireless sensor devices need to be connected via unreliable wireless links within a few hundred milliseconds. Routing protocols in Low-power and Lossy Networks (LLNs) need to support reliable data transmission with an energy-efficient manner and short routing convergence time. IETF standardized the Point-to-Point RPL (P2P-RPL) routing protocol, in which P2P-RPL propagates the route discovery messages over the whole network. This leads to significant routing control packet overhead and a large amount of energy consumption. P2P-RPL uses the trickle algorithm to control the transmission rate of routing control packets. The non-deterministic message suppression nature of the trickle algorithm may generate a sub-optimal routing path. The listen-only period of the trickle algorithm may lead to a long network convergence time. In this paper, we propose Collision Avoidance Geographic P2P-RPL, which achieves energy-efficient P2P data delivery with a fast routing request procedure. The proposed algorithm uses the location information to limit the network search space for the desired route discovery to a smaller location-constrained forwarding zone. The Collision Avoidance Geographic P2P-RPL also dynamically selects the listen-only period of the trickle timer algorithm based on the transmission priority related to geographic position information. The location information of each node is obtained from the Impulse-Response Ultra-WideBand (IR-UWB)-based cooperative multi-hop self localization algorithm. We implement Collision Avoidance Geographic P2P-RPL on Contiki OS, an open-source operating system for LLNs and the Internet of Things. The performance results show that the Collision Avoidance Geographic P2P-RPL reduced the routing control packet overheads, energy consumption, and network convergence time significantly. The cooperative multi-hop self localization algorithm improved the practical implementation characteristics of the P2P-RPL protocol in real world environments. The collision avoidance algorithm using the dynamic trickle timer increased the operation efficiency of the P2P-RPL under various wireless channel conditions with a location-constrained routing space.


Author(s):  
Michael Blondin ◽  
Javier Esparza ◽  
Stefan Jaax ◽  
Philipp J. Meyer

AbstractPopulation protocols are a well established model of computation by anonymous, identical finite-state agents. A protocol is well-specified if from every initial configuration, all fair executions of the protocol reach a common consensus. The central verification question for population protocols is the well-specification problem: deciding if a given protocol is well-specified. Esparza et al. have recently shown that this problem is decidable, but with very high complexity: it is at least as hard as the Petri net reachability problem, which is -hard, and for which only algorithms of non-primitive recursive complexity are currently known. In this paper we introduce the class $${ WS}^3$$ WS 3 of well-specified strongly-silent protocols and we prove that it is suitable for automatic verification. More precisely, we show that $${ WS}^3$$ WS 3 has the same computational power as general well-specified protocols, and captures standard protocols from the literature. Moreover, we show that the membership and correctness problems for $${ WS}^3$$ WS 3 reduce to solving boolean combinations of linear constraints over $${\mathbb {N}}$$ N . This allowed us to develop the first software able to automatically prove correctness for all of the infinitely many possible inputs.


Author(s):  
Abdelkrim Brahmi ◽  
Maarouf Saad ◽  
Brahim Brahmi ◽  
Ibrahim El Bojairami ◽  
Guy Gauthier ◽  
...  

In the research put forth, a robust adaptive control method for a nonholonomic mobile manipulator robot, with unknown inertia parameters and disturbances, was proposed. First, the description of the robot’s dynamics model was developed. Thereafter, a novel adaptive sliding mode control was designed, to which all parameters describing involved uncertainties and disturbances were estimated by the adaptive update technique. The proposed control ensures a relatively good system tracking, with all errors converging to zero. Unlike conventional sliding mode controls, the suggested is able to achieve superb performance, without resulting in any chattering problems, along with an extremely fast system trajectories convergence time to equilibrium. The aforementioned characteristics were attainable upon using an innovative reaching law based on potential functions. Furthermore, the Lyapunov approach was used to design the control law and to conduct a global stability analysis. Finally, experimental results and comparative study collected via a 05-DoF mobile manipulator robot, to track a given trajectory, showing the superior efficiency of the proposed control law.


2020 ◽  
Vol 11 (1) ◽  
pp. 104
Author(s):  
Peipei Dai ◽  
Jianping Xing ◽  
Yulong Ge ◽  
Xuhai Yang ◽  
Weijin Qin ◽  
...  

The timing group delay parameter (TGD) or differential code bias parameter (DCB) is an important factor that affects the performance of GNSS basic services; therefore, TGD and DCB must be taken seriously. Moreover, the TGD parameter is modulated in the navigation message, taking into account the impact of TGD on the performance of the basic service. International GNSS Monitoring and Assessment System (iGMAS) provides the broadcast ephemeris with TGD parameter and the Chinese Academy of Science (CAS) provides DCB products. In this paper, the current available BDS-3 TGD and DCB parameters are firstly described in detail, and the relationship of TGD and DCB for BDS-3 is figured out. Then, correction models of BDS-3 TGD and DCB in standard point positioning (SPP) or precise point positioning (PPP) are given, which can be applied in various situations. For the effects of TGD and DCB in the SPP and PPP solution processes, all the signals from BDS-3 were researched, and the validity of TGD and DCB has been further verified. The experimental results show that the accuracy of B1I, B1C and B2a single-frequency SPP with TGD or DCB correction was improved by approximately 12–60%. TGD will not be considered for B3I single-frequency, because the broadcast satellite clock offset is based on the B3I as the reference signal. The positioning accuracy of B1I/B3I and B1C/B2a dual-frequency SPP showed that the improvement range for horizontal components is 60.2% to 74.4%, and the vertical components improved by about 50% after the modification of TGD and DCB. In addition, most of the uncorrected code biases are mostly absorbed into the receiver clock bias and other parameters for PPP, resulting in longer convergence time. The convergence time can be max increased by up to 50% when the DCB parameters are corrected. Consequently, the positioning accuracy can reach the centimeter level after convergence, but it is critical for PPP convergence time and receiver clock bias that the TGD and DCB correction be considered seriously.


2019 ◽  
Vol 11 (3) ◽  
pp. 228 ◽  
Author(s):  
Xingxing Li ◽  
Hongbo Lv ◽  
Fujian Ma ◽  
Xin Li ◽  
Jinghui Liu ◽  
...  

It is widely known that in real-time kinematic (RTK) solution, the convergence and ambiguity-fixed speeds are critical requirements to achieve centimeter-level positioning, especially in medium-to-long baselines. Recently, the current status of the global navigation satellite systems (GNSS) can be improved by employing low earth orbit (LEO) satellites. In this study, an initial assessment is applied for LEO constellations augmented GNSS RTK positioning, where four designed LEO constellations with different satellite numbers, as well as the nominal GPS constellation, are simulated and adopted for analysis. In terms of aforementioned constellations solutions, the statistical results of a 68.7-km baseline show that when introducing 60, 96, 192, and 288 polar-orbiting LEO constellations, the RTK convergence time can be shortened from 4.94 to 2.73, 1.47, 0.92, and 0.73 min, respectively. In addition, the average time to first fix (TTFF) can be decreased from 7.28 to 3.33, 2.38, 1.22, and 0.87 min, respectively. Meanwhile, further improvements could be satisfied in several elements such as corresponding fixing ratio, number of visible satellites, position dilution of precision (PDOP) and baseline solution precision. Furthermore, the performance of the combined GPS/LEO RTK is evaluated over various-length baselines, based on convergence time and TTFF. The research findings show that the medium-to-long baseline schemes confirm that LEO satellites do helpfully obtain faster convergence and fixing, especially in the case of long baselines, using large LEO constellations, subsequently, the average TTFF for long baselines has a substantial shortened about 90%, in other words from 12 to 2 min approximately by combining with the larger LEO constellation of 192 or 288 satellites. It is interesting to denote that similar improvements can be observed from the convergence time.


Author(s):  
Janna Burman ◽  
Ho-Lin Chen ◽  
Hsueh-Ping Chen ◽  
David Doty ◽  
Thomas Nowak ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document