We present three localized techniques for broadcasting in large scale ad hoc networks, i.e., for the problem of disseminating a message from a source node to all the nodes in the networks. Aim of the proposed techniques is to define broadcasting mechanisms that are simple, thus generating low overhead, energy efficient, for deployment in resourceconstrained networks, and reliable, in that all the nodes receive the intended message with high probability. The three techniques follow two different approaches for data dissemination. The first approach relies on the idea of identifying local rules for the sparsification of the network topologies. The resulting virtual topology is the actual structure through which broadcast is performed. While sparsification techniques have been proposed before, our solution makes no use of location information. The second approach follows the line of on-line algorithms for the implementation of probabilistic flooding. In this case, the proposed algo...