检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Ali Behfarnia Vahid Tabataba Vakili
机构地区:[1]不详
出 处:《International Journal of Communications, Network and System Sciences》2011年第4期219-226,共8页通讯、网络与系统学国际期刊(英文)
摘 要:IEEE 802.16 mesh mode defines routing tree for transmitting data in centralized scheduling but it does not define any explicit proposal for combining uplink and downlink subframes. Deploying combined uplink and downlink subframes on the centralized scheduling scheme can be more flexible and utilization is improved. However, existing interferences among the transmission of neighboring nodes lead to performance reduction of the network. In this paper, an efficient routing tree algorithm is proposed with combined uplink and downlink slot allocation on the centralized scheduling scheme which can abate interferences in the network. This algorithm allows more subscriber stations to transmit concurrently and so improves spatial reuse in the network. Also, the algorithm uses multi-channel and single channel systems and considers relay model, smoothing switching frequently between transmitting and receiving in successive time slots and fairness in the network. Extensive simulation results demonstrate the effectiveness of the proposed method in terms of scheduling length, link concurrency ratio, network throughput and Channel Utilization Ratio (CUR).IEEE 802.16 mesh mode defines routing tree for transmitting data in centralized scheduling but it does not define any explicit proposal for combining uplink and downlink subframes. Deploying combined uplink and downlink subframes on the centralized scheduling scheme can be more flexible and utilization is improved. However, existing interferences among the transmission of neighboring nodes lead to performance reduction of the network. In this paper, an efficient routing tree algorithm is proposed with combined uplink and downlink slot allocation on the centralized scheduling scheme which can abate interferences in the network. This algorithm allows more subscriber stations to transmit concurrently and so improves spatial reuse in the network. Also, the algorithm uses multi-channel and single channel systems and considers relay model, smoothing switching frequently between transmitting and receiving in successive time slots and fairness in the network. Extensive simulation results demonstrate the effectiveness of the proposed method in terms of scheduling length, link concurrency ratio, network throughput and Channel Utilization Ratio (CUR).
关 键 词:IEEE 802.16 Wireless Mesh Network CENTRALIZED Scheduling SLOT ALLOCATION Routing Tree
分 类 号:TN92[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28