set_aodv_param_defaults.c

/* Copyright 2008 Michael Marsh, University of Maryland.
 *
 * This file is part of pydtn.
 *
 * pydtn is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * pydtn is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with pydtn.  If not, see <http://www.gnu.org/licenses/>.
 *
 * The views and conclusions contained in the software and documentation
 * are those of the authors and should not be interpreted as representing
 * official policies, either expressed or implied, of the University
 * of Maryland.
 *
 * pydtn extends and embeds the Python interpreter, which is
 * Copyright 2001-2006 Python Software Foundation, All Rights Reserved,
 * and is released under the PSF License Agreement.
 *
 * RANLUX random number generation uses the Boost library,
 * Copyright 1994-2006 by various authors (details in individual files),
 * which is released under the Boost Software License, Version 1.0.
 */

#include "aodv.h"

void
set_aodv_param_defaults( aodv_state_t* state )
{
   state->params.node_traversal_time = 10;
   state->params.net_diameter        = 20;
   state->params.rreq_tries          = 3;
   state->params.rreq_ratelimit      = 10;
   state->params.rerr_ratelimit      = 10;
   state->params.hello_interval      = 1000;
   state->params.allowed_hello_loss  = 2;

   recompute_aodv_params( state );
}

void
recompute_aodv_params( aodv_state_t* state )
{
   aodv_parameters_t* p = &(state->params);

   p->net_traversal_time   = 2 * p->node_traversal_time * p->net_diameter;
   p->path_discovery_time  = 2 * p->net_traversal_time;
   p->active_route_timeout = 2 * p->net_traversal_time;
   p->delete_period        = 5 * p->net_traversal_time;
   p->next_hop_wait        = 2 * p->node_traversal_time;
   p->blacklist_timeout    = p->rreq_tries * p->net_traversal_time;
}

---