Speaker : Vinay Kumar
Affiliation: PhD, ECE Dept, IISc Bangalore
Date and Time : September 24, 2021 (Friday), 5:00 PM to 5:45 PM
Talk Recording YouTube Link: https://youtu.be/qG0x-eeg79I
Abstract :
Motivated by applications in Wireless Sensor Networks and the Internet of Things, in this talk, we consider the problem of energy-efficient broadcasting on random geometric graphs (RGGs). A source node at the origin encodes k data packets of information into n > k coded packets and transmits them to all its one-hop neighbors. The encoding is such that, any node that receives at least k out of the n coded packets can retrieve the original k data packets. Every other node in the network follows a probabilistic forwarding protocol; upon reception of a previously unreceived packet, the node forwards it with probability p and does nothing with probability 1-p. We are interested in the minimum forwarding probability which ensures that a large fraction of nodes can decode the information from the source. We deem this a near-broadcast. The performance metric of interest is the expected total number of transmissions at this minimum forwarding probability, where the expectation is over both the forwarding protocol as well as the realization of the RGG. In comparison to probabilistic forwarding with no coding, our treatment of the problem indicates that, with a judicious choice of n, it is possible to reduce the expected total number of transmissions while ensuring a near-broadcast. Techniques from continuum percolation and ergodic theory are used to characterize the probabilistic broadcast algorithm.
Joint work with Navin Kashyap and D. Yogeshwaran.
Biography :
Vinay Kumar received a B.E.(Hons.) in Electrical and Electronics Engineering and an M.Sc.(Hons.) in Mathematics from the Birla Institute of Technology and Sciences, Pilani. He is currently pursuing a Ph.D. from the Department of Electrical Communication Engineering at the Indian Institute of Science, Bengaluru. He was a recipient of the CISCO Ph.D. research fellowship between 2015-20. His research interests lie in areas of random graphs, percolation theory and distributed algorithms on networks.