摘要
在参考文献〔1〕的基础上 ,对其提出的资源预留方案和带宽整理算法加以改进 .本文认为 ,移动台的移动有其目的性 ,因此能根据其当前的位置和速度判断其将切换至的目标小区 ,并只在该小区中进行资源预留 ,由此提高资源利用率、降低呼损 .本文还计算出了移动台的新呼叫能被成功接纳并正常结束的概率 .文献〔1〕的带宽整理算法在呼叫发起时进行 ,且时间复杂度太高 ,本文将其改在呼叫结束时进行 ,且根据实时通信的特点 ,提出改进方案 。
Based on 〔1〕 ,this paper improves the resource reservation scheme and bandwidth compaction algorithm.The paper holds that the mobile station has its destination during moving,so the destination cell can be estimated by its current location and velocity.If we reserve resource for it only in the destination cell,then we can make use of the resource efficiently and reduce the loss of the call.The paper also presents the probability that a new call can be admited and be completed.In 〔1〕 ,the bandwidth compaction is executed when a new call arrives and its time complexity is too high.The paper alters it to be executed at the end of the call,and puts forward an improved scheme based on the characteristic of the real time communication,which greatly reduces the time complexity.
出处
《小型微型计算机系统》
CSCD
北大核心
2003年第8期1437-1440,共4页
Journal of Chinese Computer Systems
关键词
资源预留
位置估计
速度估计
带宽整理
resource reservation
location estimate
velocity estimate
bandwidth compaction