Energy saving is the most important issue in wireless mobile computing due to power constraints on mobile units. Data broadcasting is the main method of information dissemination in wireless networks as its cost is independent of the number of mobile hosts receiving the information. A number of data broadcasting techniques have been proposed for mobile wireless networks, where servers have no energy restrictions, but little research has been done to address the issue of data broadcasting in mobile ad-hoc networks where both servers and clients are nomadic. In this paper, we propose two groups of broadcast scheduling algorithms called adaptive broadcasting and popularity based adaptive broadcasting that consider time constraints on requests as well as energy limitation on both servers and clients. We also present the simulation experiments that compare the algorithms.