Date Added: Mar 2010
With the objective to minimize the transmission energy cost, the authors consider the energy-efficient scheduling problem in a single hop multi-access data gathering network. They first prove by theoretical induction that transmitting with reduced powers decreases the energy budget in a multi-access transmission. Given the optimal transmit powers, they then examine the multi-access capacity polymatroid and argue that the optimal rate control can be achieved by controlling the successive decoding order of the transmitting sensor nodes. Consequently, the multi-access scheduling problem is reformulated into the job scheduling problems and solved by adapting job scheduling policies. They also address the implementation issues and demonstrate via simulations that the proposed strategies are efficient in energy conservation.