Welcome![Sign In][Sign Up]
Location:
Search - rreq

Search list

[Linux-Unixkernel-aodv_v2.1-c

Description: linux 下的aodv实现源代码,由National Institute of Standards and Technology开发-AODV to achieve under the linux source code, by the National Institute of Standards and Technology Development
Platform: | Size: 78848 | Author: liwei | Hits:

[Internet-NetworkNS-2_AODV_RREQ_RREP

Description: NS-2中AODV的RREQ与RREP讯息传送过程,有详细的代码分析和仿真结果-NS-2 in the AODV
Platform: | Size: 112640 | Author: | Hits:

[Software EngineeringOLSR

Description: 分析研究AODV协议本地修复算法的特点,并对其进行改进,形成了改进的AODV路由协议本地修复算法-A new idea about local repair is used to improve the AODV and formed the Improved AODV algorithm.Otherwise,a new approach is proposed for flooding limit.The approach is implemented by using cross-layer design,which limits the flooding procedure of RREQ packets in AODV routing protocol.
Platform: | Size: 2349056 | Author: 李超杰 | Hits:

[SCMrreq

Description: C code for the virture.
Platform: | Size: 3072 | Author: 吴刚 | Hits:

[Internet-Networkaodv_dump

Description: AODV的RREQ與RREP訊息傳送過程 程榮祥 .郭俐君 chengrs@nsda.ee.ncku.edu.tw 簡介-AODV' s RREQ and RREP message transmission process Rong祥 . Guo Li-Jun chengrs@nsda.ee.ncku.edu.tw Profile
Platform: | Size: 112640 | Author: 中国 | Hits:

[Internet-Networkrouting_aodv

Description: aodv源代码,RREP路由回复,RREQ路由请求,RRER路由错误的编写,以及aodv中没有字段中每个参数的描述,以及函数的实现,数据发送的处理和数据接收的处理-aodv,RREP,RRER protocol ,RREQ
Platform: | Size: 39936 | Author: 刘微 | Hits:

[Internet-NetworkAODV-flow-chart

Description: aodv 详细流程图 有各类数据分组rreq,rrep,rrer等处理方法-aodv flow chart in details analyze the functions of aodv
Platform: | Size: 90112 | Author: qwerty | Hits:

[.netEnabling-dynamic-data-and-mutual-trust

Description: Ad hoc networks are new paradigm of networks offering unrestricted mobility without any underlying infrastructure. ROUTING is one of the most basic networking functions in mobile ad hoc networks. In partitioned networks, same addresses can exist between partitioned networks. Therefore, when several partitioned networks or independent networks merge into one network, potential address conflicts must be resolved. The address conflicts are detected through a DAD (Duplicate Address Detection) procedure. In reference 1, authors introduced three schemes: PDAD-RREQ Never- Sent (RNS), PDAD-RREP-Without-RREQ (RwR), and PDAD-2RREPs-on-RREQ (2RoR). These schemes can detect conflicts of a set of nodes but not all the duplicates and with a higher scope of false positives. This paper presents an adaptive version of PDAD. -Ad hoc networks are new paradigm of networks offering unrestricted mobility without any underlying infrastructure. ROUTING is one of the most basic networking functions in mobile ad hoc networks. In partitioned networks, same addresses can exist between partitioned networks. Therefore, when several partitioned networks or independent networks merge into one network, potential address conflicts must be resolved. The address conflicts are detected through a DAD (Duplicate Address Detection) procedure. In reference 1, authors introduced three schemes: PDAD-RREQ Never- Sent (RNS), PDAD-RREP-Without-RREQ (RwR), and PDAD-2RREPs-on-RREQ (2RoR). These schemes can detect conflicts of a set of nodes but not all the duplicates and with a higher scope of false positives. This paper presents an adaptive version of PDAD.
Platform: | Size: 4920320 | Author: pravin | Hits:

[P2PBlocking-EDS

Description: Since RREQ packets are flooded throughout the network, this algorithm does not scale well to large networks. If the destination node is located relatively near the source, issuing a RREQ packet that potentially pass through every node in the network is wasteful. The optimization AODV uses is the expanding ring search algorithm, which works as follows. The source node searches successively larger areas until the destination node is found. This is done by, for every RREQ retransmission until a route is found, incrementing the time to live (TTL) value carried in every RREQ packet, thus expanding the ``search ring in which the source is centered. -Since RREQ packets are flooded throughout the network, this algorithm does not scale well to large networks. If the destination node is located relatively near the source, issuing a RREQ packet that potentially pass through every node in the network is wasteful. The optimization AODV uses is the expanding ring search algorithm, which works as follows. The source node searches successively larger areas until the destination node is found. This is done by, for every RREQ retransmission until a route is found, incrementing the time to live (TTL) value carried in every RREQ packet, thus expanding the ``search ring in which the source is centered.
Platform: | Size: 3072 | Author: Abdullah | Hits:

[Program docAODV

Description: (AODV creates and uses two phases (1) Discovery of route and (2) Maintenance of route. Protocol uses Request (RREQ)of route, Reply (RREP) of route, Discovery of route and Error of route (RERR) control message in Maintenance of route .The beginning node initiates a connection to ending node, first it checks in the existing route table, as to whether a fresh route to that destination is available or not
Platform: | Size: 423936 | Author: sonia | Hits:

[OS programAODV-DSR-MATLAB

Description: 一种源驱动路由协议。当一个节点需要给网络中的其他节点传送信息时,如果没有到达目标节点的路由,则必须先以多播的形式发出RREQ(路由请求)报文。-Ad hoc On-demand Distance Vector Routing
Platform: | Size: 5120 | Author: 亓刚 | Hits:

[OS programWSN-AODV

Description: 当一个节点需要给网络中的其他节点传送信息时,如果没有到达目标节点的路由,则必须先以多播的形式发出RREQ(路由请求)报文-AODV(Ad hoc On-demand Distance Vector Routing)
Platform: | Size: 2048 | Author: 亓刚 | Hits:

CodeBus www.codebus.net