Description: 摘 : 通过使用 peer-to-peer(P2P)计算模式在 Internet 物理拓扑基础上建立一个称为 P2P 覆盖网络(P
overlay network)的虚拟拓扑结构,有效地建立起一个基于 Internet 的完全分布式自组织网络路由模型
集中式自组织网络路由模型(hierarchical aggregation self-organizing network,简称 HASN).分别描述了 HASN
由模型的构建目标和体系结构,并详细分析了 HASN 采用的基于 P2P 计算模式的分布式命名 路由发现和更
算法 HASN_Scale,并在仿真实验的基础上,对 HASN 路由模型的性能进行了验证. -pick : through the use of peer-to-peer (P2P) computing model in the physical topology based on Internet established as a peer-to-peer network coverage (P overlay network) virtual topology, to establish an Internet-based Distributed completely self-organizing network routing model of a centralized self-organizing network Tongxinluo routing model (hierarchical aggregation self-Organization The driver, network, short HASN). HASN were described by the model of the goals and structure. and HASN detailed analysis of the peer-to-peer computing model based on distributed naming and routing algorithm found HASN _Scale and simulation on the basis of HASN routing model the performance of the test. Platform: |
Size: 630753 |
Author:aaaa |
Hits:
Description: 摘 : 通过使用 peer-to-peer(P2P)计算模式在 Internet 物理拓扑基础上建立一个称为 P2P 覆盖网络(P
overlay network)的虚拟拓扑结构,有效地建立起一个基于 Internet 的完全分布式自组织网络路由模型
集中式自组织网络路由模型(hierarchical aggregation self-organizing network,简称 HASN).分别描述了 HASN
由模型的构建目标和体系结构,并详细分析了 HASN 采用的基于 P2P 计算模式的分布式命名 路由发现和更
算法 HASN_Scale,并在仿真实验的基础上,对 HASN 路由模型的性能进行了验证. -pick : through the use of peer-to-peer (P2P) computing model in the physical topology based on Internet established as a peer-to-peer network coverage (P overlay network) virtual topology, to establish an Internet-based Distributed completely self-organizing network routing model of a centralized self-organizing network Tongxinluo routing model (hierarchical aggregation self-Organization The driver, network, short HASN). HASN were described by the model of the goals and structure. and HASN detailed analysis of the peer-to-peer computing model based on distributed naming and routing algorithm found HASN _Scale and simulation on the basis of HASN routing model the performance of the test. Platform: |
Size: 630784 |
Author:aaaa |
Hits:
Description: 一种基于贪焚算法的分布式路由方案的VLSI实现-The burning of a greedy algorithm based on distributed routing program realize VLSI Platform: |
Size: 402432 |
Author:chenhang |
Hits:
Description: 实现无线传感器网络协议leach
该算法基本思想是：以循环的方式随机选择蔟首节点，将整个网络的能量负载平均分配到每个传感器节点中，从而达到降低网络能源消耗、提高网络整体生存时间的目的。仿真表明，与一般的平面多跳路由协议和静态分层算法相比，LEACH可以将网络生命周期延长15％。
-Realize wireless sensor network protocol leach basic idea of the algorithm is: a way to cycle randomly selected first cluster node, the energy of the entire network load evenly distributed to each sensor node in the network so as to achieve lower energy consumption, improve the overall survival time of network目的. Simulation shows that with the ordinary flat multi-hop routing protocol and static stratification algorithm, LEACH can extend network life-cycle 15. Platform: |
Size: 562176 |
Author:dfzr |
Hits:
Description: Programming language: Developed in Omnet++.
Comment: The model implements the AntNet routing algorithm proposed in: G. Di Caro and M. Dorigo. AntNet: Distributed Stigmergetic Control for Communications Networks. Journal of Artificial Intelligence Research, 9:317-365, 1998. It reqires OMNeT++ 2.3 or later. Platform: |
Size: 62464 |
Author:xiaochuzhe |
Hits:
Description: Euclidean节点定位是由美国路特葛斯大学利用距离矢量路由和GPS定位原理提供出一种分布式自主定位算法-Node localization Euclidean path by the Rutgers Universitys use of distance vector routing and GPS positioning to provide a principle of self-positioning algorithm for distributed Platform: |
Size: 1060864 |
Author:qinhua |
Hits:
Description: 关于无线传感器网络的路由算法研究，在能量均衡上的经典LEACH算法，用matlab进行的仿真，能够实现！-Abstract: The distributed wireless sensor net work and the technol ogy of wireless communicati on could realize the subsidence monit oring
and measuring in coalmine goaf . One of the i mportant researcheswas r outing p r ot ocol in wireless sens or net works . Based on the design
idea of the LEACH routing p r ot ocol for the wireless sens or net work, taking the net work communicati on capacity t o be increased and the re2
dundant data trans missi on t o be reduced as the target, according t o the available LEACH i mp r oved calculati on method, an i mp roved layer
r outing p rot ocol algorithm was p rovided . With the introducti on of the forced cluster head and according t o the data relativity of the monit o2
ring and measuring variati on for the unit p itch pointswithin the continued ti me, the redundant data transmissi on quantitywas reduced . A
comparison si mulati on on the net work existing ti me of the i mp roved algorithm for the t wo LEACH p rot ocolswas conduced . The Platform: |
Size: 2048 |
Author:李博宁 |
Hits:
Description: 设计无线传感器网络的路由协议，LEACH是第一个基于多簇结构的集群路由协议，是一种分布式的协议,每一个节点通过一个概率来决定自己是否成为簇头节点,并保证每轮有相当数量的簇头节点.
-Design of wireless sensor network routing protocol, LEACH is the first structure of a cluster based on multi-cluster routing protocol, the protocol is a distributed, each node to determine their own through a probability whether a cluster head node, and to ensure that each round there is considerable number of cluster head node. Platform: |
Size: 51200 |
Author:杨扬 |
Hits:
Description: Kademlia协议（以下简称Kad）是美国纽约大学的PetarP. Maymounkov和David Mazieres.
在2002年发布的一项研究结果《Kademlia: A peerto -peer information system based on the XOR metric》。
简单的说，Kad 是一种分布式哈希表（DHT）技术，不过和其他 DHT 实现技术比较，如 Chord、CAN、Pastry 等，Kad 通过独特的以异或算法（XOR）为距离度量基础，建立了一种 全新的 DHT 拓扑结构，相比于其他算法，大大提高了路由查询速度。-Kademlia Agreement (Kad) is a New York University' s PetarP. Maymounkov and David Mazieres. In 2002, a study released " Kademlia: A peerto-peer information system based on the XOR metric" . Simply put, Kad is a distributed hash table (DHT) technology, but compared with other DHT implementation technologies, such as Chord, CAN, Pastry, etc., Kad through a unique algorithm to different or (XOR) as a distance measure based on DHT established a new topology, compared to other algorithms, which greatly improves the speed of routing queries. Platform: |
Size: 221184 |
Author:MeterCai |
Hits:
Description: 计算机网络自顶向下第三版 套接字编程教辅
关于Implementing an Algorithm的部分-In this lab, you will be writing a "distributed" set of procedures that implement a distributed asynchronous
distance vector routing for the network Platform: |
Size: 13312 |
Author:yagao |
Hits:
Description: Euclidean节点定位是由美国路特葛斯大学利用距距离矢量路由和GPS定位原理提供出一种分布式自主定位算法
-Euclidean node localization by the U.S. Lutegesi University distance distance vector routing and GPS positioning principle to provide a distributed autonomous positioning algorithm Platform: |
Size: 1060864 |
Author:推翻 |
Hits:
Description: 分布式异步路由算法中——距离向量算法的C语言仿真实现，非常好地模拟了网络中各节点的路由情况-Distributed asynchronous routing algorithm- distance vector algorithm C language simulation, very good simulation of the network, each node in the routing case Platform: |
Size: 7168 |
Author:panchen |
Hits:
Description: Opportunistic Routing下的视频传输。More是一种基于Opportunistic Routing思想的无线网络路由策略，其核心算法是使用Network Coding 的方法来实现数据的分布式转发。-Video transmission by Opportunistic Routing . More is based on Opportunistic Routing routing strategy in wireless network, and the core algorithm is to use the Network Coding method to achieve distributed forwarding data. Platform: |
Size: 1026048 |
Author:ffaa |
Hits:
Search - distributed routing algorithm