distributed algorithms
Recently Published Documents


TOTAL DOCUMENTS

928
(FIVE YEARS 142)

H-INDEX

46
(FIVE YEARS 6)

2022 ◽  
Vol 1215 (1) ◽  
pp. 012001
Author(s):  
O.N. Granichin ◽  
O.A. Granichina ◽  
V.A. Erofeeva ◽  
A.V. Leonova ◽  
A.A. Senov

Abstract Emergent intelligence is a property of a system of elements that is not inherent in each element individually. This behavior is based on local communications. This behavior helps to adapt to emerging uncertainties and achieve a global goal. This behavior exists in the natural world. A simplified example of emergent intelligence from the natural world is given. The repetition of natural behavior with the help of simple technical devices, which are limited in resources and cheap in construction, and the use of multi-agent approaches is considered. Distributed algorithms using local communications are considered. Such algorithms are more robust to noise.


2022 ◽  
pp. 1-33
Author(s):  
Sercan Demirci ◽  
Serhat Celil Ileri ◽  
Sadat Duraki

Theoretical applications and practical network algorithms are not very cost-effective, and most of the algorithms in the commercial market are implemented in the cutting-edge devices. Open-source network simulators have gained importance in recent years due to the necessity to implement network algorithms in more realistic scenarios with reasonable costs, especially for educational purposes and scientific researches. Although there have been various simulation tools, NS2 and NS3, OMNeT++ is more suitable to demonstrate network algorithms because it is convenient for the model establishment, modularization, expandability, etc. OMNeT++ network simulator is selected as a testbed in order to verify the correctness of the network algorithms. The study focuses on the algorithms based on centralized and distributed approaches for multi-hop networks in OMNeT++. Two network algorithms, the shortest path algorithm and flooding-based asynchronous spanning tree algorithm, were examined in OMNeT++. The implementation, analysis, and visualization of these algorithms have also been addressed.


2021 ◽  
Vol 8 (4) ◽  
pp. 1-25
Author(s):  
Laurent Feuilloley ◽  
Pierre Fraigniaud

We carry on investigating the line of research questioning the power of randomization for the design of distributed algorithms. In their seminal paper, Naor and Stockmeyer [STOC 1993] established that, in the context of network computing in which all nodes execute the same algorithm in parallel, any construction task that can be solved locally by a randomized Monte-Carlo algorithm can also be solved locally by a deterministic algorithm. This result, however, holds only for distributed tasks such that the correctness of their solutions can be locally checked by a deterministic algorithm. In this article, we extend the result of Naor and Stockmeyer to a wider class of tasks. Specifically, we prove that the same derandomization result holds for every task such that the correctness of their solutions can be locally checked using a 2-sided error randomized Monte-Carlo algorithm.


Author(s):  
Othon Michail ◽  
George Skretas ◽  
Paul G. Spirakis

AbstractWe study here systems of distributed entities that can actively modify their communication network. This gives rise to distributed algorithms that apart from communication can also exploit network reconfiguration to carry out a given task. Also, the distributed task itself may now require a global reconfiguration from a given initial network $$G_s$$ G s to a target network $$G_f$$ G f from a desirable family of networks. To formally capture costs associated with creating and maintaining connections, we define three edge-complexity measures: the total edge activations, the maximum activated edges per round, and the maximum activated degree of a node. We give (poly)log(n) time algorithms for the task of transforming any $$G_s$$ G s into a $$G_f$$ G f of diameter (poly)log(n), while minimizing the edge-complexity. Our main lower bound shows that $$\varOmega (n)$$ Ω ( n ) total edge activations and $$\varOmega (n/\log n)$$ Ω ( n / log n ) activations per round must be paid by any algorithm (even centralized) that achieves an optimum of $$\varTheta (\log n)$$ Θ ( log n ) rounds. We give three distributed algorithms for our general task. The first runs in $$O(\log n)$$ O ( log n ) time, with at most 2n active edges per round, a total of $$O(n\log n)$$ O ( n log n ) edge activations, a maximum degree $$n-1$$ n - 1 , and a target network of diameter 2. The second achieves bounded degree by paying an additional logarithmic factor in time and in total edge activations. It gives a target network of diameter $$O(\log n)$$ O ( log n ) and uses O(n) active edges per round. Our third algorithm shows that if we slightly increase the maximum degree to polylog(n) then we can achieve $$o(\log ^2 n)$$ o ( log 2 n ) running time.


2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Xuehui Jiang

With the development of the mobile Internet, e-commerce has become one of the important ways of daily consumption, but how to effectively use e-commerce for interactive marketing and increase sales is an important research direction. Mobile ad hoc distributed algorithms are introduced in this paper. Through sorting out the mode of e-commerce interaction influence, process marketing is performed from two-dimensional code, short message, business district, mobile search, Bluetooth, wireless network, and other methods, and interactive marketing is tried in various industries such as education, tourism, agriculture, catering, finance, and publishing, and simulation experiments are used to verify them. The simulation experiment results show that the mobile ad hoc distributed algorithms are effective and can support the e-commerce interactive marketing model.


Author(s):  
Talya Eden ◽  
Nimrod Fiat ◽  
Orr Fischer ◽  
Fabian Kuhn ◽  
Rotem Oshman

2021 ◽  
Author(s):  
◽  
Seyed Reza Mir Alavi

<p>Communication is performed by transmitting signals through a medium. It is common that signals originating from different sources are mixed in the transport medium. The operation of separating source signals without prior information about the sources is referred to as blind source separation (BSS). Blind source separation for wireless sensor networks has recently received attention because of low cost and the easy coverage of large areas. Distributed processing is attractive as it is scalable and consumes low power. Existing distributed BSS algorithms either require a fully connected pattern of connectivity, to ensure the good performance, or require a high computational load at each sensor node, to enhance the scalability. This motivates us to develop distributed BSS algorithms that can be implemented over any arbitrary graph with fully shared computations and with good performance.  This thesis presents three studies on distributed algorithms. The first two studies are on existing distributed algorithms that are used in linearly constrained convex optimization problems, which are common in signal processing and machine learning. The studies are aimed at improving the algorithms in terms of computational complexity, communication cost, processors coordination and scalability. This makes them more suitable for implementation on sensor networks, thus forming a basis for the development of distributed BSS algorithms on sensor networks in our third study.  In the first study, we consider constrained problems in which the constraint includes a weighted sum of all the decision variables. By formulating a constrained dual problem associated to the original constrained problem, we were able to develop a distributed algorithm that can be run both synchronously and asynchronously on any arbitrary graph with lower communication cost than traditional distributed algorithms.  In the second study, we consider constrained problems in which the constraint is separable. By making use of the augmented Lagrangian function and splitting the dual variable (Lagrange multiplier) associated to each partial constraint, we were able to develop a distributed fully asynchronous algorithm with lower computational complexity than traditional distributed algorithms. The simplicity of the algorithm is the consequence of approximating the constraint on the equality of the decoupled dual variables. We also provide a measure of the inaccuracy in such an approximation on the optimal value of the primal objective function. Finally, in the third study, we investigate distributed processing solutions for BSS on sensor networks. We propose two distributed processing schemes for BSS that we refer to as scheme 1 and scheme 2. In scheme 1, each sensor node estimates one specific source signal while in scheme 2, by formulating a consensus optimization problem, each sensor node estimates all source signals in a fully shared computation manner. Our proposed algorithms carry the following features: low computational complexity, low power consumption, low data transmission rate, scalability and excellent performance over arbitrary graphs. Although all of our proposed algorithms share the aforementioned properties, each of them is superior in one or some of the features compared to the others. Comparative experimental results show that among all our proposed distributed BSS algorithms, a variant of scheme 1 performs best when all features are considered. This is achieved by making use of the concept of pairwise mutual information along with adding a sparsity assumption on the parameters of the model that is used in BSS.</p>


2021 ◽  
Author(s):  
◽  
Seyed Reza Mir Alavi

<p>Communication is performed by transmitting signals through a medium. It is common that signals originating from different sources are mixed in the transport medium. The operation of separating source signals without prior information about the sources is referred to as blind source separation (BSS). Blind source separation for wireless sensor networks has recently received attention because of low cost and the easy coverage of large areas. Distributed processing is attractive as it is scalable and consumes low power. Existing distributed BSS algorithms either require a fully connected pattern of connectivity, to ensure the good performance, or require a high computational load at each sensor node, to enhance the scalability. This motivates us to develop distributed BSS algorithms that can be implemented over any arbitrary graph with fully shared computations and with good performance.  This thesis presents three studies on distributed algorithms. The first two studies are on existing distributed algorithms that are used in linearly constrained convex optimization problems, which are common in signal processing and machine learning. The studies are aimed at improving the algorithms in terms of computational complexity, communication cost, processors coordination and scalability. This makes them more suitable for implementation on sensor networks, thus forming a basis for the development of distributed BSS algorithms on sensor networks in our third study.  In the first study, we consider constrained problems in which the constraint includes a weighted sum of all the decision variables. By formulating a constrained dual problem associated to the original constrained problem, we were able to develop a distributed algorithm that can be run both synchronously and asynchronously on any arbitrary graph with lower communication cost than traditional distributed algorithms.  In the second study, we consider constrained problems in which the constraint is separable. By making use of the augmented Lagrangian function and splitting the dual variable (Lagrange multiplier) associated to each partial constraint, we were able to develop a distributed fully asynchronous algorithm with lower computational complexity than traditional distributed algorithms. The simplicity of the algorithm is the consequence of approximating the constraint on the equality of the decoupled dual variables. We also provide a measure of the inaccuracy in such an approximation on the optimal value of the primal objective function. Finally, in the third study, we investigate distributed processing solutions for BSS on sensor networks. We propose two distributed processing schemes for BSS that we refer to as scheme 1 and scheme 2. In scheme 1, each sensor node estimates one specific source signal while in scheme 2, by formulating a consensus optimization problem, each sensor node estimates all source signals in a fully shared computation manner. Our proposed algorithms carry the following features: low computational complexity, low power consumption, low data transmission rate, scalability and excellent performance over arbitrary graphs. Although all of our proposed algorithms share the aforementioned properties, each of them is superior in one or some of the features compared to the others. Comparative experimental results show that among all our proposed distributed BSS algorithms, a variant of scheme 1 performs best when all features are considered. This is achieved by making use of the concept of pairwise mutual information along with adding a sparsity assumption on the parameters of the model that is used in BSS.</p>


Sign in / Sign up

Export Citation Format

Share Document