摘要: We consider broadcasting in radio networks that are subject to permanent node failures of unknown location. Nodes spread a region some regular way. two cases: nodes either situated at integer points line or they on the plane, grid square hexagonal mesh. send messages synchronous time slots. Each v has given transmission range same radius R. All located within this can receive from v. However, more simultaneously, cannot these and hears only noise. Faulty do not any messages. give algorithms whose worst-case running optimal order magnitude, we prove corresponding lower bounds. In case nonadaptive magnitude is θ(D + t), for adaptive it Θ(D log(min(R, t))), where t an upper bound number faults network D diameter fault-free part be reached source as result those faults.