An efficient QoS routing algorithm was proposed for multiple constrained path selection. Making use of efficient pruning policy, the algorithm reduces greatly the size of search space and the computing time. Although ...An efficient QoS routing algorithm was proposed for multiple constrained path selection. Making use of efficient pruning policy, the algorithm reduces greatly the size of search space and the computing time. Although the proposed algorithm has exponential time complexity in the worst case, it can get the running results quickly in practical application. When the scale of network increases, the algorithm can efficiently control the size of search space by constraint conditions and prior queue. The results of simulation show that successful request ratio ( r ) of efficient algorithm for multi-constrained optimal path (EAMCOP) is better than that of heuristic algorithm for multi-constrained optimal path (H-MCOP), but average computing time ( t ) of EAMCOP is far less than that of H-MCOP. And it can be seen that the computing time of EAMCOP is only one fourth of that of H-MCOP in Advanced Research Projects Agency Network (ARPANet) topology.展开更多
The routing protocols play an important role for ad hoc networks performance.As some problems with DSR,SMR,and AMR protocols were analyzed,a new routing protocol suitable for UWB Ad hoc networks was proposed in this p...The routing protocols play an important role for ad hoc networks performance.As some problems with DSR,SMR,and AMR protocols were analyzed,a new routing protocol suitable for UWB Ad hoc networks was proposed in this paper.The new routing protocol utilize an act of orientation of UWB and tries to get sufficient route information and decrease the network load caused by route discovery at the same time.Simulation results show that the routing load of the new protocol is lower and throughput is higher than that of DSR.While the node’s mobility increases,these advantages become more obvious.展开更多
A shortest path routing algorithm based on transient chaotic neural network is proposed in this paper. Gam-pared with previous models adopting Hopfield neural network, this algorithm has a higher ability to overcome t...A shortest path routing algorithm based on transient chaotic neural network is proposed in this paper. Gam-pared with previous models adopting Hopfield neural network, this algorithm has a higher ability to overcome the local minimum, and achieves a better performance. By introducing a special post-processing technique for the output matrixes, our algorithm can obtain an optimal solution with a high probability even for the paths that need more hops in large-size networks.展开更多
Routes in an ad hoc network may fail frequently because of node mobility. Stability therefore can be an important element in the design of routing protocols. The node escape probability is introduced to estimate the l...Routes in an ad hoc network may fail frequently because of node mobility. Stability therefore can be an important element in the design of routing protocols. The node escape probability is introduced to estimate the lifetime and stability of link between neighboring nodes and the escape probability based routing （EPBR） scheme to discover stable routes is proposed. Simulation results show that the EPBR can discover stable routes to reduce the number of route rediscovery, and is applicable for the situation that has highly dynamic network topology with broad area of communication.展开更多
计算能力弱、存储容量小是普通物联网节点的典型特征,复杂的部署环境和不稳定的无线链路又会导致物联网网络状态频繁变化.所以,物联网中固定的传输路径无法提供高效的感知及数据传输服务.例如典型的树型路由结构中,靠近树根的节点要提...计算能力弱、存储容量小是普通物联网节点的典型特征,复杂的部署环境和不稳定的无线链路又会导致物联网网络状态频繁变化.所以,物联网中固定的传输路径无法提供高效的感知及数据传输服务.例如典型的树型路由结构中,靠近树根的节点要提供的传输任务较重,能量消耗更快,会导致整个网络部署周期变短.本文提出了一种路径可实时定义的物联网传输模型(IoT Transmission Model with Real-time Path Definition,ITRP),物联子网中所有节点将邻接关系上报给网关设备,由性能占优的有源供电网关设备来定义网络的实时路由树.网关向物联子网节点发送报文时会携带转发标签,后续转发节点只需根据标签完成报文传输,并根据上一跳信息建立其到网关的反向传输路径.ITRP模型可围绕特定的网络服务目标(节能、传输安全、带宽保障等)收集相关网络状态信息,并周期性调整路由拓扑,实现物联网传输服务的优化.实验面向能量均衡目标展开,经过10个信息采集周期,ITRP模型相对确定性路由模型能量最低节点的能耗比为44%~86%,相对自适应多径传输模型能量最低节点的能耗比为63%~86%;而且,ITRP模型只需较小的标签代价,实验环境中报文的平均标签长度不超过5比特.展开更多
A quality of service （QoS） or constraint-based routing selection needs to find a path subject to multiple constraints through a network. The problem of finding such a path is known as the multi-constrained path （MC...A quality of service （QoS） or constraint-based routing selection needs to find a path subject to multiple constraints through a network. The problem of finding such a path is known as the multi-constrained path （MCP） problem, and has been proven to be NP-complete that cannot be exactly solved in a polynomial time. The NPC problem is converted into a multiobjective optimization problem with constraints to be solved with a genetic algorithm. Based on the Pareto optimum, a constrained routing computation method is proposed to generate a set of nondominated optimal routes with the genetic algorithm mechanism. The convergence and time complexity of the novel algorithm is analyzed. Experimental results show that multiobjective evolution is highly responsive and competent for the Pareto optimum-based route selection. When this method is applied to a MPLS and metropolitan-area network, it will be capable of optimizing the transmission performance.展开更多
The route optimization problem for road networks was applied to pedestrian flow.Evacuation path networks with nodes and arcs considering the traffic capacities of facilities were built in metro hubs,and a path impedan...The route optimization problem for road networks was applied to pedestrian flow.Evacuation path networks with nodes and arcs considering the traffic capacities of facilities were built in metro hubs,and a path impedance function for metro hubs which used the relationships among circulation speed,density and flow rate for pedestrians was defined.Then,a route optimization model which minimizes the movement time of the last evacuee was constructed to optimize evacuation performance.Solutions to the proposed mathematical model were obtained through an iterative optimization process.The route optimization model was applied to Xidan Station of Beijing Metro Line 4 based on the actual situations,and the calculation results of the model were tested using buildingExodus microscopic evacuation simulation software.The simulation result shows that the proposed model shortens the evacuation time by 16.05%,3.15% and 2.78% compared with all or none method,equally split method and Logit model,respectively.Furthermore,when the population gets larger,evacuation efficiency in the proposed model has a greater advantage.展开更多
It is a challenging problem to provide quality-of-service （QoS） guarantees in next generation high-speed network, and the QoS routing is one of the key issues of the problem. For the problem of multi-constrained QoS...It is a challenging problem to provide quality-of-service （QoS） guarantees in next generation high-speed network, and the QoS routing is one of the key issues of the problem. For the problem of multi-constrained QoS routing in high-speed network, especially under the inaccurate link state information, the success ratio of the different constraint combination is analyzed statistically, and a constraint analysis method based on the computer simulation is proposed. Furthermore, the approximately equal loose-tight order relation between each two constraints is constructed, and then an algorithm based on the experimental analysis is presented. Finally, the simulation result demonstrates that the algorithm has the higher success ratio, and the theoretical analysis proves its correctness and universality.展开更多
文摘An efficient QoS routing algorithm was proposed for multiple constrained path selection. Making use of efficient pruning policy, the algorithm reduces greatly the size of search space and the computing time. Although the proposed algorithm has exponential time complexity in the worst case, it can get the running results quickly in practical application. When the scale of network increases, the algorithm can efficiently control the size of search space by constraint conditions and prior queue. The results of simulation show that successful request ratio ( r ) of efficient algorithm for multi-constrained optimal path (EAMCOP) is better than that of heuristic algorithm for multi-constrained optimal path (H-MCOP), but average computing time ( t ) of EAMCOP is far less than that of H-MCOP. And it can be seen that the computing time of EAMCOP is only one fourth of that of H-MCOP in Advanced Research Projects Agency Network (ARPANet) topology.
基金National Nature Science Foundation of China (No. 60496311)Nature Science Foundation of Jiangsu Province (No. BK2004067&BK2005409)Foundation of Huawei Technology (No. YJCB2004018NP).
文摘The routing protocols play an important role for ad hoc networks performance.As some problems with DSR,SMR,and AMR protocols were analyzed,a new routing protocol suitable for UWB Ad hoc networks was proposed in this paper.The new routing protocol utilize an act of orientation of UWB and tries to get sufficient route information and decrease the network load caused by route discovery at the same time.Simulation results show that the routing load of the new protocol is lower and throughput is higher than that of DSR.While the node’s mobility increases,these advantages become more obvious.
文摘A shortest path routing algorithm based on transient chaotic neural network is proposed in this paper. Gam-pared with previous models adopting Hopfield neural network, this algorithm has a higher ability to overcome the local minimum, and achieves a better performance. By introducing a special post-processing technique for the output matrixes, our algorithm can obtain an optimal solution with a high probability even for the paths that need more hops in large-size networks.
基金This project was supported by Pre-research Plan of Chinese National Defence (102010203), and Shanxi ProvincialScience and Technology Development Plan (2000K08-G12).
文摘Routes in an ad hoc network may fail frequently because of node mobility. Stability therefore can be an important element in the design of routing protocols. The node escape probability is introduced to estimate the lifetime and stability of link between neighboring nodes and the escape probability based routing （EPBR） scheme to discover stable routes is proposed. Simulation results show that the EPBR can discover stable routes to reduce the number of route rediscovery, and is applicable for the situation that has highly dynamic network topology with broad area of communication.
文摘计算能力弱、存储容量小是普通物联网节点的典型特征,复杂的部署环境和不稳定的无线链路又会导致物联网网络状态频繁变化.所以,物联网中固定的传输路径无法提供高效的感知及数据传输服务.例如典型的树型路由结构中,靠近树根的节点要提供的传输任务较重,能量消耗更快,会导致整个网络部署周期变短.本文提出了一种路径可实时定义的物联网传输模型(IoT Transmission Model with Real-time Path Definition,ITRP),物联子网中所有节点将邻接关系上报给网关设备,由性能占优的有源供电网关设备来定义网络的实时路由树.网关向物联子网节点发送报文时会携带转发标签,后续转发节点只需根据标签完成报文传输,并根据上一跳信息建立其到网关的反向传输路径.ITRP模型可围绕特定的网络服务目标(节能、传输安全、带宽保障等)收集相关网络状态信息,并周期性调整路由拓扑,实现物联网传输服务的优化.实验面向能量均衡目标展开,经过10个信息采集周期,ITRP模型相对确定性路由模型能量最低节点的能耗比为44%~86%,相对自适应多径传输模型能量最低节点的能耗比为63%~86%;而且,ITRP模型只需较小的标签代价,实验环境中报文的平均标签长度不超过5比特.
基金the Natural Science Foundation of Anhui Province of China (050420212)the Excellent Youth Science and Technology Foundation of Anhui Province of China (04042069).
文摘A quality of service （QoS） or constraint-based routing selection needs to find a path subject to multiple constraints through a network. The problem of finding such a path is known as the multi-constrained path （MCP） problem, and has been proven to be NP-complete that cannot be exactly solved in a polynomial time. The NPC problem is converted into a multiobjective optimization problem with constraints to be solved with a genetic algorithm. Based on the Pareto optimum, a constrained routing computation method is proposed to generate a set of nondominated optimal routes with the genetic algorithm mechanism. The convergence and time complexity of the novel algorithm is analyzed. Experimental results show that multiobjective evolution is highly responsive and competent for the Pareto optimum-based route selection. When this method is applied to a MPLS and metropolitan-area network, it will be capable of optimizing the transmission performance.
基金Project(51078086)supported by the National Natural Science Foundation of China
文摘The route optimization problem for road networks was applied to pedestrian flow.Evacuation path networks with nodes and arcs considering the traffic capacities of facilities were built in metro hubs,and a path impedance function for metro hubs which used the relationships among circulation speed,density and flow rate for pedestrians was defined.Then,a route optimization model which minimizes the movement time of the last evacuee was constructed to optimize evacuation performance.Solutions to the proposed mathematical model were obtained through an iterative optimization process.The route optimization model was applied to Xidan Station of Beijing Metro Line 4 based on the actual situations,and the calculation results of the model were tested using buildingExodus microscopic evacuation simulation software.The simulation result shows that the proposed model shortens the evacuation time by 16.05%,3.15% and 2.78% compared with all or none method,equally split method and Logit model,respectively.Furthermore,when the population gets larger,evacuation efficiency in the proposed model has a greater advantage.
文摘It is a challenging problem to provide quality-of-service （QoS） guarantees in next generation high-speed network, and the QoS routing is one of the key issues of the problem. For the problem of multi-constrained QoS routing in high-speed network, especially under the inaccurate link state information, the success ratio of the different constraint combination is analyzed statistically, and a constraint analysis method based on the computer simulation is proposed. Furthermore, the approximately equal loose-tight order relation between each two constraints is constructed, and then an algorithm based on the experimental analysis is presented. Finally, the simulation result demonstrates that the algorithm has the higher success ratio, and the theoretical analysis proves its correctness and universality.
