scholarly journals Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks

2021 ◽  
Vol 68 (2) ◽  
pp. 1-22
Author(s):  
Artur Czumaj ◽  
Peter Davies

We study two fundamental communication primitives: broadcasting and leader election in the classical model of multi-hop radio networks with unknown topology and without collision detection mechanisms. It has been known for almost 20 years that in undirected networks with n nodes and diameter D , randomized broadcasting requires Ω( D log n / D + log 2 n ) rounds, assuming that uninformed nodes are not allowed to communicate (until they are informed). Only very recently, Haeupler and Wajc (PODC'2016) showed that this bound can be improved for the model with spontaneous transmissions, providing an O ( D log n log log n /log D + log O (1) n )-time broadcasting algorithm. In this article, we give a new and faster algorithm that completes broadcasting in O ( D log n /log D + log O (1) n ) time, succeeding with high probability. This yields the first optimal O ( D )-time broadcasting algorithm whenever n is polynomial in D . Furthermore, our approach can be applied to design a new leader election algorithm that matches the performance of our broadcasting algorithm. Previously, all fast randomized leader election algorithms have used broadcasting as a subroutine and their complexity has been asymptotically strictly larger than the complexity of broadcasting. In particular, the fastest previously known randomized leader election algorithm of Ghaffari and Haeupler (SODA'2013) requires O ( D log n / D min {log log n , log n / D } + log O (1) n )-time, succeeding with high probability. Our new algorithm again requires O ( D log n /log D + log O (1) n ) time, also succeeding with high probability.

Author(s):  
E. R. S. Subramanian ◽  
B. Sri Gurubaran ◽  
A. S. Sayee Shruthi ◽  
V. Aishwarya ◽  
N. Balaji ◽  
...  

Author(s):  
Jayanta Das ◽  
Abhijit Das

Security and trust are two inevitable concepts for secure Manet. There are various systems used for ensuring security and trust in case of Manet. These systems have several advantages as well as several disadvantages in terms high communication and computation overhead. In this proposed trust based system, trust of node is evaluated on the basis of ratio of signal sent and acknowledgement received. After that, priority of each node is calculated and at last Leader Election algorithm is applied to select node leader.


2009 ◽  
Vol 12 (4) ◽  
pp. 449-478 ◽  
Author(s):  
Guy Louchard ◽  
Helmut Prodinger

1995 ◽  
Vol 3 (3) ◽  
pp. 195-201
Author(s):  
Tai Woo Kim ◽  
Tai Yun Kim

Sign in / Sign up

Export Citation Format

Share Document