Communication Networks and Services Research, Annual Conference on (2005)
Halifax, N.S., Canada
May 16, 2005 to May 18, 2005
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CNSR.2005.6
Z. Liu , University of Moncton
J. Almhana , University of Moncton
V. Choulakian , University of Moncton
R. McGorman , Nortel Networks
In this paper we study packet transmission strategies for data service over wireless networks. We assume the wireless channel is in either a good or a bad state and that transferring a packet under a good channel state consumes less power than under a bad channel state. Under the Markov channel assumption, it is proved that the optimal strategy is of threshold structure: Corresponding to each channel state there exists a positive threshold on queue length; once the queue length exceeds the threshold, the network should transmit packets over its capacity; otherwise there should be no transmission. A single sample path-based optimization algorithm is proposed to tune the thresholds. Since only a single sample path is involved, the proposed algorithm can be implemented online.
Wireless data network, power saving, Markov channel, online optimization
R. McGorman, J. Almhana, Z. Liu and V. Choulakian, "A Dynamical Data Transmission Policy for Wireless Networks," Communication Networks and Services Research, Annual Conference on(CNSR), Halifax, N.S., Canada, 2005, pp. 125-130.