Description: 单比特树查找算法，是用于路由查找的，内含有路由查找相关资料-Monobit tree-search algorithm is used to identify the routing, which contain routing information Search Platform: |
Size: 32354 |
Author:bingxuere03 |
Hits:
Description: 实现这个算法需要如下的信息，首先算法要有己形成的多播路由树T 到所有目的节点的最短路信息，为此算法采用一个树组TD 记录已形成的多播路由树到每一个目的节点的最短路消息-The realization of this algorithm needs the following information, first of all algorithms have been formed by multicast routing tree T for all purposes to the most short-circuit node information, for this algorithm uses a tree TD record group has formed a multicast routing tree to each purpose node of the most short-circuit the news Platform: |
Size: 7168 |
Author:rock |
Hits:
Description: ZigBee路由协议指的是ZigBee规范中规定的与路由相关的功能和算法部分，主要包括不同网络拓扑结构下ZigBee协议数据单元的路由方式、路由发现和路由维护等内容。为了达到低成本、低功耗、可靠性高等设计目标，ZigBee网络采用了Cluster-Tree与AODV路由相结合的路由算法。该包实现了ZIGBEE路由算法在NS2下的模拟-ZigBee Routing Protocol refers to the ZigBee specification and routing provisions related functions and algorithms in part, including different network topologies under the ZigBee protocol data unit routing methods, routing discovery and routing maintenance and so on. In order to achieve low-cost, low power consumption, high reliability design goal, ZigBee network using Cluster-Tree Routing with the AODV routing algorithm combining. The implementation of the ZigBee packet routing algorithm in NS2 under the Analog Platform: |
Size: 1718272 |
Author:dong |
Hits:
Description: An IEEE 802.15.4-based Wireless Sensor Network
is considered, and the relationship between the IEEE 802.15.4 topology formation mechanism and possible routing strategies at the network layer is studied. Two alternative routing schemes proposed in the framework of the ZigBee Alliance are analyzed.The first is the well-known Ad-hoc On demand Distance Vector
(AODV) routing protocol, which was designed for highly dynamic application scenarios in wireless ad-hoc networks. The second is
a tree-based routing scheme based on a hierarchical structure established among nodes during the network formation phase. This latter approach, referred to as HERA (HiErarchical Routing Algorithm) in the paper, routes packets from sensors to sink based on the parent-child relationships Platform: |
Size: 173056 |
Author:HArry |
Hits:
Description: Dijkstra Algorithm - a graph search algorithm that solves the single-source shortest path problem for a graph with nonnegative edge path costs, producing a shortest path tree. This algorithm is often used in routing. Platform: |
Size: 1024 |
Author:Andrutza |
Hits:
Description:
This paper introduces a message forwarding algorithm for search applications within mobile ad hoc networks that is based on the concept of selecting the nearest node from a set of designated nodes. The algorithm, which is called Minimum Distance Packet Forwarding (MDPF), uses routing information to select the node with the minimum distance. The goal of the proposed algorithm is to minimize the average number of hops taken to reach the node that holds the desired data performed to derive the lower and upper bounds of the confidence interval for the mean hop count between the source node of the data request, on one hand, and the node that holds the desired data and the last node in the set of search nodes, on the other hand. In the experimental evaluation, the performance of MDPF was compared to that of Random Packet Forwarding (RPF) and Minimal Spanning Tree Forwarding (MSTF).
-
This paper introduces a message forwarding algorithm for search applications within mobile ad hoc networks that is based on the concept of selecting the nearest node from a set of designated nodes. The algorithm, which is called Minimum Distance Packet Forwarding (MDPF), uses routing information to select the node with the minimum distance. The goal of the proposed algorithm is to minimize the average number of hops taken to reach the node that holds the desired data performed to derive the lower and upper bounds of the confidence interval for the mean hop count between the source node of the data request, on one hand, and the node that holds the desired data and the last node in the set of search nodes, on the other hand. In the experimental evaluation, the performance of MDPF was compared to that of Random Packet Forwarding (RPF) and Minimal Spanning Tree Forwarding (MSTF).
Platform: |
Size: 66560 |
Author:sathiyaraj124 |
Hits:
Description: This paper introduces a message forwarding algorithm for search applications within mobile ad hoc networks that is based on the concept of selecting the nearest node from a set of designated nodes. The algorithm, which is called Minimum Distance Packet Forwarding (MDPF), uses routing information to select the node with the minimum distance. The goal of the proposed algorithm is to minimize the average number of hops taken to reach the node that holds the desired data performed to derive the lower and upper bounds of the confidence interval for the mean hop count between the source node of the data request, on one hand, and the node that holds the desired data and the last node in the set of search nodes, on the other hand. In the experimental evaluation, the performance of MDPF was compared to that of Random Packet Forwarding (RPF) and Minimal Spanning Tree Forwarding (MSTF).-This paper introduces a message forwarding algorithm for search applications within mobile ad hoc networks that is based on the concept of selecting the nearest node from a set of designated nodes. The algorithm, which is called Minimum Distance Packet Forwarding (MDPF), uses routing information to select the node with the minimum distance. The goal of the proposed algorithm is to minimize the average number of hops taken to reach the node that holds the desired data performed to derive the lower and upper bounds of the confidence interval for the mean hop count between the source node of the data request, on one hand, and the node that holds the desired data and the last node in the set of search nodes, on the other hand. In the experimental evaluation, the performance of MDPF was compared to that of Random Packet Forwarding (RPF) and Minimal Spanning Tree Forwarding (MSTF).
Platform: |
Size: 1982464 |
Author:sathiyaraj124 |
Hits:
Description: 用C语言实现最短路径算法 最小生成树 本程序是用F算法求最短的路由花费 可计算的最大的路由结点数为100 */
/* 运行环境： vc++6.0 */
-C language with the shortest path algorithm minimum spanning tree algorithm of the program is seeking the shortest route F calculate the maximum cost of routing nodes 100*//* operating environment: vc++6.0* / Platform: |
Size: 1024 |
Author:yuanjie |
Hits:
Description: Dijkstra s algorithm, conceived by Dutch computer scientist Edsger Dijkstra in 1956 and published in 1959is a graph search algorithm that solves the single-source shortest path problem for a graph with nonnegative edge path costs, producing a shortest path tree. This algorithm is often used in routing and as a subroutine in other graph algorithms Platform: |
Size: 33792 |
Author:ahmed |
Hits:
Description: 虚拟骨干网，包括佛罗里达大西洋大学的Jie Wu和Hailan Li 提出的关于连通控制集的算法，第二种算法是das等提出的从找到最小近似控制集到建立一个最小生成树的算法，最后一种算法是通过寻找MIS集获得CDS的方法。这三种算法提供了三种建立CDS集的方法，连通控制集（connected dominating set，CDS）作为层次路由协议中的虚拟主干是网络中保证其余节点能顺利通信的关键，它们承受更高的通信和计算负荷，网络的可靠性会因这些关键节点中的某个节点的失效而受影响。-Virtual backbone, including Jie Wu, Florida Atlantic University and Hailan Li on the connected dominating set algorithm, the second algorithm is das, etc. proposed the establishment of a minimum spanning tree algorithm to find the smallest approximate control set to the last onethe algorithm is obtained by finding the MIS set of CDS. Of the three algorithms, three kinds of CDS set, connected dominating sets (connected dominating the set, CDS), as a hierarchical routing protocol in the virtual backbone is the network to ensure that the remaining nodes can successfully communicate key, they are subjected to higher communication and the computational load, the reliability of the network due to the failure of these critical nodes in a node affected. Platform: |
Size: 3449856 |
Author: |
Hits:
Description: This is a graph search algorithm that solves the single-source shortest path problem for a graph with nonnegative edge path costs, producing a shortest path tree. This algorithm is often used in routing and as a subroutine in other graph algorithms. NetBeans project Platform: |
Size: 26624 |
Author:Nastya |
Hits:
Description: Dijkstra s algorithm, conceived by Dutch computer scientist Edsger Dijkstra in 1956 and published in 1959,[1][2] is a graph search algorithm that solves the single-source shortest path problem for a graph with nonnegative edge path costs, producing a shortest path tree. This algorithm is often used in routing and as a subroutine in other graph algorithms. Platform: |
Size: 40960 |
Author:ivan |
Hits:
Description: ZigBee路由算法分析，基于IEEE802.15.4标准的ZigBee网络是一种具有强大组网能力的新型无线个域网，其中的路由算法是研发工作的重点。本文介绍了IEEE802.15.4标准及ZigBee规范的协议模型，重点研究了ZigBee协议网络层的路由算法，分析了Tree路由及Z-AODV路由算法，在此基础上提出了ZigBee网格型网络中基于数据特性的路由选择机制，该机制在网络性能和低功耗方面有明显的优势，并且可以平衡节点能量，最后简单介绍了ZigBee节点的硬件实现。-ZigBee routing algorithm based on the IEEE802.15.4 standard ZigBee network is a powerful networking capabilities of new wireless personal area network, the routing algorithm is the focus of R & D work. This article describes the IEEE802.15.4 standard and the ZigBee specification of the protocol model, focused on the ZigBee protocol network layer routing algorithm, Tree Routing and Z-AODV routing algorithm based on the ZigBee mesh network based on data characteristics of routing mechanism, the mechanism has an obvious advantage in network performance and low power consumption, and can balance the node energy, and finally a brief introduction to the hardware implementation of the ZigBee node. Platform: |
Size: 76800 |
Author:朱程序 |
Hits:
Description: 基于最小生成树的无线传感器网络路由算法研究，做该方面研究的可以下载使用。-Based on wireless sensor network routing algorithm minimum spanning tree, do the aspect of the study can be downloaded using the Platform: |
Size: 768000 |
Author:谢哲 |
Hits:
Description: Wireless sensor networks with mobile sink are ex-pected to increase the flexibility for gathering information in large-scale sensing and detecting environments. Energy saving becomes one of the most important features of the sensor nodes to extend their lifetime in such networks. A novel tree-based power saving scheme is proposed in this paper to reduce the energy consumption in wireless sensor networks with mobile sink. We adopt a dynamic sorting algorithm to create a tree-cluster routing structure for the sensor nodes. The main goal of this scheme is to reduce the data transmission distances of the sensor nodes by employing the tree structure and multi-hop concepts. Based on the location of mobile sink, the distances between the sensor nodes, and the residual energy of each sensor node, the proposed scheme makes an efficient decision for creating the routing structure. The energy consumption is reduced and the lifetime is extended for the sensor nodes by balancing the network load. Platform: |
Size: 1226752 |
Author:wadgiad |
Hits:
Description: Energy is one of the most important items to determine the network lifetime due to low power energy nodes included in the network. Generally, data aggregation tree concept is used to find an energy efficient solution. However, even the best aggregation tree does not share the load of data packets to the transmitting nodes fairly while it is consuming the lowest possible energy of the network. Therefore, after some rounds, this problem causes to consume the whole energy of some heavily loaded nodes and hence results in with the death of the network. In this paper, by using the Genetic Algorithm (GA), we investigate the energy efficient data collecting spanning trees to find a suitable route which balances the data load throughout the network and thus balances the residual energy in the network in addition to consuming totally low power of the network. Using an algorithm which is able to balance the residual energy among the nodes can help the network to withstand more and consequently extend its own lifetime. In this work, we calculate all possible routes represented by the aggregation trees through the genetic algorithm. GA finds the optimum tree which is able to balance the data load and the energy in the network. Simulation results show that this balancing operation practically increases the network lifetime. Platform: |
Size: 342534 |
Author:atrakpc@yahoo.com |
Hits:
Search - tree routing algorithm