In this paper we study the broadcast problem in wireless networks when the broadcast is helped by a labelling scheme. We focus on two variants of broadcast: broadcast without acknowledgement (i.e. the initiator of the broadcast is not notified at the end of broadcast) and broadcast with acknowledgement. Our contribution is twofold. First, we propose label optimal broadcast algorithms in a class of networks issued from recent studies in Wireless Body Area Networks then we extend our solutions to arbitrary networks. We propose an acknowledgement-free broadcast strategy using 1-bit labels and broadcast with acknowledgement using 2-bits labels. In the class of level-separable networks our algorithms finish within 2D rounds for both broadcast with and without acknowledgement, where D is the eccentricity of the broadcast initiator. Second, we improve a recent [11] labelling-based broadcast scheme with acknowledgement designed for arbitrary networks in terms of memory complexity.