|
NETWORK ATTACKS FRAMEWORK
1.0.0
A NETwork Attacks framework. Making network attacks impact evaluation easier!
|
|
NETWORK ATTACKS FRAMEWORK
1.0.0
A NETwork Attacks framework. Making network attacks impact evaluation easier!
|
Go to the source code of this file.
Classes | |
| struct | RERR_udest |
| struct | RERR |
Defines | |
| #define | RERR_NODELETE 0x1 |
| #define | RERR_UDEST_SIZE sizeof(RERR_udest) |
| #define | RERR_SIZE sizeof(RERR) |
| #define | RERR_CALC_SIZE(rerr) (RERR_SIZE + (rerr->dest_count-1)*RERR_UDEST_SIZE) |
| #define | RERR_UDEST_FIRST(rerr) ((RERR_udest *)&rerr->dest_addr) |
| #define | RERR_UDEST_NEXT(udest) ((RERR_udest *)((char *)udest + RERR_UDEST_SIZE)) |
Functions | |
| RERR * | rerr_create (u_int8_t flags, struct in_addr dest_addr, u_int32_t dest_seqno) |
| void | rerr_add_udest (RERR *rerr, struct in_addr udest, u_int32_t udest_seqno) |
| void | rerr_process (RERR *rerr, int rerrlen, struct in_addr ip_src, struct in_addr ip_dst) |
| #define RERR_CALC_SIZE | ( | rerr | ) | (RERR_SIZE + (rerr->dest_count-1)*RERR_UDEST_SIZE) |
Definition at line 74 of file NA_aodv_rerr.h.
| #define RERR_NODELETE 0x1 |
Definition at line 43 of file NA_aodv_rerr.h.
Definition at line 71 of file NA_aodv_rerr.h.
| #define RERR_UDEST_FIRST | ( | rerr | ) | ((RERR_udest *)&rerr->dest_addr) |
Definition at line 75 of file NA_aodv_rerr.h.
| #define RERR_UDEST_NEXT | ( | udest | ) | ((RERR_udest *)((char *)udest + RERR_UDEST_SIZE)) |
Definition at line 76 of file NA_aodv_rerr.h.
| #define RERR_UDEST_SIZE sizeof(RERR_udest) |
Definition at line 52 of file NA_aodv_rerr.h.
| void rerr_add_udest | ( | RERR * | rerr, |
| struct in_addr | udest, | ||
| u_int32_t | udest_seqno | ||
| ) |
Definition at line 67 of file NA_aodv_rerr.cc.
{
#ifndef OMNETPP
RERR_udest *ud;
ud = (RERR_udest *) ((char *) rerr + RERR_CALC_SIZE(rerr));
ud->dest_addr = udest.s_addr;
ud->dest_seqno = htonl(udest_seqno);
rerr->dest_count++;
#else
rerr->addUdest( udest.s_addr, htonl(udest_seqno));
#endif
}
| RERR* rerr_create | ( | u_int8_t | flags, |
| struct in_addr | dest_addr, | ||
| u_int32_t | dest_seqno | ||
| ) |
Definition at line 43 of file NA_aodv_rerr.cc.
{
RERR *rerr;
DEBUG(LOG_DEBUG, 0, "Assembling RERR about %s seqno=%d",
ip_to_str(dest_addr), dest_seqno);
#ifndef OMNETPP
rerr = (RERR *) aodv_socket_new_msg();
rerr->dest_addr = dest_addr.s_addr;
rerr->dest_seqno = htonl(dest_seqno);
#else
rerr = new RERR("RouteError");
rerr->addUdest (dest_addr.s_addr,htonl(dest_seqno));
totalRerrSend++;
#endif
rerr->type = AODV_RERR;
rerr->n = (flags & RERR_NODELETE ? 1 : 0);
rerr->res1 = 0;
rerr->res2 = 0;
rerr->dest_count = 1;
return rerr;
}
| void rerr_process | ( | RERR * | rerr, |
| int | rerrlen, | ||
| struct in_addr | ip_src, | ||
| struct in_addr | ip_dst | ||
| ) |
Definition at line 82 of file NA_aodv_rerr.cc.
{
RERR *new_rerr = NULL;
RERR_udest *udest;
rt_table_t *rt;
u_int32_t rerr_dest_seqno;
struct in_addr udest_addr, rerr_unicast_dest;
int i;
int numInterfaces;
rerr_unicast_dest.s_addr = ManetAddress::ZERO;
DEBUG(LOG_DEBUG, 0, "ip_src=%s", ip_to_str(ip_src));
log_pkt_fields((AODV_msg *) rerr);
if (rerrlen < ((int) RERR_CALC_SIZE(rerr)))
{
alog(LOG_WARNING, 0, __FUNCTION__,
"IP data too short (%u bytes) from %s to %s. Should be %d bytes.",
rerrlen, ip_to_str(ip_src), ip_to_str(ip_dst),
RERR_CALC_SIZE(rerr));
return;
}
#ifdef OMNETPP
totalRerrRec++;
#endif
/* Check which destinations that are unreachable. */
udest = RERR_UDEST_FIRST(rerr);
while (rerr->dest_count)
{
udest_addr.s_addr = udest->dest_addr;
rerr_dest_seqno = ntohl(udest->dest_seqno);
DEBUG(LOG_DEBUG, 0, "unreachable dest=%s seqno=%lu",
ip_to_str(udest_addr), rerr_dest_seqno);
rt = rt_table_find(udest_addr);
if (rt && rt->state == VALID && rt->next_hop.s_addr == ip_src.s_addr)
{
/* Checking sequence numbers here is an out of draft
* * addition to AODV-UU. It is here because it makes a lot
* * of sense... */
if (0 && (int32_t) rt->dest_seqno > (int32_t) rerr_dest_seqno)
{
DEBUG(LOG_DEBUG, 0, "Udest ignored because of seqno");
udest = RERR_UDEST_NEXT(udest);
rerr->dest_count--;
continue;
}
DEBUG(LOG_DEBUG, 0, "removing rte %s - WAS IN RERR!!",
ip_to_str(udest_addr));
#ifdef NS_PORT
#ifndef OMNETPP
interfaceQueue((nsaddr_t) udest_addr.s_addr, IFQ_DROP_BY_DEST);
#endif
#endif
/* Invalidate route: */
if (!rerr->n)
{
rt_table_invalidate(rt);
}
/* (a) updates the corresponding destination sequence number
* with the Destination Sequence Number in the packet, and */
rt->dest_seqno = rerr_dest_seqno;
/* (d) check precursor list for emptiness. If not empty, include
* the destination as an unreachable destination in the
* RERR... */
if (rt->nprec && !(rt->flags & RT_REPAIR))
{
if (!new_rerr)
{
u_int8_t flags = 0;
if (rerr->n)
flags |= RERR_NODELETE;
new_rerr = rerr_create(flags, rt->dest_addr,
rt->dest_seqno);
DEBUG(LOG_DEBUG, 0, "Added %s as unreachable, seqno=%lu",
ip_to_str(rt->dest_addr), rt->dest_seqno);
#ifdef AODV_USE_STL_RT
if (rt->nprec == 1)
rerr_unicast_dest = rt->precursors[0].neighbor;
#else
if (rt->nprec == 1)
rerr_unicast_dest =
FIRST_PREC(rt->precursors)->neighbor;
#endif
}
else
{
/* Decide whether new precursors make this a non unicast RERR */
rerr_add_udest(new_rerr, rt->dest_addr, rt->dest_seqno);
DEBUG(LOG_DEBUG, 0, "Added %s as unreachable, seqno=%lu",
ip_to_str(rt->dest_addr), rt->dest_seqno);
#ifdef AODV_USE_STL_RT
if (rerr_unicast_dest.s_addr.isUnspecified())
{
for (unsigned int i = 0; i< rt->precursors.size(); i++)
{
precursor_t *pr = & rt->precursors[i];
if (pr->neighbor.s_addr != rerr_unicast_dest.s_addr)
{
rerr_unicast_dest.s_addr = ManetAddress::ZERO;
break;
}
}
}
#else
if (rerr_unicast_dest.s_addr)
{
list_t *pos2;
list_foreach(pos2, &rt->precursors)
{
precursor_t *pr = (precursor_t *) pos2;
if (pr->neighbor.s_addr != rerr_unicast_dest.s_addr)
{
rerr_unicast_dest.s_addr = 0;
break;
}
}
}
#endif
}
}
else
{
DEBUG(LOG_DEBUG, 0,
"Not sending RERR, no precursors or route in RT_REPAIR");
}
/* We should delete the precursor list for all unreachable
* destinations. */
if (rt->state == INVALID)
precursor_list_destroy(rt);
}
else
{
DEBUG(LOG_DEBUG, 0, "Ignoring UDEST %s", ip_to_str(udest_addr));
}
udest = RERR_UDEST_NEXT(udest);
rerr->dest_count--;
} /* End while() */
#ifdef OMNETPP
if (rerr->dest_count==0)
rerr->clearUdest();
#endif
/* If a RERR was created, then send it now... */
if (new_rerr)
{
rt = rt_table_find(rerr_unicast_dest);
new_rerr->ttl=1;
if (rt && new_rerr->dest_count == 1 && !rerr_unicast_dest.s_addr.isUnspecified())
aodv_socket_send((AODV_msg *) new_rerr,
rerr_unicast_dest,
RERR_CALC_SIZE(new_rerr), 1,
&DEV_IFINDEX(rt->ifindex));
else if (new_rerr->dest_count > 0)
{
/* FIXME: Should only transmit RERR on those interfaces
* which have precursor nodes for the broken route */
numInterfaces = 0;
for (i = 0; i < MAX_NR_INTERFACES; i++)
{
if (!DEV_NR(i).enabled)
continue;
numInterfaces++;
}
for (i = 0; i < MAX_NR_INTERFACES; i++)
{
struct in_addr dest;
if (!DEV_NR(i).enabled)
continue;
dest.s_addr = ManetAddress(IPv4Address(AODV_BROADCAST));
#ifdef OMNETPP
if (numInterfaces>1)
{
aodv_socket_send((AODV_msg *) new_rerr->dup(), dest,RERR_CALC_SIZE(new_rerr), 1, &DEV_NR(i));
}
else
#endif
aodv_socket_send((AODV_msg *) new_rerr, dest,RERR_CALC_SIZE(new_rerr), 1, &DEV_NR(i));
numInterfaces--;
}
}
}
}
1.7.6.1