Loading...

Distributed Algorithm Design for Function Computation with Limited Computational Resources

Bandeali Naeini, Hamid Reza | 2019

455 Viewed
  1. Type of Document: M.Sc. Thesis
  2. Language: Farsi
  3. Document No: 52436 (05)
  4. University: Sharif University of Technology
  5. Department: Electrical Engineering
  6. Advisor(s): Saleh Kaleybar, Saber
  7. Abstract:
  8. In some applications of distributed systems, agents use weak communication models instead of sending and receiving messages to each other. Beeping, Stone-age, and Population protocols are examples of weak communication models. For example, population protocols are currently used in a variety of areas, such as biological systems (like molecular programming).In this model, the agents are initialized based on their own values. These agents then wake up according to their local clocks and interact with other agents randomly. During these interactions and updating states repeatedly, the agents converge to their final states, which is the expected outcome of the problem.We consider the problem of multi-choice majority voting in a network of n agents where each agent initially selects a choice from a set of K possible choices. The agents try to infer the choice in majority merely by performing local interactions. Population protocols provide a framework for designing pairwise interactions between agents in order to perform tasks in a coordinated manner. In this paper, we propose “Broadcasting Population Protocol” model as a counterpart model of conventional population protocols for the networks that each agent can send a message to all its neighbors simultaneously. We design two distributed algorithms for solving the multi-choice majority voting problem in the model of broadcasting population protocols. We prove the correctness of these algorithms and analyze their performance in terms of time and message complexities. Experiments show that the proposed algorithms improve both time and message complexities significantly with respect to previous algorithms proposed in conventional population protocols and they can be utilized in networks where messages can be transmitted to a subset of agents simultaneously such as wireless networks.In the next part of this thesis, we study the effect of Byzantine agents on the problem of binary majority voting. By changing the mechanism of interactions between agents, we propose a solution to reduce the effect of Byzantine agents on the final results of non-faulty agents
  9. Keywords:
  10. Population Protocols ; Distributed Algorithm ; Majority Vote ; Distributed Computing ; Byzantine Attacks

 Digital Object List

 Bookmark

No TOC