欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
一些安排算法被设计了最近改进无线网孔联网的多跳跃(WMN ) 的表演。然而，端对端的延期很少被看作多跳跃拓扑学和开的无线分享的隧道的复杂性。这篇文章建议有效延期基于与 buffer-data-hops 的概念安排算法。就需求满足因素(DSF ) 而言，建议算法能也完成好公平表演。而且与基于干扰的网络模型一起，安排算法能最大化空间复用，与那些基于图的安排算法相比。详细理论分析证明算法能最小化端对端的延期并且做安排到所有连接的一个交易会。
英文摘要：
Some scheduling algorithms have been designed to improve the performance of multi-hop wireless mesh networks （WMNs） recently. However the end-to-end delay is seldom considered as the complexity of multi-hop topology and open wireless shared channel. This article proposes an efficient delay based scheduling algorithm with the concept of buffer-data- hops. Considering the demand satisfaction factor（DSF）, the proposed algorithm can also achieve a good fairness performance. Moreover, with the interference-based network model, the scheduling algorithm can maximize the spatial reuse, compared to those graph-based scheduling algorithms. Detailed theoretical analysis shows that the algorithm can minimize the end-to-end delay and make a fair scheduling to all the links.
同期刊论文项目
同项目期刊论文
Heterogeneous Cooperative Relay Selection with Maximal-Ratio Combining for Multi-Radio Access Networ
Investigation of Capacity and Call Admission Control in TD-SCDMA Uplink Systems Employing Multi-user
Doppler Spread Estimation by Tracking the Delay-Subspace for OFDM Systems in Doubly Selective Fading
Performance analysis of multiuser diversity in cooperative multi-relay networks under Rayleigh fadin
Cross-layer design for tree-type routing and level-based centralised scheduling in IEEE 802.16 based
A utility-based capacity optimization framework for achieving cooperative diversity in the hierarchi
期刊信息
位置：