TY - GEN
T1 - The sound of silence
T2 - 18th Annual Joint Conference of the IEEE Computer and Communications Societies: The Future is Now, IEEE INFOCOM'99
AU - Dolev, Shlomi
AU - Korach, Ephraim
AU - Yukelson, Dmitry
PY - 1999/12/1
Y1 - 1999/12/1
N2 - 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. Our third algorithm uses a different approach, approach that is based on the Lempel-Ziv 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.
AB - 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. Our third algorithm uses a different approach, approach that is based on the Lempel-Ziv 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.
UR - http://www.scopus.com/inward/record.url?scp=0032647452&partnerID=8YFLogxK
U2 - 10.1109/INFCOM.1999.751464
DO - 10.1109/INFCOM.1999.751464
M3 - Conference contribution
AN - SCOPUS:0032647452
SN - 0780354176
SN - 9780780354173
T3 - Proceedings - IEEE INFOCOM
SP - 768
EP - 775
BT - Proceedings - IEEE INFOCOM'99
Y2 - 21 March 1991 through 25 March 1991
ER -