Efficient Gathering in Radio Grids with Interference
Résumé
We study the problem of gathering information from the nodes of a radio network into a central destination node. A transmission can be received by a node if it is sent from a distance of at most d T and there is no interference from other transmissions. One transmission interferes with the reception of another transmission if the sender of the first transmission is at distance d I or less from the receiver of the second transmission. In this paper we study the case d T = 1 and d I > 1 for two-dimensional grid networks with unit time transmissions. We prove lower bounds on the number of rounds required for any two-dimensional grid and we describe protocols for n × n grids with n odd that are optimal for odd d I and near-optimal for even d I .
Origine : Fichiers produits par l'(les) auteur(s)