Welcome![Sign In][Sign Up]
Location:
Search - neighbor discovery

Search list

[Internet-Networkdsr-uu-0.2

Description: DSR-UU is a DSR implementation that runs in Linux and in the ns-2 network simulator. DSR-UU implements most of the basic DSR features specified in the DSR draft (version 10). One big exception is flow extensions. DSR-UU does NOT use ARP, so do not be surprised if you do not see ARP traffic. DSR-UU instead uses its own neighbor table that sets up the MAC-to-IP translation during route discovery.
Platform: | Size: 245760 | Author: aurora yang | Hits:

[CommunicationOSPF_SPF_vertex

Description: Neighbor discovery protocol for WSN
Platform: | Size: 2048 | Author: Rafik Louati | Hits:

[DocumentsPartialdelaunaytriangulationanddegreelimitedlocali

Description: Partial delaunay triangulation and degree limited localized bluetooth scatternet formation- This paper addresses the problem of localized scatternet formation for multi-hop Bluetooth based personal area ad hoc networks. Nodes are assumed to know their positions and are able to establish connections with any of their neighboring nodes, located within their transmission radius, in the neighbor discovery phase. The next phase of the proposed formation algorithm is optional, and can be applied to construct a sparse geometric structure in a localized manner. We propose here a new sparse planar structure, namely, partial Delaunay triangulation (PDT), which can be constructed locally and is denser than other known localized structures. In the next mandatory phase, the degree of each node is limited to 7 by applying the Yao structure, and the master-slave relations in piconets are formed in created subgraphs. This phase consists of several iterations. In each iteration, undecided nodes with higher keys than any of their undecided neighbo
Platform: | Size: 406528 | Author: wang | Hits:

[Communicationipv6detailedannotation

Description: 本书全面讲解IPv6及相关协议实现的事实标准KAME,揭示了KAME IPv6协议栈的所有细节,对每行代码到底做了什么以及为什么要这样设计都进行了解释。全书共分7章,分别介绍IPv6地址结构、IPv6、ICMPv6、邻居发现和无状态地址自动配置、传输层协议及套接字API扩展。每章都包含两个主要部分:第一部分提供了作为RFC发布的主要协议规范的摘要,定义各种协议分组,解释每个分组中每个字段的含义和目的;第二部分则描述实现这些RFC的KAME的数据结构及功能。书的最后还提供了一些例子,说明如何编写既可以在IPv4网络上运行、又可以在IPv6网络上运行的可移植应用程序。. 本书是IPv6的权威参考书,适合网络设计和开发人员阅读。此外,本书还适合作为高校相关专业网络课程的教学参考书。-This book fully explain the IPv6 and related protocols, the de facto standard KAME, reveals the KAME IPv6 protocol stack all the details on each and every line of code in the end did what and why to be so designed to have carried out an explanation. The book is divided into seven chapters, describing the structure of IPv6 addresses, IPv6, ICMPv6, neighbor discovery and stateless address autoconfiguration, Transport Layer and the socket API extensions. Each chapter contains two main parts: the first part provides as RFC published a summary of the main protocol specification, defining a variety of protocols grouped in each group to explain the meaning and purpose of each field second part describes the to achieve these RFC s KAME data structure and functions. End of the book also provides some examples to illustrate how to write both in IPv4 networks running IPv6 networks and can run in portable applications. . This book is an authoritative reference IPv6 for network designers and d
Platform: | Size: 7183360 | Author: | Hits:

[JSP/JavaAdHocnetworkprogram

Description: 本文提出了一种E-AODV,对AODV做了两大改进:设计了一种邻节点发现规程(NDP),该规程为AODV设计而独立于AODV,可以被移植到其他路由协议中,它为路由协议提供了一种检测链路状态和邻节点发现的底层支持,并避免了单向链路和不稳定链路的产生。其次,将源路由技术引入到采用距离矢量技术的AODV中.-This thesis provides an Enhanced-AODV routing protocol that improves AODV in two sides: introduce a new routing supporting method named Neighbor Discovery Procedure (NDP) and involve source routing technique into AODV. Neighbor Discovery Procedure that can be transplanted into other routing protocols provides a lower layer support acting link failure detection, neighbor discovery and avoiding the use of unidirectional and instable links.
Platform: | Size: 6144 | Author: 唐有 | Hits:

[JSP/JavaKNN

Description: A graphical software to illustrate the process of KDD (Knowledge Data Discovery) using the KNN (K near neighbor) method. The SW was developed in JAVA and is the code is commented. Works on linux and Windows.
Platform: | Size: 1258496 | Author: Davi Miara | Hits:

[Special EffectsISIS

Description: 本文主要介绍了ISIS的实现原理,主要有leve1、level2以及level1-2的邻居发现机制以及SPF算法-This chapter descirbes the principle of IS-IS protocol, such as level1,level2 and level1-2 s neighbor discovery,as well as the SPF principle.
Platform: | Size: 1137664 | Author: chenshanrong | Hits:

[Program docprovable-secure-neighbor-discovery-wireless.pdf.z

Description: provable secure neighbor discovery wirele-provable secure neighbor discovery wireless
Platform: | Size: 229376 | Author: Diego | Hits:

[Software EngineeringNeighbor-discovery

Description: 最近通信研究的热门领域,D2D方向的discovery经典文献之一-One of the most popular areas of the recent discovery of classic literature communication studies, D2D direction
Platform: | Size: 1589248 | Author: 杨刚 | Hits:

[OtherRestoring-Connectivity

Description: 在无线传感器演员网络(WSANs),传感器 探索他们周围的环境,把他们的数据发送到更能 为了执行应用程序任务,演员节点。演员 反应大多是协同的,需要它们来协调 他们的操作。因此,一个强连接的演员 在所有的时间和宽容的演员,拓扑结构是必要的 失败成为一种设计要求。自主定位 演员节点被认为是一种有效的恢复策略。 本文提出了一种移动拓扑结构的修复 (lemotor)算法。 -To restore connectivity, LeMoToR strives to relocate the least number of nodes and reduce the traveled distance and message complexity. Unlike contemporary schemes that maintain 1 or 2-hop neighbor lists, LeMoToR utilizes existing path discovery activities in the network in order to know the structure of the topology and avoids imposing additional pre-failure communication overhead. The simulation results validate the effectiveness of LeMoToR.
Platform: | Size: 474112 | Author: 郝小凡 | Hits:

[Communication-Mobileneighbor discovery

Description: opnet 自编邻居发现,ad hoc自组网邻居发现方法(opnet neighbor discovery)
Platform: | Size: 1056768 | Author: marshalchen | Hits:

[Otherneighbour

Description: 基于最优发射概率的同步邻居发现算法,matlab仿真(Synchronous neighbor discovery algorithm based on optimal launch probability, matlab simulation)
Platform: | Size: 1024 | Author: happylulu789 | Hits:

CodeBus www.codebus.net