Skip to Main Content
Packet switching broadcast radio networks are receiving considerable attention as a feasible solution for applications involving fast network deployment requirements, inaccessible physical environments, and mobile communication devices. Such networks also offer economic alternatives to traditional multiplexing schemes for local distribution. Routing algorithms which enable point-to-point packet transportation have been developed for broadcast radio networks. It appears that a routing algorithm becomes more efficient when the number of alternate paths are restricted; on the other hand, reliability considerations suggest increasing the number of alternate paths. In this paper, we study and compare the reliability of broadcast radio networks for different routing algorithms.