共查询到20条相似文献，搜索用时 15 毫秒
1.
The n-dimensional locally twisted cube(LTQ_(n)) is a newly introduced interconnection network for parallel computing.First, the authors illustrate that there exists deadlock in the minimal routing algorithm.Second,by employing the common virtual network dividing technique,a new routing algorithm is presented,which is proved to be deadlock-free.By exploring the property that one LTQ_(n) consists of one n-1-dimensional hypercube(Q_(n-1)) and one n-1-dimensional 2-twisted cube(Q_(n1,2)),the authors apply the existing adaptive routing strategies for Q_(n-1) and Q_(n-1,2) to induce an adaptive routing scheme for LTQ_(n).So the algorithm can route adaptively in the Q_(n-1)0 or in the Q_(n-1,2)1. 相似文献
2.
The interconnection network used in a multiprocessor system provides an effective mechanism for the data exchange between the processors and is one of the dominating factors of performance of the system. The fault tolerance of an interconnection network can be measured by the probability that the network keeps functional in the presence of failures. The authors examine the fault tolerance of four regular interconnection networks (i.e. hypercube, crossed cube, Moius cube, and locally twisted cube) with the probabilistic approach. Experimental results show that all these interconnection networks display excellent fault tolerance. Moreover, the crossed cube enjoys the highest probabilistic of connectivity among them. 相似文献
3.
In wireless sensor network, routing protocols which based on clustering have the advantages of energy consumption, topology management and data fusion. The HEED protocol, which generates cluster heads based on distributed algorithm, drives up the rate of clustering and creates well distributed cluster heads. However, it does not consider the mobility of nodes in the network. When the distance between neighbor nodes has changed, the AMRP method which decides the node belongs to different cluster heads would cause problems such as high energy consumption, short lifetime of network and so on. Responding to these problems, the paper proposes the S HEED, a clustering algorithm based on stability, which chooses the stability as a parameter of nodes when choosing a cluster head. With S HEED algorithm, the high energy consumption problem among cluster nodes and cluster heads caused by the mobility is tackled. The simulation experiment demonstrates that the S HEED algorithm lower the energy consumption of cluster heads and prolongs the network lifetime. 相似文献
4.
By analyzing the reason that why the existing routing protocols cannot be applied to the wireless sensor networks for bridge health monitoring, a new routing protocol is proposed. Since the locations of the collecting modules are fixed, the proposed protocol exchanges the routing information between the neighbor nodes by adjusting the exchange cycle according to reliability of the modules. For the low routing security requirement, while to increase the routing efficient, the middle nodes replying the routing requirements with variable thresholds is introduced. In order to make full use of information in route discovering procedure, the backup routes mechanism is adopted. The proposed protocol can efficiently forward data and is suitable for the bridge health monitoring. 相似文献
5.
The traditional routing protocol for wireless mobile ad hoc networks is unable to achieve balanced energy consumption and could not adapt to the dynamic topology changes well.A novel on-demand rooting algorithm is proposed based on load balancing and mobility prediction.The proposed rooting algorithm excludes the unstable links in routing discovery,and allows the node with more energy forward the routing request packet preferentially.In addition,it adopts the active local routing recovery strategy by predicting the link connection time,and finishes the repair work before the link being actually failure.The simulation experiments demonstrate that,comparing with the traditional AODV protocol,with slight increase of the rooting control overhead,the proposed algorithm increases the average packet delivery ratio,decreases the average end-to-end delay of the data packets,and achieves load balancing in the network and prolong the life-span of the network,which shows the proposed algorithm is highly practical. 相似文献
6.
《保鲜与加工》2000,(2):31
A new fluid artificial neural network circuit model for routing communication traffic is proposed.The features of the model are that it can make use of all topology information of the network,and the optimization calculation is performed with electric circuit,and the most optimum route for communication traffic in the network can be obtained in circuit reaction time.Simulation results indicate that the model is correct and feasible. [WT5HZ] 相似文献
7.
传感器节点能量是影响无线传感器网络的生存周期的关键因素,基本的GPSR协议所使用的贪婪算法忽略了角度因素对下一跳选择的影响,在转发失败遇到空洞问题时只能进行周边边界转发算法,以损耗节点能量为代价。为了节约节点能量,延长网络生存周期,从改进GPSR协议出发,综合考虑距离和角度这两个因素解决路由过程中的空洞问题。仿真实验表明,改进后的协议是网络节点消耗大大减少,网络生存时间为300 s,长于基本GPSR协议下的200 s。该协议缩短了路径长度,节约节点能量,减少能量的消耗,延长了网络生存时间。 相似文献
8.
无线移动自组网是仅由移动节点所组成的网络,具有分布式控制、自组织、多跳等特点,由于该网络具有抗毁性能高、易铺设等性质,越来越受到业界的广泛关注。原始的路由协议已经满足不了现有网络不可预测、频繁变化的拓扑结构的需要,因此,在之前研究的基础上,对现有Ad Hoc网络AODV路由协议进行了研究,并设计出一种基于AODV协议的改进路由协议——基于认知的AODV协议(Cognitive-based AODV,CAODV)。通过NS2进行试验仿真,结果表明,CAODV协议具有比AODV协议更加优良的性质,可以有效降低重启路由发现频率,增加断裂链路的修复成功率,降低协议的控制负载,对现有网络的动态变化具有很强的适应能力。 相似文献
9.
Aiming at the problem of link fault restoration in ASON, an improved equalizing routing algorithm (ERA) is introduced to proportion the load at the routing phase. In order to solve the easy blocking problem for the network without wavelength converter because of the wavelength continuity constraint, the algorithm WRCA is proposed at the wavelength assignment phase. This algorithm is realized by adding collision detection object (CDO) in the path message of the resource reservation protocol with traffic engineering extension (RSVP TE). Depending on the value of the CD flag, different wavelength selection strategies are applied at the destination node, and the blocks resulting from wavelength reservation collision are reduced. The simulation experiments compare four wavelength assignment algorithms with the same routing algorithm ERA. The results show that compared with the traditional first fit algorithm (FF) and random fit algorithm (RD), the FF and RD employing CD scheme can effectively reduce the blocking ratio of the whole network, and enhance the practical applicability of the restoration algorithms. 相似文献
10.
Honeycomb meshes are topological structures for connecting processors within parallel computers. The unicast routing strategy on honeycomb meshes are studied. It is indicated that a previous known routing algorithm may suffer from deadlock. A deadlock-free routing algorithm known as the XYZ-ROUTE algorithm is presented by employing the classical virtual channel technique. This algorithm is improved to make it work properly in the presence of convex faults. 相似文献
11.
On current network actuality and development trend, it is necessary to put traffic engineering in practice in IP backbone network on IP/MPLS. The essential demand in actualizing traffic engineering is traffic matrix measurement. After analyzing the defect of current measurement method, traffic engineering model and traffic matrix on LSP in IP backbone network based on MPLS, or relevant routing algorithm are researched. The merit of the traffic matrix's measurement method is that implement of measurement is only located in the edge node; therefore, network resource's cost is lower and it offers a new train of thoughts for resolving the flaw of current main measurement methods, moreover, and condition for actualizing traffic engineering. 相似文献
12.
There are a large number of malicious attack nodes and collusion groups in P2P(peer to peer) network, and the existing trust models improve the P2P network environment to some extent, but the emphasis of the models are different, which are unable to fully solve large-scale malicious attacks and deception. Therefore, a P2P trust model based on equilibrium theory is presented. The model consists of the construction of the trust structure, the malicious node detection and trust speculation. It constructs trust network according to the equilibrium theory, uses the equilibrium theory to define nodes balance factor, detects balance malicious nodes by calculating the impact of malicious behavior on the network, and adopts trust inference algorithm to estimate trust nodes to prevent distrust network nodes being added. Experimental results show that the model is reliable, and the algorithm is efficient and robust. 相似文献
13.
为了采用分散控制方式对工厂化水产养殖溶解氧进行监控,提出了基于ZigBee的溶解氧在线监控系统。系统采用集散控制模式,分为终端节点、路由节点和网关节点以及监控中心4个层次。终端节点采集养殖池中溶氧量,然后通过路由节点汇聚到网关节点,并根据溶氧量对与之连接的增氧机进行控制。网关节点将所有终端节点数据传输给监控中心,并接收监控中心的控制指令,进而通过各终端节点控制增氧机。同时,监控中心对数据进行存储、统计和分析,并产生控制指令。ZigBee节点采用CC2430作为核心芯片,使用ZigBee2006协议栈实现无线网络节点之间的通信。结果表明：该系统稳定性较好,部署灵活、容易扩展,满足了工厂化水产养殖的要求。实现了对溶解氧的在线实时监测及对增氧机的有效控制,降低了养殖成本。 相似文献
14.
To expand network coverage and enhance the reliability of wireless personal area network (WPAN), the problem of address overflow resulting from applying the meshed adaptive tree algorithm in large scale mesh network wis studied. By dividing the entire network into smaller sub networks, the subarea meshed adaptive tree wis constructed. An improved meshed adaptive tree routing algorithm wis proposed employing the hierarchical topology structure of the subarea meshed adaptive tree. Experimental results show that the algorithm expands the network coverage without increasing the routing overhead and the network load. It also effectively reduces the end to end delay and increases the packet delivery ratio and communication efficiency. It maintains a good performance in the networks with different scales and provides a theoretical basis for enhancing the coverage and reliability of WPAN. 相似文献
15.
The follow-up application of underwater wireless sensor network is influenced by accuracy of self-localization of nodes. The self-localization of nodes is discussed in this paper. First of all, nodes of underwater wireless sensor network are classified into several levels according to the accuracy of position of nodes and the levels are from the first to the fifth in accordance with accuracy of nodes from high to low respectively. Secondly, the level of anchor nodes can be known by those unknown nodes from the information given by the anchor nodes themselves, At the same time the unknown nodes are able to be located in the area controlled by the first level of anchor nodes that are as the aggregation. Then the positioning algorithm is designed correspondingly in accordance with the accuracy level of nodes. Finally, the positioning algorithm is simulated and analyzed. The result shows that the unknown nodes can be located effectively by hierarchical control. 相似文献
16.
传统OBS网络汇聚算法没有综合考虑边缘节点汇聚算法和核心节点的数据调度算法二者之间的相互联系,其通信性能受限。在分析OBS网络边缘节点汇聚算法对核心节点数据调度的影响后,提出了一种新的边缘节点汇聚算法——基于OBS网络的拥塞控制汇聚算法（CCAA）。该算法通过分析边缘节点汇聚参数对数据调度的影响,调整汇聚算法实现对核心节点调度成功率的影响,最终实现了提高核心节点数据调度的成功概率。 相似文献
17.
A Prüfer-coded genetic algorithm based on the decimal number of nodes is proposed and it is used to solve collaborative optimization planning of access solution of distributed generation(DG)and structure of distribution network.Using graph theory to generate theoretically feasible topology structureand the access nodes and the installed capacity of distributed generation are coded by the Prüfer number.The coding method makes the distribution network operation structure and the access solution of DG combine into the evolution problem of the same chromosomal gene.The length of the chromosome coding of this method is shorter than binary encoding.This solution takes full advantage of the Prüfer-coded to improve computational efficiency and convergence rateand makes some restrictions and improvements in some key parts of the algorithm to solve the problem illegal solution.Finallyfeasibility and superiority of the algorithm is validated by a case study. 相似文献
18.
The worst and best-case coverage algorithm is presented based on probability mode of wireless sensor network. The main idea is that choose these lattice points possibly with lowest detection probability by nodes to form the most breach path and choose those lattice points possibly with maximal detection probability by nodes to form the most support path. Simulation experiment validates the algorithm. 相似文献
19.
The existing security methods cannot be applied to the Internet of Things due to the defects of communication nodes. To solve this problem, an intrusion detection model based on repeated game theory is presented. A repeated game model algorithm for detecting malicious nodes is built, and the algorithm of Quantal Response Equilibrium (QRE) is used for optimizing the model and making results reach the Nash equilibrium. Moreover, a common punishment strategy is introduced to improve the success of transfer data in this model. The results of the simulation represent that this model can restrain malicious nodes attacking effectively and improve the efficiency of network. 相似文献
20.
For the high density of distributed heterogeneity nodes in wireless sensor networks (WSNs), the optimal sensor deployment is studied. A cost optimal heterogeneous sensor deployment scheme based on genetic algorithm is proposed. The cost of sensor node deployment is used as objective function for optimization computation subjected to network coverage and fault tolerance to obtain the suitable types and positions of the sensors. The algorithm can be used for boolean sensing model as well as probabilistic sensing model. The simulation results demonstrate that the proposed algorithm converges fast toward the optimal solutions and reduces the cost of sensor deployment, which is feasible for heterogenous nodes deployment in WSNs. 相似文献