Bayes Rule for MAC State Sojourn Time Supporting Packet Data Service in CDMA Wireless Cellular Networks

Cheon Won CHOI
Ho-Kyoung LEE

Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E86-A    No.6    pp.1421-1429
Publication Date: 2003/06/01
Online ISSN: 
DOI: 
Print ISSN: 0916-8508
Type of Manuscript: Special Section PAPER (Special Section on Papers Selected from 2002 International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC 2002))
Category: 
Keyword: 
connection state,  sojourn time,  posterior expected loss,  Bayes rule,  queueing system,  

Full Text: PDF(693.5KB)>>
Buy this Article



Summary: 
In provisioning packet data service on wireless cellular networks, a scheme of altering connection status between mobile and base stations appeared with an effort to utilize resource during idle periods. A critical issue in such scheme of sojourn and transition on the connection states is to determine a maximum time to sojourn at each state. An excessive sojourn time leads to resource invasion by inactive stations, while a high cost of re-establishing connection components is imposed by an insufficient sojourn. Thus, the maximum sojourn times must be optimized in consideration of the two conflicting arguments. In this paper, we consider a generic scheme of connection status transitions and formulate a decision problem to determine maximum sojourn times by introducing a loss function which reflects the cost of connection re-establishment as well as the loss induced by inefficient resource usage. From the decision problem, we derive an optimal value for maximum sojourn time, identified as Bayes rule, by observing the delay time of last packet to have posterior information about the length of upcoming idle period. From the analytical results, we show the Bayes sojourn time is trivial under a constraint on loss coefficients when packet arrivals follow a Poisson process.


open access publishing via