It is difficult to compare various mobility management schemes since as yet there exist no absolute bounds on optimum performance which can be applied to any procedure regardless of assumptions about mobility, network structure, and the like. It would be useful to fill this gap by developing some general theory, which optimally would precisely relate quantities of interest such as minimum average effort/delay in determining unit locations and minimum average location information dissemination rate over the network in fundamental terms. We therefore note that in order to quantitatively evaluate the average cost of any mobility management scheme, timevarying probability distributions on mobile unit location are required. These distributions might be derived from specific motion models, approximated via empirical data [18, 33], or