Search for: gossip-protocol
Ph.D. Dissertation Sharif University of Technology ; Ardeshir, Mohammad
Epistemic algorithms are instructions and rules based on knowledge of agents. These algorithms by individual or group knowledge of agents make decisions about future behavior of systems. Epistemic gossip protocols is one of these algorithms. They are used to for spreading secrets among nodes in a network. According to individual knowledge of each node they decide who calls whom in each step. In security problems epistemic algorithms are used to detect the safety of protocols. Some epistemic notions like ignorance and contingency are used in formalization of security problems. In the thesis we study these epistemic algorithms
Article Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 12 October 2011 through 13 October 2011, Borrowdale ; Volume 6977 LNCS , 2011 , Pages 174-188 ; 03029743 (ISSN) ; 9783642247484 (ISBN) ; Fokkink, W ; Habibi, J ; Sharif University of Technology
Analytical models exist for evaluating gossip-based information propagation. Up to now these models were developed only for fully connected networks. We provide analytical models for information propagation of a push-pull gossiping protocol in a wireless mesh network. The underlying topology is abstracted away by assuming that the wireless nodes are uniformly deployed. We compare our models with simulation results for different topologies
Article IEEE Transactions on Parallel and Distributed Systems ; Volume 27, Issue 6 , 2016 , Pages 1811-1823 ; 10459219 (ISSN) ; Golestani, S. J ; Sharif University of Technology
IEEE Computer Society 2016
In distributed function computation, each node has an initial value and the goal is to compute a function of these values in a distributed manner. In this paper, we propose a novel token-based approach to compute a wide class of target functions to which we refer as "token-based function computation with memory" (TCM) algorithm. In this approach, node values are attached to tokens and travel across the network. Each pair of travelling tokens would coalesce when they meet, forming a token with a new value as a function of the original token values. In contrast to the coalescing random walk (CRW) algorithm, where token movement is governed by random walk, meeting of tokens in our scheme is...
Article Journal of Applied Logic ; Volume 20 , 2017 , Pages 1-31 ; 15708683 (ISSN) ; Van Eijck, J ; Pardo, P ; Ramezanian, R ; Schwarzentruber, F ; Sharif University of Technology
A gossip protocol is a procedure for spreading secrets among a group of agents, using a connection graph. In each call between a pair of connected agents, the two agents share all the secrets they have learnt. In dynamic gossip problems, dynamic connection graphs are enabled by permitting agents to spread as well the telephone numbers of other agents they know. This paper characterizes different distributed epistemic protocols in terms of the (largest) class of graphs where each protocol is successful, i.e. where the protocol necessarily ends up with all agents knowing all secrets. © 2016 Elsevier B.V
Article CSI International Symposium on Real-Time and Embedded Systems and Technologies, RTEST 2018 ; 26 June , 2018 , Pages 63-70 ; 9781538614754 (ISBN) ; Abdi, E ; Habibi, J ; Sharif University of Technology
Institute of Electrical and Electronics Engineers Inc 2018
Development of Internet of things (IoT) applications brings a new movement to the functionality of wireless sensor networks (WSNs) from only environment sensing and data gathering to collaborative inferring and ubiquitous intelligence. In intelligent WSNs, nodes collaborate to exchange the information needed to achieve the required inference or smartness. Efficiency or correctness of many smart applications rely on efficient, timely, reliable, and ubiquitous inference of information which may continually change in interaction with other nodes. In this paper, we introduce a framework which provides a generic solution for such common ubiquitous inferences. This framework brings the reliability...
Article Bulletin of the Iranian Mathematical Society ; Volume 45, Issue 3 , 2019 , Pages 701-728 ; 10186301 (ISSN) ; van Eijck, J ; Pardo, P ; Ramezanian, R ; Schwarzentruber, F ; Sharif University of Technology
Springer International Publishing 2019
A gossip protocol is a procedure for spreading secrets among a group of agents, using a connection graph. The goal is for all agents to get to know all secrets, in which case we call the execution of the protocol successful. We consider distributed and dynamic gossip protocols. In distributed gossip, the agents themselves instead of a global scheduler determine whom to call. In dynamic gossip, not only secrets are exchanged but also telephone numbers (agent identities). This results in increased graph connectivity. We define six such distributed dynamic gossip protocols, and we characterize them in terms of the topology of the graphs on which they are successful, wherein we distinguish...