rpl-dag.c File Reference

Logic for Directed Acyclic Graphs in RPL. More...

#include "contiki.h"
#include "net/link-stats.h"
#include "net/routing/rpl-classic/rpl.h"
#include "net/routing/rpl-classic/rpl-private.h"
#include "net/routing/rpl-classic/rpl-dag-root.h"
#include "net/ipv6/uip.h"
#include "net/ipv6/uip-nd6.h"
#include "net/ipv6/uip-ds6-nbr.h"
#include "net/nbr-table.h"
#include "net/ipv6/multicast/uip-mcast6.h"
#include "lib/list.h"
#include "lib/memb.h"
#include "sys/ctimer.h"
#include "sys/log.h"
#include <limits.h>
#include <string.h>

Go to the source code of this file.

Functions
int	rpl_has_joined (void)
	Tells whether the node has joined a network or not.
int	rpl_has_downward_route (void)
	Get the RPL's best guess on if we have downward route or not.

Detailed Description

Logic for Directed Acyclic Graphs in RPL.

Author

Joakim Eriksson joaki.nosp@m.me@s.nosp@m.ics.s.nosp@m.e, Nicolas Tsiftes nvt@s.nosp@m.ics..nosp@m.se Contributors: George Oikonomou oikon.nosp@m.omou.nosp@m.@user.nosp@m.s.so.nosp@m.urcef.nosp@m.orge.nosp@m..net (multicast)

Definition in file rpl-dag.c.