基于4G辅助的车载网地理路由算法

针对车载网(VANETs)城市场景的路由问题,提出基于4G网络的长期演进(LTE)和VANETs混合结构的地理路由LTE-GR。LTE-GR路由充分利用LTE高峰速率和低时延特性,辅助VANETs间的数据传输。基站e Node B收集路段信息,计算路段稳定值,并与门限值进行比较,若小于门限值,则利用e Node B转发数据包;否则,就引用贪婪转发地理路由传输数据包。仿真结果表明,相比于同类路由,提出的LTE-GR路由能有效地提高数据包传输率、端到端传输时延性能。     

求解动态最优路径的混合优化算法

对动态网络环境下动态需求的最优路径搜索问题进行了研究,首次提出了一个能同时利用演化算法的全局优化能力和蚁群算法的局部探索能力的混合智能优化算法Evo-Ant,并将其应用于DVRP.为了验证算法的有效性,给出了DVRP的混合整数规划模型,建立了DVRP的动态性能测试类,并进行了大量的仿真实验和比较.结果表明,Evo-Ant算法能够根据实时接收到的信息对当前规划路径进行及时调整,具有明显改善的性能优势.     

基于殖民地位置信息的自适应帝国主义竞争算法

在元启发式算法中,问题优化的质量取决于算法参数的精准设定,而参数的设定通常没有一个确定的标准,重复实验又耗时耗力。偏离角度是帝国主义竞争算法(ICA)中的一个重要参数,盲目选取可能会导致算法陷入局部最优解,出现早熟收敛现象。为了克服该缺陷,提出一种基于殖民地位置信息概率密度函数的自适应帝国主义竞争算法。在帝国主义者同化殖民地过程中,根据殖民地密度函数动态地调整其向帝国主义者运动的偏离角度,提高殖民地脱离局部最优解探寻全局最优解的能力。另一方面,帝国主义者通过及时掠取殖民地位置中的有用信息降低自己的成本函数,延伸了原算法中殖民地与帝国主义者位置互换的步骤,加快了算法的收敛速度。在一系列的基准函数测试中,所提算法在收敛速度和优化性能上均优于原ICA和另外几种经典的遗传算法。     

AN ALGORITHM FOR VLSI CHANNEL ROUTING USING NEURAL NETWORK

The algorithm for VLSI channel routing using Hopfield neural model is discussed inthis paper.The basic methods of mapping VLSI channel routing problem to Hopfield neural net-work,constructing energy function,setting initial neural status,and selecting various parametersare proposed.Finally,some experimental results are given.     

Induction machine fault detection using SOM-based RBF neural networks

A radial-basis-function (RBF) neural-network-based fault detection system is developed for performing induction machine fault detection and analysis. Four feature vectors are extracted from power spectra of machine vibration signals. The extracted features are inputs of an RBF-type neural network for fault identification and classification. The optimal network architecture of the RBF network is determined automatically by our proposed cell-splitting grid algorithm. This facilitates the conventional laborious trial-and-error procedure in establishing an optimal architecture. In this paper, the proposed RBF machine fault diagnostic system has been intensively tested with unbalanced electrical faults and mechanical faults operating at different rotating speeds. The proposed system is not only able to detect electrical and mechanical faults, but the system is also able to estimate the extent of faults.     

一种新的基于混沌神经网络的动态路由选择算法

针对通信网的路由选择问题,提出了一种动态路由选择的混沌神经网络实现方法。所提出的此方法具有许多优良特性,即暂态混沌特性和平稳收敛特性,能有效地避免传统Hopfield神经网络极易陷入局部极值的缺陷。它通过短暂的倒分叉过程,能很快进入稳定收敛状态。实验证明了本算法能实时、有效地实现通信网的路由选择,并且当通信网中的业务量发生变化时,算法能自动调整最短路径和负载平衡之间的关系。     

Shortest path routing algorithm using Hopfield neural network

A near-optimal routing algorithm employing a modified Hopfield neural network (HNN) is presented. Since it uses every piece of information that is available at the peripheral neurons, in addition to the highly correlated information that is available at the local neuron, faster convergence and better route optimality is achieved than with existing algorithms that employ the HNN. Furthermore, all the results are relatively independent of network topology for almost all source-destination pairs     

Phase transmittance RBF neural networks

Presented is a new complex valued radial basis function (RBF) neural network with phase transmittance between the input nodes and output, which makes it suitable for channel equalisation on quadrature digital modulation systems.     

Stable routing algorithm for mobile ad hoc networks using mobile agent

Wireless ad hoc networks are growing important because of their mobility, versatility, and ability to work with fewer infrastructures. The mobile ad hoc network is an autonomous system consisting of mobile nodes connected with wireless links. Establishing a path between two nodes is a complex task in wireless networks. It is still more complex in the wireless mobile ad hoc network because every node is no longer as an end node and an intermediate node. In this paper, it focuses on design of connectionless routing protocol for the wireless ad hoc networks based on the mobile agent concept. The proposed model tries to discover the best path taking into consideration some concerns like bandwidth, reliability, and congestion of the link. The proposed model has been simulated and tested under various wireless ad hoc network environments with the help of a different number of nodes. The results demonstrate that the proposed model is more feasible for providing reliable paths between the source and destination with the minimum control message packets over the network. It has delivered more number of packets to the destination over the network. Copyright © 2012 John Wiley & Sons, Ltd.     

An intelligent hybrid prairie dog optimization algorithm-based stable cluster reliable routing scheme for VANETs

Vehicular ad hoc network (VANET) is most significant for supporting intelligent transportation system (ITS)-based technologies, but it gets hurdled by sparse distribution of vehicles on highways, and dynamically challenging topology that arises due to increase in traffic. Hence, energy stable and optimized cluster construction maximizes the network lifetime. In this paper, Hybrid Prairie Dogs and Beluga Whale Optimization-based Node Clustering (HPDBWOA-NC) mechanism is proposed with the parameters of highway route, node velocity, number of vehicular nodes, and communication for achieving stable cluster construction in VANETs. It is proposed with the balanced exploration and exploitation potential of Prairie Dog Optimization Algorithm (PDOA) and Beluga Whale Optimization Algorithm (BWOA) for establishing optimal clusters that increase the network stability during the routing process. It integrated the exploration and exploitation capabilities of PDOA and BWOA and confirmed better optimized clusters which confirmed reliable data delivery by preventing the issue of premature convergence. It constructed clusters and selected cluster heads (CHs) depending on the fitness factors of energy, interdistance between vehicles, communication range, and vehicular density. The results of the proposed HPDBWOA-NC generated optimal number of CHs in the network which is comparatively 34.21% better than the benchmarked mechanisms. The mean throughput and packet delivery ratio (PDR) achieved by the proposed HPDBWOA-NC are identified to be significantly improved by 25.48% and 28.91% better than the investigated metaheuristic clustering protocols. The statistical study also guaranteed an increased factor of 81, during the processing of optimizing the clusters during the employment of ITS applications in VANETs.     

QoS multicast routing scheme using QGA in IP/DWDM networks

This article studies multi-constraints least-cost multicast routing problem in internet protocol over dense wavelength division multiplexing （IP/DWDM） networks. To address this problem, an individual-difference-based quantum genetic algorithm （IDQGA） is proposed. This algorithm considers individual differences among chromosomes by introducing an adaptive rotation angle step determination scheme and a grouping-based quantum mutation operation. Simulations are conducted over network topologies. The results indicate that compared with other heuristic algorithms, IDQGA has better optimal performance on solving quality of service （QoS） multicast routing problem in IP/DWDM networks and is characterized by strong robustness, high success ratio and excellent capability on global searching.     

Optimal cluster-based routing scheme using node mobility in ad hoc networks

Ad hoc networks have a scalability problem. When the nodes of an ad hoc network increase in number or mobility, the amount of control traffic for routing increases and could cause traffic congestion. Cluster-based routing schemes have been proposed as a solution to this problem. Typical cluster-based ad hoc networks use a proactive routing scheme for intra-cluster routes and a reactive routing scheme for inter-cluster routes. In this study, we propose a new cluster-based routing scheme for ad hoc networks which makes use of the mobility of nodes. Nodes are divided into two groups on the basis of their mobility. For a route search within a cluster, a proactive routing scheme is used for low-mobility nodes and a flooding-based reactive routing scheme is used for high-mobility nodes. The required control traffic of the proposed scheme is analyzed and optimal parameters of the proposed scheme are derived from the analysis. The numerical results show that the proposed scheme produces far less control traffic than a typical cluster-based routing scheme.     

RBF神经网络LM算法的改进

文章对现有的RBF神经网络算法进行改进,改进的基本思想是：采用L-M算法训练RBF网络,并对L-M算法的重要参数提出一种随迭代步数的动态调整方法,从而提高运算的精度和效率,并经过仿真验证了提出改进方案的有效性。     

一种适用于异步无线传感器网络的机会路由机制

无线传感器网络通常使用低占空比的异步睡眠调度来降低节点能耗。由于发送节点在接收节点醒来后才能向其发送数据,这将引入额外的等待时延。在最近的一些任播路由机制中,发送节点动态地选择最先醒来的候选节点转发数据,以最小化等待时延。但是,由于从最先醒来的候选节点到基站的时延可能并不低,任播路由机制并不一定能最小化端到端总时延。为此,提出了一种适用于异步无线传感器网络的机会路由机制,将路由决策建模为强马尔科夫过程,并根据最优停止理论推导出该过程一种简化的停止规则。仿真结果表明,节点到基站的最大端到端时延仅为基于地理位置的机会路由的68.5%。     

An energy-aware grid-based routing scheme for wireless sensor networks

As an important field of emerging technology, wireless sensor networks (WSN) offer many new possibilities for applications such as target tracking and environmental surveillance by allowing the observer to move around freely. However, disseminating sensing data to the mobile observer raises significant design challenges for the routing scheme. In addition, WSN often operate under certain energy constraints, and therefore reducing energy dissipation in order to prolong the lifetime of the WSN is another challenge that must be faced. Most proposed routing protocols focus on achieving effective data dissemination and energy efficiency at the same time as working to satisfy the requirements of the mobile observer. However, almost all of these methods use frequent rerouting as a way of handling the mobility issue. Such rerouting increases both overheads and energy consumption, resulting in a trade-off between the need for rerouting to optimize network operations and that of maximizing network lifetime. This paper presents the Energy-aware Grid-based Routing Scheme (EAGER) for WSN with mobile observers, which is an approach that seeks to save more energy in the context of dynamic topology. In this paper, EAGER is compared to other proposed grid-based schemes by using extensive simulations. These simulations clearly show that EAGER outperforms other grid-based schemes in terms of both energy efficiency and routing performance.     

A probabilistic home-based routing scheme for delay tolerant networks

Wireless Networks - In traditional Mobile Adhoc Networks routing algorithms, the existence of a sustainable path between the source and destination is a crucial issue. These algorithms are shown to...     

Topological properties and routing algorithm for semi-diagonal toms networks

To improve the scalability and reduce the implementation complexity of Mesh and Mesh-like networks,the semi-diagonal Torus(SD-Torus)network,a regular and symmetrical interconnection network is proposed.The SD-Torus network is a combination of a typical 2D-Torus network with two extra diagonal links from northwest to southeast direction for each node.The topological properties of SD-Torus networks are discussed,and a load balanced routing algorithm for SD-Torus is presented.System-C based simulation result shows that,compared with diagonal Mesh(DMesh),diagonal Torus(DTorus)and XMesh networks,the SD-Torus network can achieve high performance with a lower network cost.It makes the SD-Torus network a powerful candidate for the high performance interconnection networks.     

Energy and delay aware routing algorithm for fiber-wireless networks

Access networks consume significant portion of the overall energy consumed by internet. The power consumption growth rate of internet is higher than any other consumer of energy. With the introduction of more and more bandwidth hungry applications, there is a huge pressure to reduce network energy consumption while still growing network capacity and functionality. We propose an energy and delay aware routing algorithm for fiber-wireless (FiWi) networks (EDAR) which not only reduce the energy consumption of the FiWi networks and but also does not degrade the overall delay of the network. We introduce dynamic thresholds for switching nodes into sleep and active mode. Our analyses show a significant reduction in the energy consumption of the FiWi networks while keeping the performance of the network up to an acceptable limit.     

Topological properties and routing algorithm for semi-diagonal torus networks

To improve the scalability and reduce the implementation complexity of Mesh and Mesh-like networks,the semi-diagonal Torus(SD-Torus)network,a regular and symmetrical interconnection network is proposed.The SD-Torus network is a combination of a typical 2D-Torus network with two extra diagonal links from northwest to southeast direction for each node.The topological properties of SD-Torus networks are discussed,and a load balanced routing algorithm for SD-Torus is presented.System-C based simulation result s...