c语言aodv源码下载,print-aodv.c

最新推荐文章于 2021-05-22 17:11:46 发布
最新推荐文章于 2021-05-22 17:11:46 发布
阅读量197 收藏
点赞数
文章标签： c语言aodv源码下载

/*

* Copyright (c) 2003 Bruce M. Simpson

* All rights reserved.

*

* Redistribution and use in source and binary forms, with or without

* modification, are permitted provided that the following conditions

* are met:

* 1. Redistributions of source code must retain the above copyright

* notice, this list of conditions and the following disclaimer.

* 2. Redistributions in binary form must reproduce the above copyright

* notice, this list of conditions and the following disclaimer in the

* documentation and/or other materials provided with the distribution.

* 3. All advertising materials mentioning features or use of this software

* must display the following acknowledgement:

* This product includes software developed by Bruce M. Simpson.

* 4. Neither the name of Bruce M. Simpson nor the names of co-

* contributors may be used to endorse or promote products derived

* from this software without specific prior written permission.

*

* THIS SOFTWARE IS PROVIDED BY Bruce M. Simpson AND CONTRIBUTORS

* ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED

* TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR

* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL Bruce M. Simpson OR CONTRIBUTORS

* BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR

* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF

* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS

* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN

* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)

* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE

* POSSIBILITY OF SUCH DAMAGE.

*/

/* \summary: Ad hoc On-Demand Distance Vector (AODV) Routing printer */

#ifdef HAVE_CONFIG_H

#include

#endif

#include "netdissect-stdinc.h"

#include "netdissect.h"

#include "addrtoname.h"

#include "extract.h"

/*

* RFC 3561

*/

struct aodv_rreq {

nd_uint8_trreq_type;/* AODV message type (1) */

nd_uint8_trreq_flags;/* various flags */

nd_uint8_trreq_zero0;/* reserved, set to zero */

nd_uint8_trreq_hops;/* number of hops from originator */

nd_uint32_trreq_id;/* request ID */

nd_ipv4rreq_da;/* destination IPv4 address */

nd_uint32_trreq_ds;/* destination sequence number */

nd_ipv4rreq_oa;/* originator IPv4 address */

nd_uint32_trreq_os;/* originator sequence number */

};

struct aodv_rreq6 {

nd_uint8_trreq_type;/* AODV message type (1) */

nd_uint8_trreq_flags;/* various flags */

nd_uint8_trreq_zero0;/* reserved, set to zero */

nd_uint8_trreq_hops;/* number of hops from originator */

nd_uint32_trreq_id;/* request ID */

nd_ipv6rreq_da;/* destination IPv6 address */

nd_uint32_trreq_ds;/* destination sequence number */

nd_ipv6rreq_oa;/* originator IPv6 address */

nd_uint32_trreq_os;/* originator sequence number */

};

struct aodv_rreq6_draft_01 {

nd_uint8_trreq_type;/* AODV message type (16) */

nd_uint8_trreq_flags;/* various flags */

nd_uint8_trreq_zero0;/* reserved, set to zero */

nd_uint8_trreq_hops;/* number of hops from originator */

nd_uint32_trreq_id;/* request ID */

nd_uint32_trreq_ds;/* destination sequence number */

nd_uint32_trreq_os;/* originator sequence number */

nd_ipv6rreq_da;/* destination IPv6 address */

nd_ipv6rreq_oa;/* originator IPv6 address */

};

#defineRREQ_JOIN0x80/* join (reserved for multicast */

#defineRREQ_REPAIR0x40/* repair (reserved for multicast */

#defineRREQ_GRAT0x20/* gratuitous RREP */

#defineRREQ_DEST0x10/* destination only */

#defineRREQ_UNKNOWN0x08/* unknown destination sequence num */

#defineRREQ_FLAGS_MASK0xF8/* mask for rreq_flags */

struct aodv_rrep {

nd_uint8_trrep_type;/* AODV message type (2) */

nd_uint8_trrep_flags;/* various flags */

nd_uint8_trrep_ps;/* prefix size */

nd_uint8_trrep_hops;/* number of hops from o to d */

nd_ipv4rrep_da;/* destination IPv4 address */

nd_uint32_trrep_ds;/* destination sequence number */

nd_ipv4rrep_oa;/* originator IPv4 address */

nd_uint32_trrep_life;/* lifetime of this route */

};

struct aodv_rrep6 {

nd_uint8_trrep_type;/* AODV message type (2) */

nd_uint8_trrep_flags;/* various flags */

nd_uint8_trrep_ps;/* prefix size */

nd_uint8_trrep_hops;/* number of hops from o to d */

nd_ipv6rrep_da;/* destination IPv6 address */

nd_uint32_trrep_ds;/* destination sequence number */

nd_ipv6rrep_oa;/* originator IPv6 address */

nd_uint32_trrep_life;/* lifetime of this route */

};

struct aodv_rrep6_draft_01 {

nd_uint8_trrep_type;/* AODV message type (17) */

nd_uint8_trrep_flags;/* various flags */

nd_uint8_trrep_ps;/* prefix size */

nd_uint8_trrep_hops;/* number of hops from o to d */

nd_uint32_trrep_ds;/* destination sequence number */

nd_ipv6rrep_da;/* destination IPv6 address */

nd_ipv6rrep_oa;/* originator IPv6 address */

nd_uint32_trrep_life;/* lifetime of this route */

};

#defineRREP_REPAIR0x80/* repair (reserved for multicast */

#defineRREP_ACK0x40/* acknowledgement required */

#defineRREP_FLAGS_MASK0xC0/* mask for rrep_flags */

#defineRREP_PREFIX_MASK0x1F/* mask for prefix size */

struct rerr_unreach {

nd_ipv4u_da;/* IPv4 address */

nd_uint32_tu_ds;/* sequence number */

};

struct rerr_unreach6 {

nd_ipv6u_da;/* IPv6 address */

nd_uint32_tu_ds;/* sequence number */

};

struct rerr_unreach6_draft_01 {

nd_ipv6u_da;/* IPv6 address */

nd_uint32_tu_ds;/* sequence number */

};

struct aodv_rerr {

nd_uint8_trerr_type;/* AODV message type (3 or 18) */

nd_uint8_trerr_flags;/* various flags */

nd_uint8_trerr_zero0;/* reserved, set to zero */

nd_uint8_trerr_dc;/* destination count */

};

#define RERR_NODELETE0x80/* don't delete the link */

#define RERR_FLAGS_MASK0x80/* mask for rerr_flags */

struct aodv_rrep_ack {

nd_uint8_tra_type;

nd_uint8_tra_zero0;

};

#defineAODV_RREQ1/* route request */

#defineAODV_RREP2/* route response */

#defineAODV_RERR3/* error report */

#defineAODV_RREP_ACK4/* route response acknowledgement */

#define AODV_V6_DRAFT_01_RREQ16/* IPv6 route request */

#define AODV_V6_DRAFT_01_RREP17/* IPv6 route response */

#define AODV_V6_DRAFT_01_RERR18/* IPv6 error report */

#define AODV_V6_DRAFT_01_RREP_ACK19/* IPV6 route response acknowledgment */

struct aodv_ext {

nd_uint8_ttype;/* extension type */

nd_uint8_tlength;/* extension length */

};

struct aodv_hello {

structaodv_exteh;/* extension header */

nd_uint32_tinterval;/* expect my next hello in

* (n) ms

* NOTE: this is not aligned */

};

#defineAODV_EXT_HELLO1

static void

aodv_extension(netdissect_options *ndo,

const struct aodv_ext *ep, u_int length)

{

const struct aodv_hello *ah;

ND_TCHECK_SIZE(ep);

switch (GET_U_1(ep->type)) {

case AODV_EXT_HELLO:

ah = (const struct aodv_hello *)(const void *)ep;

ND_TCHECK_SIZE(ah);

if (length < sizeof(struct aodv_hello))

goto trunc;

if (GET_U_1(ep->length) < 4) {

ND_PRINT("\n\text HELLO - bad length %u",

GET_U_1(ep->length));

break;

}

ND_PRINT("\n\text HELLO %u ms",

GET_BE_U_4(ah->interval));

break;

default:

ND_PRINT("\n\text %u %u", GET_U_1(ep->type),

GET_U_1(ep->length));

break;

}

return;

trunc:

nd_print_trunc(ndo);

}

static void

aodv_rreq(netdissect_options *ndo, const u_char *dat, u_int length)

{

u_int i;

const struct aodv_rreq *ap = (const struct aodv_rreq *)dat;

ND_TCHECK_SIZE(ap);

if (length < sizeof(*ap))

goto trunc;

ND_PRINT(" rreq %u %s%s%s%s%shops %u id 0x%08x\n"

"\tdst %s seq %u src %s seq %u", length,

GET_U_1(ap->rreq_type) & RREQ_JOIN ? "[J]" : "",

GET_U_1(ap->rreq_type) & RREQ_REPAIR ? "[R]" : "",

GET_U_1(ap->rreq_type) & RREQ_GRAT ? "[G]" : "",

GET_U_1(ap->rreq_type) & RREQ_DEST ? "[D]" : "",

GET_U_1(ap->rreq_type) & RREQ_UNKNOWN ? "[U] " : " ",

GET_U_1(ap->rreq_hops),

GET_BE_U_4(ap->rreq_id),

GET_IPADDR_STRING(ap->rreq_da),

GET_BE_U_4(ap->rreq_ds),

GET_IPADDR_STRING(ap->rreq_oa),

GET_BE_U_4(ap->rreq_os));

i = length - sizeof(*ap);

if (i >= sizeof(struct aodv_ext))

aodv_extension(ndo, (const struct aodv_ext *)(dat + sizeof(*ap)), i);

return;

trunc:

nd_print_trunc(ndo);

}

static void

aodv_rrep(netdissect_options *ndo, const u_char *dat, u_int length)

{

u_int i;

const struct aodv_rrep *ap = (const struct aodv_rrep *)dat;

ND_TCHECK_SIZE(ap);

if (length < sizeof(*ap))

goto trunc;

ND_PRINT(" rrep %u %s%sprefix %u hops %u\n"

"\tdst %s dseq %u src %s %u ms", length,

GET_U_1(ap->rrep_type) & RREP_REPAIR ? "[R]" : "",

GET_U_1(ap->rrep_type) & RREP_ACK ? "[A] " : " ",

GET_U_1(ap->rrep_ps) & RREP_PREFIX_MASK,

GET_U_1(ap->rrep_hops),

GET_IPADDR_STRING(ap->rrep_da),

GET_BE_U_4(ap->rrep_ds),

GET_IPADDR_STRING(ap->rrep_oa),

GET_BE_U_4(ap->rrep_life));

i = length - sizeof(*ap);

if (i >= sizeof(struct aodv_ext))

aodv_extension(ndo, (const struct aodv_ext *)(dat + sizeof(*ap)), i);

return;

trunc:

nd_print_trunc(ndo);

}

static void

aodv_rerr(netdissect_options *ndo, const u_char *dat, u_int length)

{

u_int i, dc;

const struct aodv_rerr *ap = (const struct aodv_rerr *)dat;

const struct rerr_unreach *dp;

ND_TCHECK_SIZE(ap);

if (length < sizeof(*ap))

goto trunc;

ND_PRINT(" rerr %s [items %u] [%u]:",

GET_U_1(ap->rerr_flags) & RERR_NODELETE ? "[D]" : "",

GET_U_1(ap->rerr_dc), length);

dp = (const struct rerr_unreach *)(dat + sizeof(*ap));

i = length - sizeof(*ap);

for (dc = GET_U_1(ap->rerr_dc); dc != 0; dc--) {

ND_TCHECK_SIZE(dp);

if (i < sizeof(*dp))

goto trunc;

ND_PRINT(" {%s}(%u)", GET_IPADDR_STRING(dp->u_da),

GET_BE_U_4(dp->u_ds));

dp++;

i -= sizeof(*dp);

}

return;

trunc:

nd_print_trunc(ndo);

}

static void

aodv_v6_rreq(netdissect_options *ndo, const u_char *dat, u_int length)

{

u_int i;

const struct aodv_rreq6 *ap = (const struct aodv_rreq6 *)dat;

ND_TCHECK_SIZE(ap);

if (length < sizeof(*ap))

goto trunc;

ND_PRINT(" v6 rreq %u %s%s%s%s%shops %u id 0x%08x\n"

"\tdst %s seq %u src %s seq %u", length,

GET_U_1(ap->rreq_type) & RREQ_JOIN ? "[J]" : "",

GET_U_1(ap->rreq_type) & RREQ_REPAIR ? "[R]" : "",

GET_U_1(ap->rreq_type) & RREQ_GRAT ? "[G]" : "",

GET_U_1(ap->rreq_type) & RREQ_DEST ? "[D]" : "",

GET_U_1(ap->rreq_type) & RREQ_UNKNOWN ? "[U] " : " ",

GET_U_1(ap->rreq_hops),

GET_BE_U_4(ap->rreq_id),

GET_IP6ADDR_STRING(ap->rreq_da),

GET_BE_U_4(ap->rreq_ds),

GET_IP6ADDR_STRING(ap->rreq_oa),

GET_BE_U_4(ap->rreq_os));

i = length - sizeof(*ap);

if (i >= sizeof(struct aodv_ext))

aodv_extension(ndo, (const struct aodv_ext *)(dat + sizeof(*ap)), i);

return;

trunc:

nd_print_trunc(ndo);

}

static void

aodv_v6_rrep(netdissect_options *ndo, const u_char *dat, u_int length)

{

u_int i;

const struct aodv_rrep6 *ap = (const struct aodv_rrep6 *)dat;

ND_TCHECK_SIZE(ap);

if (length < sizeof(*ap))

goto trunc;

ND_PRINT(" rrep %u %s%sprefix %u hops %u\n"

"\tdst %s dseq %u src %s %u ms", length,

GET_U_1(ap->rrep_type) & RREP_REPAIR ? "[R]" : "",

GET_U_1(ap->rrep_type) & RREP_ACK ? "[A] " : " ",

GET_U_1(ap->rrep_ps) & RREP_PREFIX_MASK,

GET_U_1(ap->rrep_hops),

GET_IP6ADDR_STRING(ap->rrep_da),

GET_BE_U_4(ap->rrep_ds),

GET_IP6ADDR_STRING(ap->rrep_oa),

GET_BE_U_4(ap->rrep_life));

i = length - sizeof(*ap);

if (i >= sizeof(struct aodv_ext))

aodv_extension(ndo, (const struct aodv_ext *)(dat + sizeof(*ap)), i);

return;

trunc:

nd_print_trunc(ndo);

}

static void

aodv_v6_rerr(netdissect_options *ndo, const u_char *dat, u_int length)

{

u_int i, dc;

const struct aodv_rerr *ap = (const struct aodv_rerr *)dat;

const struct rerr_unreach6 *dp6;

ND_TCHECK_SIZE(ap);

if (length < sizeof(*ap))

goto trunc;

ND_PRINT(" rerr %s [items %u] [%u]:",

GET_U_1(ap->rerr_flags) & RERR_NODELETE ? "[D]" : "",

GET_U_1(ap->rerr_dc), length);

dp6 = (const struct rerr_unreach6 *)(const void *)(ap + 1);

i = length - sizeof(*ap);

for (dc = GET_U_1(ap->rerr_dc); dc != 0; dc--) {

ND_TCHECK_SIZE(dp6);

if (i < sizeof(*dp6))

goto trunc;

ND_PRINT(" {%s}(%u)", GET_IP6ADDR_STRING(dp6->u_da),

GET_BE_U_4(dp6->u_ds));

dp6++;

i -= sizeof(*dp6);

}

return;

trunc:

nd_print_trunc(ndo);

}

static void

aodv_v6_draft_01_rreq(netdissect_options *ndo, const u_char *dat, u_int length)

{

u_int i;

const struct aodv_rreq6_draft_01 *ap = (const struct aodv_rreq6_draft_01 *)dat;

ND_TCHECK_SIZE(ap);

if (length < sizeof(*ap))

goto trunc;

ND_PRINT(" rreq %u %s%s%s%s%shops %u id 0x%08x\n"

"\tdst %s seq %u src %s seq %u", length,

GET_U_1(ap->rreq_type) & RREQ_JOIN ? "[J]" : "",

GET_U_1(ap->rreq_type) & RREQ_REPAIR ? "[R]" : "",

GET_U_1(ap->rreq_type) & RREQ_GRAT ? "[G]" : "",

GET_U_1(ap->rreq_type) & RREQ_DEST ? "[D]" : "",

GET_U_1(ap->rreq_type) & RREQ_UNKNOWN ? "[U] " : " ",

GET_U_1(ap->rreq_hops),

GET_BE_U_4(ap->rreq_id),

GET_IP6ADDR_STRING(ap->rreq_da),

GET_BE_U_4(ap->rreq_ds),

GET_IP6ADDR_STRING(ap->rreq_oa),

GET_BE_U_4(ap->rreq_os));

i = length - sizeof(*ap);

if (i >= sizeof(struct aodv_ext))

aodv_extension(ndo, (const struct aodv_ext *)(dat + sizeof(*ap)), i);

return;

trunc:

nd_print_trunc(ndo);

}

static void

aodv_v6_draft_01_rrep(netdissect_options *ndo, const u_char *dat, u_int length)

{

u_int i;

const struct aodv_rrep6_draft_01 *ap = (const struct aodv_rrep6_draft_01 *)dat;

ND_TCHECK_SIZE(ap);

if (length < sizeof(*ap))

goto trunc;

ND_PRINT(" rrep %u %s%sprefix %u hops %u\n"

"\tdst %s dseq %u src %s %u ms", length,

GET_U_1(ap->rrep_type) & RREP_REPAIR ? "[R]" : "",

GET_U_1(ap->rrep_type) & RREP_ACK ? "[A] " : " ",

GET_U_1(ap->rrep_ps) & RREP_PREFIX_MASK,

GET_U_1(ap->rrep_hops),

GET_IP6ADDR_STRING(ap->rrep_da),

GET_BE_U_4(ap->rrep_ds),

GET_IP6ADDR_STRING(ap->rrep_oa),

GET_BE_U_4(ap->rrep_life));

i = length - sizeof(*ap);

if (i >= sizeof(struct aodv_ext))

aodv_extension(ndo, (const struct aodv_ext *)(dat + sizeof(*ap)), i);

return;

trunc:

nd_print_trunc(ndo);

}

static void

aodv_v6_draft_01_rerr(netdissect_options *ndo, const u_char *dat, u_int length)

{

u_int i, dc;

const struct aodv_rerr *ap = (const struct aodv_rerr *)dat;

const struct rerr_unreach6_draft_01 *dp6;

ND_TCHECK_SIZE(ap);

if (length < sizeof(*ap))

goto trunc;

ND_PRINT(" rerr %s [items %u] [%u]:",

GET_U_1(ap->rerr_flags) & RERR_NODELETE ? "[D]" : "",

GET_U_1(ap->rerr_dc), length);

dp6 = (const struct rerr_unreach6_draft_01 *)(const void *)(ap + 1);

i = length - sizeof(*ap);

for (dc = GET_U_1(ap->rerr_dc); dc != 0; dc--) {

ND_TCHECK_SIZE(dp6);

if (i < sizeof(*dp6))

goto trunc;

ND_PRINT(" {%s}(%u)", GET_IP6ADDR_STRING(dp6->u_da),

GET_BE_U_4(dp6->u_ds));

dp6++;

i -= sizeof(*dp6);

}

return;

trunc:

nd_print_trunc(ndo);

}

void

aodv_print(netdissect_options *ndo,

const u_char *dat, u_int length, int is_ip6)

{

uint8_t msg_type;

ndo->ndo_protocol = "aodv";

/*

* The message type is the first byte; make sure we have it

* and then fetch it.

*/

ND_TCHECK_1(dat);

msg_type = GET_U_1(dat);

ND_PRINT(" aodv");

switch (msg_type) {

case AODV_RREQ:

if (is_ip6)

aodv_v6_rreq(ndo, dat, length);

else

aodv_rreq(ndo, dat, length);

break;

case AODV_RREP:

if (is_ip6)

aodv_v6_rrep(ndo, dat, length);

else

aodv_rrep(ndo, dat, length);

break;

case AODV_RERR:

if (is_ip6)

aodv_v6_rerr(ndo, dat, length);

else

aodv_rerr(ndo, dat, length);

break;

case AODV_RREP_ACK:

ND_PRINT(" rrep-ack %u", length);

break;

case AODV_V6_DRAFT_01_RREQ:

aodv_v6_draft_01_rreq(ndo, dat, length);

break;

case AODV_V6_DRAFT_01_RREP:

aodv_v6_draft_01_rrep(ndo, dat, length);

break;

case AODV_V6_DRAFT_01_RERR:

aodv_v6_draft_01_rerr(ndo, dat, length);

break;

case AODV_V6_DRAFT_01_RREP_ACK:

ND_PRINT(" rrep-ack %u", length);

break;

default:

ND_PRINT(" type %u %u", msg_type, length);

}

return;

trunc:

nd_print_trunc(ndo);

}

一键复制

编辑

Web IDE

原始数据

按行查看

历史

太閤秀吉
关注
C语言编写的aodv
05-12
C语言编写的aodv-uu-0.9.6,可用于路由代码的学习
AODV源代码
07-28
完整的AODV协议代码，包括头文件，main.c和Makefile文件等。
c语言aodv源码下载,kernel-aodv_v2.2
weixin_42513038的博客
05-19 169
kernel-aodv_v2.2.2..................\aodv.h..................\aodv_dev.c..................\aodv_dev.h..................\aodv_neigh.c..................\aodv_neigh.h..................\aodv_route.c.........
AODV的C程序
10-18
AODV路协议的C程序实现，按需路由的发现，路由建立，路由维护
aodv协议C语言代码,AODV协议的运行方式
weixin_29729247的博客
05-22 384
这也是一个网管必须具备的知识。那么在前面的文章中，我们已经对AODV协议的基础内容作了介绍，在这里我们主要讲解一下它的运行方式。(a)AODV路由发现AODV路由协议是一种典型的按需驱动路由协议,该算法可被称为纯粹的需求路由获取系统,那些不在活跃路径上的节点不会维持任何相关路由信息,也不会参与任何周期路由表的交换?此外,节点没有必要去发现和维持到另一节点的路由,除非这两个节点需要进行通信?移动节点...
aodv-uu-0.9.6.zip_AODV协议代码_aodv_aodv-uu-0.9.6_www.9uu.com大二
最新发布
09-23
AODV（Ad hoc On-Demand Distance Vector）协议是一种用于移动自组织网络（MANETs）的路由协议。它的设计目标是提供一个高效、可靠且适用于动态网络环境的路由方案。在MANETs中，节点间没有固定的基础设施，每个设备...
aodv-uu-0.9.6.tar.gz_AODV UU_aodv-uu-0.9.6.tar.gz_patch aodv uu
09-21
首先，他们需要解压下载的tar.gz文件，通常使用`tar -zxvf aodv-uu-0.9.6.tar.gz`命令。然后，用户将进入解压后的目录，并按照提供的README文件或INSTALL文件中的指示进行编译和安装。这可能涉及配置选项的选择，如`...
aodv-examples-06.17.tar.gz_aodv_aodv-ns2_ns2
09-21
标题 "aodv-examples-06.17.tar.gz_aodv_aodv-ns2_ns2" 提供的信息表明这是一个与AODV路由协议相关的模拟实例，使用了NS-2（网络模拟器2）工具。这个压缩包很可能是为教学或研究目的设计的一系列示例，帮助用户理解...
aodv-uu-0.9.3.tar.gz_AODV-UU-0.93_aodv_aodv ns_aodv-uu_ns aodv
09-20
在Ns-2中使用AODV-UU，首先需要下载解压aodv-uu-0.9.3.tar.gz文件，然后按照以下步骤进行编译： - 安装Ns-2：确保已经正确安装了Ns-2环境，这通常包括安装Tcl/Tk和otcl库。 - 解压文件：`tar -zxvf aodv-uu-0.9.3....
AODV路由协议源代码
05-08
aodv源代码,经典的按需路由协议 linux
aodv源码解析
10-23
对于需要研究aodv协议的人，有很大的帮助
AODV源码分析TXT文档
03-29
AODVA代码分析，讲的很清楚，供初学者参考。希望大家能够多多交流。。
AODV代码详细注释
10-25
AODV源代码的底层C++协议的详细注释，对掌握理解AODV协议有很大的帮助。
aodv-uu-0.8.tar.gz_AODV protocol_AODV+_aodv-uu-0.8_uu_uu aodv
09-23
AODV（Ad hoc On-Demand Distance Vector）路由协议是一种为移动自组织网络（MANETs）设计的路由协议。这种协议的特点在于它不需要预先建立路由表，而是按需动态地构建路由，从而节省了网络资源。AODV-uu-0.8是AODV...
aodv协议C语言代码,AODV协议入门必读
weixin_39616693的博客
05-22 410
在无线网络中，一些协议与命令与传统网络并不相同。所以我们要与之区分开来。尤其是在路由协议方面，更有着许多差异。例如我们接下来将要讲到的AODV协议。这个协议时在无线Ad hoc网络中所使用的路由选择协。它能够实现单播和多播路由｡该协议是Ad Hoc网络中按需生成路由方式的典型协议｡AODV无线自组网按需平面距离矢量路由协议(Ad hoc On-Demand Distance Vector Rout...
aodv协议c语言实现,TinyOS在CC2530下的移植及AODV路由协议的实现
weixin_29359133的博客
05-22 473
摘要：首先介绍了以TI的无线传感器网络芯片CC2530为核心部件的节点硬件实现，接着介绍TinyOS操作系统的运行机制及其在CC2530平台下的移植过程；并在此基础上以nesC语言实现了AODV路由协议，最后对系统进行组网测试，测试结果表明平台各功能正常运行并且实现AODV协议的基本功能。关键词：无线传感器网络；TinyOS；CC2530；AODV0 引言无线传感器网络(Wireless Sens...
最新aodv源码
07-28
最新我无线网络路由协议源码，全部源码和协议包，支持ns-2.26,ns-2.27,ns-2.29,ns-2.32.包括: 2007-07-11 23:40 7,902 aodv_hello.c 2004-10-29 04:21 1,705 aodv_hello.h 2004-10-29 04:21 5,898 aodv_neighbor.c 2004-10-29 04:21 1,385 aodv_neighbor.h 2004-10-29 04:21 6,178 aodv_rerr.c 2006-02-01 04:28 2,416 aodv_rerr.h 2004-10-29 04:21 12,560 aodv_rrep.c 2006-02-01 04:28 2,692 aodv_rrep.h 2005-12-07 12:19 18,125 aodv_rreq.c 2006-02-01 04:28 3,429 aodv_rreq.h 2007-07-23 22:05 15,024 aodv_socket.c 2004-10-29 04:21 2,389 aodv_socket.h 2007-07-11 23:40 7,170 aodv_timeout.c 2003-05-23 07:11 1,519 aodv_timeout.h 2007-07-23 22:05 9,483 ChangeLog 2006-09-21 01:58 11,140 debug.c 2004-02-03 00:03 1,890 debug.h 2005-03-18 05:38 6,360 defs.h 2003-04-17 03:08 1,746 endian.c 2001-11-09 05:16 17,992 GPL 2004-10-29 04:21 1,842 list.c 2004-10-29 04:21 1,994 list.h 2005-03-18 05:34 10,128 llf.c 2004-06-01 17:09 1,070 llf.h 2008-07-28 09:48 lnx 2004-10-29 04:21 2,422 locality.c 2004-10-29 04:21 1,275 locality.h 2007-04-06 16:37 17,528 main.c 2006-09-26 15:31 6,685 Makefile 2007-07-11 23:40 14,294 nl.c 2007-07-11 23:40 1,420 nl.h 2008-07-28 09:48 ns 2004-10-29 04:21 2,859 params.h 2008-07-28 10:30 patches 2004-05-19 01:46 11,133 README 2004-03-31 21:56 15,077 README.ns 2004-02-03 22:45 90,356 rfc3561.txt 2007-07-11 23:40 15,389 routing_table.c 2005-03-18 05:34 3,941 routing_table.h 2004-10-29 04:21 2,926 seek_list.c 2004-10-29 04:21 2,054 seek_list.h 2008-07-28 12:55 0 sn.txt 200
C语言实现AODV路由协议
"这篇文章主要介绍了一个使用C语言实现的AODV路由协议程序。AODV（Ad hoc On-Demand Distance Vector）是一种适用于移动自组织网络（MANETs）的路由协议，它按照需求发现和建立路由，并进行路由维护。程序包含了对...
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值