作者: Anders Dessmark , Andrzej Pelc
关键词:
摘要: We consider the problem of distributed deterministic broadcasting in radio networks. The network is synchronous. A node receives a message given round if and only exactly one its neighbors transmits. source has to reach all nodes. assume that nodes do not know topology or even their immediate neighborhood. are concerned with two efficiency measures algorithms: execution time (number rounds), cost transmissions). focus our study on algorithms which have close minimum. We scenarios depending whether global parameters network: number n eccentricity D source. Our main contribution lower bounds low-cost show sharp differences between these scenarios.