Odd networks were introduced in the context of graph theory. However, their potential as fault-tolerant multiprocessor networks has been shown. Broadcasting is one of the most important communication primitives used in multiprocessor networks. In this letter, we introduce efficient one-to-all broadcasting schemes of odd networks for one-port and all-port models. We show the broadcasting time of the former is 2d-2 and that of the latter is d-1. The total time steps taken by the proposed algorithms are optimal.