通过对实际Ad hoc网络中节点通信情况的研究,考虑到网络中节点的自私性以及单纯使用最小跳数选路方法的缺陷,综合考虑名声、可用带宽和最小跳数,该文提出了一种新的参数量度。基于这个量度,借鉴TOPP(Trains Of Packet Pairs)测量可用带...通过对实际Ad hoc网络中节点通信情况的研究,考虑到网络中节点的自私性以及单纯使用最小跳数选路方法的缺陷,综合考虑名声、可用带宽和最小跳数,该文提出了一种新的参数量度。基于这个量度,借鉴TOPP(Trains Of Packet Pairs)测量可用带宽的思想,设计了一种快速测量逐跳可用带宽的方法,并通过MAC层和网络层的跨层设计,提出了一个基于以上混合量度的路由协议(Ad hoc Routing Based on Fame,Available Bandwidth and Minimum Hops,ARBFAM)。通过使用该协议在不同场景的网络环境中仿真证明,该路由协议在节点公平性,网络的拥塞控制和负载均衡,网络的平均寿命,网络的端到端吞吐量,平均端到端延迟方面较DSR都有较大的改善。展开更多
Vehicular ad-hoc networks （VANETs） are a significant field in the intelligent transportation system （ITS） for improving road security. The interaction among the vehicles is enclosed under VANETs. Many experiments ...Vehicular ad-hoc networks （VANETs） are a significant field in the intelligent transportation system （ITS） for improving road security. The interaction among the vehicles is enclosed under VANETs. Many experiments have been performed in the region of VANET improvement. A familiar challenge that occurs is obtaining various constrained quality of service （QoS） metrics. For resolving this issue, this study obtains a cost design for the vehicle routing issue by focusing on the QoS metrics such as collision, travel cost, awareness, and congestion. The awareness of QoS is fuzzified into a price design that comprises the entire cost of routing. As the genetic algorithm （GA） endures from the most significant challenges such as complexity, unassisted issues in mutation, detecting slow convergence, global maxima, multifaceted features under genetic coding, and better fitting, the currently established lion algorithm （LA） is employed. The computation is analyzed by deploying three well-known studies such as cost analysis, convergence analysis, and complexity investigations. A numerical analysis with quantitative outcome has also been studied based on the obtained correlation analysis among various cost functions. It is found that LA performs better than GA with a reduction in complexity and routing cost.展开更多
A model is proposed to describe the passengers’route choice behaviors in urban railway traffic with stochastic link capacity degradation by considering two types of demand,sensitive and insensitive passenger.The inse...A model is proposed to describe the passengers’route choice behaviors in urban railway traffic with stochastic link capacity degradation by considering two types of demand,sensitive and insensitive passenger.The insensitive passengers choose their route without paying much attention to congestion.To the contrary,sensitive passengers who consider route congestion choose travel route based on generalized cost.An equilibrium state is given by variational inequalities in terms of travel generalized cost,which is represented by the combinations of mean and variance of total travel time.The diagonalization algorithm is given to solve this programming.Results show that insensitive passengers have large effects on the path choice than sensitive ones,especially for the larger demand.展开更多
文摘通过对实际Ad hoc网络中节点通信情况的研究,考虑到网络中节点的自私性以及单纯使用最小跳数选路方法的缺陷,综合考虑名声、可用带宽和最小跳数,该文提出了一种新的参数量度。基于这个量度,借鉴TOPP(Trains Of Packet Pairs)测量可用带宽的思想,设计了一种快速测量逐跳可用带宽的方法,并通过MAC层和网络层的跨层设计,提出了一个基于以上混合量度的路由协议(Ad hoc Routing Based on Fame,Available Bandwidth and Minimum Hops,ARBFAM)。通过使用该协议在不同场景的网络环境中仿真证明,该路由协议在节点公平性,网络的拥塞控制和负载均衡,网络的平均寿命,网络的端到端吞吐量,平均端到端延迟方面较DSR都有较大的改善。
文摘Vehicular ad-hoc networks （VANETs） are a significant field in the intelligent transportation system （ITS） for improving road security. The interaction among the vehicles is enclosed under VANETs. Many experiments have been performed in the region of VANET improvement. A familiar challenge that occurs is obtaining various constrained quality of service （QoS） metrics. For resolving this issue, this study obtains a cost design for the vehicle routing issue by focusing on the QoS metrics such as collision, travel cost, awareness, and congestion. The awareness of QoS is fuzzified into a price design that comprises the entire cost of routing. As the genetic algorithm （GA） endures from the most significant challenges such as complexity, unassisted issues in mutation, detecting slow convergence, global maxima, multifaceted features under genetic coding, and better fitting, the currently established lion algorithm （LA） is employed. The computation is analyzed by deploying three well-known studies such as cost analysis, convergence analysis, and complexity investigations. A numerical analysis with quantitative outcome has also been studied based on the obtained correlation analysis among various cost functions. It is found that LA performs better than GA with a reduction in complexity and routing cost.
基金Project(71525002) supported by China National Funds for Distinguished Young ScientistsProjects(71271023,71210001) supported by the National Natural Science Foundation of ChinaProject(RCS2015ZZ003) supported by the Research Foundation of State Key Laboratory of Rail Traffic Control and Safety,Beijing Jiaotong University,China
文摘A model is proposed to describe the passengers’route choice behaviors in urban railway traffic with stochastic link capacity degradation by considering two types of demand,sensitive and insensitive passenger.The insensitive passengers choose their route without paying much attention to congestion.To the contrary,sensitive passengers who consider route congestion choose travel route based on generalized cost.An equilibrium state is given by variational inequalities in terms of travel generalized cost,which is represented by the combinations of mean and variance of total travel time.The diagonalization algorithm is given to solve this programming.Results show that insensitive passengers have large effects on the path choice than sensitive ones,especially for the larger demand.
