Efficient Gathering in Radio Grids with Interference†
چکیده
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 dT 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 dI or less from the receiver of the second transmission. In this paper we study the case dT = 1 and dI > 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 dI and near-optimal for even dI .