检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]武汉理工大学计算机科学与技术学院,武汉430063 [2]湖北师范学院计算机科学系,黄石435002
出 处:《武汉理工大学学报(交通科学与工程版)》2005年第4期499-502,共4页Journal of Wuhan University of Technology(Transportation Science & Engineering)
基 金:国家自然科学基金重大研究计划项目(批准号:90304018);湖北省自然科学基金项目(批准号:2004ABA023);湖北师范学院重点科研项目(批准号:2004Y08)
摘 要:由于移动AdHoc网络的特殊性,带宽、延时以及节点的剩余能量才是反映其本质特性的重要参量,文中以可用带宽作为第一度量,同时考虑节点剩余能量、延时和延时抖动等因素,提出了基于最大可用带宽的多QoS约束的多播路由算法MRQW,给出了算法的实现过程和步骤,进行了算法的正确性证明和复杂性分析.仿真结果表明,该算法在带宽和路由成功率等方面均具有较好特性.Multicast routing is the process for establishing a tree which is rooted from the source node and contains all the multicast destinations. A multicast routing tree with multiple QoS constraints is such one in which the delay, delay jitter and bandwidth should satisfy the pre-specified bounds. With the rapidly expanding applications of Ad Hoc networks, QoS multicast routing with multiple QoS constraints in Ad Hoc networks has become a very important research issue in the areas of networks and distributed systems. Because the particularity of Ad Hoc networks, bandwidth,delay and the surplus energy of node is an important parameter that reflects its essence characteristic. This paper presents a multicast routing algorithm of multiple QoS constraints based on widest-bandwidth (MRQW) which takes available bandwidth as the prime metric. Moreover, the constraints of the surplus energy of node,delay and delay jitter are considered as well. The process of routing based on MRQW is provided. The proof of correctness and the complexity analysis of the MRQW are also given in the paper.Simulation results show that the MRQW is the satisfied bandwidth performance and dependable rate of successful routing.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.145.184.109