June 8, 2017, 12:15 p.m.

Title: Ad-hoc Affectance-selective Families for Layer Dissemination

Authors: Dariusz Kowalski, Harshita Kudaravalli, Miguel Mosteiro

Speaker: Miguel Mosteiro

Abstract: Information dissemination protocols for ad-hoc wireless networks frequently use a minimal subset of the available communication links, defining a rooted broadcast tree. In this talk, I will present our work focusing on the core challenge of disseminating from one layer to the next one of such tree. That is, dissemination in
bipartite networks. We call this problem Layer Dissemination. We have studied Layer Dissemination under a generalized model of interference, called affectance. The affectance model subsumes previous models, such as Radio Network and Signal to Inteference-plus-Noise Ratio. I will present randomized and deterministic protocols for Layer Dissemination. These protocols are based on a combinatorial object that we call Affectance-selective Families. Our approach combines an engineering solution with theoretical guarantees. That is, we provide a method to characterize the network with a global measure of affectance based on measurements of interference in the specific deployment area. Using those measurements as input, our protocols distributedly produce an ad-hoc transmissions schedule for dissemination. In the randomized protocol only the network characterization is needed, whereas the deterministic protocol requires full knowledge of affectance. Our theoretical analysis provides guarantees on schedule length. We have also carried simulations of a real network-deployment area contrasting the performance of our randomized protocol, which takes into account affectance, against previous work for other interference models. The simulations show an exponential improvement due to the more physically-accurate model that takes into account other effects beyond distance to transmitters.