Broadcasting, one of the fundamental operations of the wireless ad-hoc networks, can be implemented using two approaches i.e static and dynamic. In broadcasting a node disseminates a message to all other nodes within the network. Usually in static approach the forwarding or non-forwarding status of the node is determined by a globally known priority function and local topology information. The static approach can achieve a constant approximation factor to optimal solution only if position information is available which is not possible in all cases. This paper shows that constant approximation to optimal solution can be obtained using connectivity information only. The status of each node is determined ‘on-the-fly’ i.e while the broadcasting process is being done. This local broadcast algorithm can achieve both full delivery and constant approximation to the optimal solution. The security issues can be solved by comparing the expected and perceived packet delivery ratios.