The sound of silence: guessing games for saving energy in mobile environment

This paper explores efficient discrete coding techniques that are motivated by the time/energy tradeoff in message transmission between mobile hosts and mobile support stations. Three algorithms are suggested two of which use guessing games in which the mobile support station guesses the message to be transmitted by the mobile host and receives approving signal for successful guess from the mobile host. The first algorithm is designed to achieve the smallest expected amount of energy while obeying a time bound for message transmissions. The second algorithm achieves the shortest expected transmission time while obeying a bound on the energy. This algorithm uses dynamic programming to construct an optimal tree for the guessing game. The third algorithm uses a different approach, approach that is based on the Lempel-Ziv (1978) compression algorithm. The time energy tradeoff is controlled by the choice of the length of the codes used to encode strings in the dictionary. The theoretical results obtained are not tied to mobile computing and are of independent interest