With the goal of providing "timely and reliable" access to information in a mobile computing environment, mobile units and the wireless medium operate under constraints on energy, bandwidth, and connectivity. Among these limitations, power limitation of mobile units is one of the key issues.

In a mobile computing environment, broadcasting has proved to be an effective method to distribute public data. Efficient methods for allocating and retrieving objects on parallel indexed broadcast channels have been proposed to manage power consumption and access latency. Employment of parallel channels also brings out the notion of conflicts. To minimize the effect of conflicts on both access latency and power consumption, one has to develop schemes to schedule access to the objects that minimizes the number of passes over the parallel channels.

This work extends our past efforts and proposes two new scheduling algorithms that can find the minimum number of passes and inside channel switches. The simulation results show that the proposed scheduling algorithms relative to our previous work have a great impact on energy consumption and access latency. The proposed scheduling algorithms are simulated and results are presented.