检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:刘圣海[1,2] 冯穗力[1] 叶梧[1] 庄宏成[3]
机构地区:[1]华南理工大学电子与信息学院,广东广州510640 [2]广东工业大学信息工程学院,广东广州510006 [3]华为技术有限公司,广东深圳518129
出 处:《电路与系统学报》2009年第1期42-48,共7页Journal of Circuits and Systems
基 金:2006年粤港关键领域重大基金资助项目(20060104-2)
摘 要:在基于IEEE 802.16的无线Mesh网络中,时隙分配算法对网络性能有重要影响。针对现有时隙分配算法只研究上行链路且时隙分配的结果导致中继节点在转发数据时频繁在相邻时隙间进行收发切换的问题,提出了一种上下行链路通用的时隙分配方法,对于上行链路,跳数较小节点的数据优先传输,而对于下行链路,跳数较大节点的数据优先传输,在传输路径上采用逐跳传输的策略。仿真结果证明了该算法的有效性。In the IEEE 802.16 based wireless mesh networks, the network performance is influenced deeply by the slot allocation algorithm. The existing algorithm focuses mainly on the uplinks and its allocation result leads to the relay node switchwing frequently between transmission and reception within adjacent time slot when forwarding traffic. To resolve those problems, a uniform slot allocation algorithm is proposed for both uplinks and downlinks. For uplinks, the traffic of the node with smallest hop count is transferred first, and for downlinks, the traffic of the node with largest hop count is transferred first, and the hop-by-hop criteria is taken on the transmission route. The simulation results show the efficiency of the proposed algorithm.
关 键 词:IEEE 802.16 无线MESH网络 集中调度 时隙分配
分 类 号:TN915.65[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.117.189.91