45 #include "net/routing/rpl-classic/rpl.h" 46 #include "net/routing/rpl-classic/rpl-private.h" 47 #include "net/nbr-table.h" 48 #include "net/link-stats.h" 52 #define LOG_MODULE "RPL" 53 #define LOG_LEVEL LOG_LEVEL_RPL 56 #define RANK_STRETCH 0 59 #define MIN_STEP_OF_RANK 1 60 #define MAX_STEP_OF_RANK 9 69 #define RPL_OF0_FIXED_SR 0 70 #define RPL_OF0_ETX_BASED_SR 1 72 #ifdef RPL_OF0_CONF_SR 73 #define RPL_OF0_SR RPL_OF0_CONF_SR 75 #define RPL_OF0_SR RPL_OF0_ETX_BASED_SR 79 #define STEP_OF_RANK(p) (3) 82 #if RPL_OF0_ETX_BASED_SR 85 #define STEP_OF_RANK(p) (((3 * parent_link_metric(p)) / LINK_STATS_ETX_DIVISOR) - 2) 92 LOG_INFO(
"Reset OF0\n");
97 dao_ack_callback(rpl_parent_t *p,
int status)
99 if(status == RPL_DAO_ACK_UNABLE_TO_ADD_ROUTE_AT_ROOT) {
103 LOG_DBG(
"OF0 - DAO ACK received with status: %d\n", status);
104 if(status >= RPL_DAO_ACK_UNABLE_TO_ACCEPT) {
106 link_stats_packet_sent(rpl_get_parent_lladdr(p),
MAC_TX_OK, 10);
107 }
else if(status == RPL_DAO_ACK_TIMEOUT) {
109 link_stats_packet_sent(rpl_get_parent_lladdr(p),
MAC_TX_OK, 10);
115 parent_link_metric(rpl_parent_t *p)
118 const struct link_stats *stats = rpl_get_parent_link_stats(p);
119 return stats != NULL ? stats->etx : 0xffff;
123 parent_rank_increase(rpl_parent_t *p)
125 uint16_t min_hoprankinc;
126 if(p == NULL || p->dag == NULL || p->dag->instance == NULL) {
127 return RPL_INFINITE_RANK;
129 min_hoprankinc = p->dag->instance->min_hoprankinc;
130 return (RANK_FACTOR * STEP_OF_RANK(p) + RANK_STRETCH) * min_hoprankinc;
134 parent_path_cost(rpl_parent_t *p)
140 return MIN((uint32_t)p->rank + parent_link_metric(p), 0xffff);
144 rank_via_parent(rpl_parent_t *p)
147 return RPL_INFINITE_RANK;
149 return MIN((uint32_t)p->rank + parent_rank_increase(p), RPL_INFINITE_RANK);
154 parent_is_acceptable(rpl_parent_t *p)
156 return STEP_OF_RANK(p) >= MIN_STEP_OF_RANK
157 && STEP_OF_RANK(p) <= MAX_STEP_OF_RANK;
161 parent_has_usable_link(rpl_parent_t *p)
163 return parent_is_acceptable(p);
166 static rpl_parent_t *
167 best_parent(rpl_parent_t *p1, rpl_parent_t *p2)
172 int p1_is_acceptable;
173 int p2_is_acceptable;
175 p1_is_acceptable = p1 != NULL && parent_is_acceptable(p1);
176 p2_is_acceptable = p2 != NULL && parent_is_acceptable(p2);
178 if(!p1_is_acceptable) {
179 return p2_is_acceptable ? p2 : NULL;
181 if(!p2_is_acceptable) {
182 return p1_is_acceptable ? p1 : NULL;
186 p1_cost = parent_path_cost(p1);
187 p2_cost = parent_path_cost(p2);
190 if(p1_cost != p2_cost) {
192 return p1_cost < p2_cost ? p1 : p2;
196 if(p1 == dag->preferred_parent || p2 == dag->preferred_parent) {
197 return dag->preferred_parent;
201 return parent_link_metric(p1) < parent_link_metric(p2) ? p1 : p2;
208 if(d1->grounded != d2->grounded) {
209 return d1->grounded ? d1 : d2;
212 if(d1->preference != d2->preference) {
213 return d1->preference > d2->preference ? d1 : d2;
216 return d1->rank < d2->rank ? d1 : d2;
222 instance->mc.type = RPL_DAG_MC_NONE;
231 parent_has_usable_link,
236 update_metric_container,
The MAC layer transmission was OK.
API for RPL objective functions (OF)
Header file for the logging system