摘要
针对目前无线Mesh网络尚未解决多网关接入时最小链路调度时间下限估计的问题,提出一种计算该时间下限的方法,其本质是基于资源分配的Pareto优化计算过程.采用拉格朗日方法进行求解,并通过Lyapunov函数找出基于最优速率的多网关接入的最小链路调度时间.该方法不仅能准确地计算出最小链路调度时间下限,并用于评估网络性能,还能优化无线Mesh网络上行链路调度速率,提高链路的吞吐量.
Aiming at the unresolved problem of estimating the minimum link scheduling time lower limit in wireless Mesh networks when taking multi-gateway accessary, a new calculation approach of its time lower limit is put forward . The method essentially involves a Pareto optimizing problem based on resource allocation. The Lagrangian algorithm, via Lyapunov function, is taken to solve the problem. The minimum link scheduling time lower limit based on optimized rate of muhi-gateway accessing can be figured out. The foregoing method can not only calculate the lower limit of the minimum link scheduling time more accurately, which is used to evaluate the network performance, but also can reach the goal to optimize the upstream link scheduling rate in wireless mesh networks and to improve the link throughput.
出处
《北京邮电大学学报》
EI
CAS
CSCD
北大核心
2011年第2期50-53,80,共5页
Journal of Beijing University of Posts and Telecommunications
基金
重庆市科委重大专项项目(CSTC2009AB2167)
中央高校基本科研业务费专项项目(XDJXS11161157)
关键词
无线MESH网络
多网关
链路调度
链路成本
资源优化
wireless Mesh networks
multi-gateway
link scheduling
link cost
resource optimization