aodv_rtable.h

一个无线自组网aodv路由的扩展版---AOMDV（多径路由协议）。

/* The AODV code developed by the CMU/MONARCH group was optimized
 * and tuned by Samir Das and Mahesh Marina, University of Cincinnati. The 
 * work was partially done in Sun Microsystems.
 * 
 * The original CMU copyright is below. 
 */

/*
Copyright (c) 1997, 1998 Carnegie Mellon University.  All Rights
Reserved. 

Permission to use, copy, modify, and distribute this
software and its documentation is hereby granted (including for
commercial or for-profit use), provided that both the copyright notice
and this permission notice appear in all copies of the software,
derivative works, or modified versions, and any portions thereof, and
that both notices appear in supporting documentation, and that credit
is given to Carnegie Mellon University in all publications reporting
on direct or indirect use of this code or its derivatives.

ALL CODE, SOFTWARE, PROTOCOLS, AND ARCHITECTURES DEVELOPED BY THE CMU
MONARCH PROJECT ARE EXPERIMENTAL AND ARE KNOWN TO HAVE BUGS, SOME OF
WHICH MAY HAVE SERIOUS CONSEQUENCES. CARNEGIE MELLON PROVIDES THIS
SOFTWARE OR OTHER INTELLECTUAL PROPERTY IN ITS ``AS IS'' CONDITION,
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 CARNEGIE MELLON UNIVERSITY
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 OR
INTELLECTUAL PROPERTY, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
DAMAGE.

Carnegie Mellon encourages (but does not require) users of this
software or intellectual property to return any improvements or
extensions that they make, and to grant Carnegie Mellon the rights to
redistribute these changes without encumbrance.

*/

#ifndef __aodv_rtable_h__
#define __aodv_rtable_h__

#include <assert.h>
#include <sys/types.h>
#include <config.h>
#include <cmu/list.h>
#include <scheduler.h>

#define CURRENT_TIME    Scheduler::instance().clock()
#define INFINITY        0xff

/*
   AODV Neighbor Cache Entry
*/
class AODV_Neighbor {
        friend class AODV;
        friend class aodv_rt_entry;
 public:
        AODV_Neighbor(u_int32_t a) { nb_addr = a; }

 protected:
        LIST_ENTRY(AODV_Neighbor) nb_link;
        nsaddr_t        nb_addr;
        double          nb_expire;      // ALLOWED_HELLO_LOSS * HELLO_INTERVAL
};

LIST_HEAD(aodv_ncache, AODV_Neighbor);

#ifdef AOMDV
/*
   AODV Path list data structure
*/
class AODV_Path {
        friend class AODV;
        friend class aodv_rt_entry;
 public:
        AODV_Path(nsaddr_t nh, u_int16_t h, double expire_time, nsaddr_t lh=0) { 
		nexthop = nh;
	       	hopcount = h;
		expire = expire_time;
	       	ts = Scheduler::instance().clock();
		lasthop = lh;
		// CHANGE
		error = false;
		// CHANGE
		
       	}

 protected:
        LIST_ENTRY(AODV_Path) path_link;
        nsaddr_t        nexthop;		// nexthop address
        u_int16_t       hopcount;	// hopcount through this nexthop
	double		expire;		// expiration timeout
        double		ts;		// time when we saw this nexthop
        nsaddr_t        lasthop;		// lasthop address
	// CHANGE
	bool		error;
	// CHANGE
};

LIST_HEAD(aodv_paths, AODV_Path);
#endif // AOMDV

/*
   AODV Precursor list data structure
*/
class AODV_Precursor {
        friend class AODV;
        friend class aodv_rt_entry;
 public:
        AODV_Precursor(u_int32_t a) { pc_addr = a; }

 protected:
        LIST_ENTRY(AODV_Precursor) pc_link;
        nsaddr_t        pc_addr;	// precursor address
};

LIST_HEAD(aodv_precursors, AODV_Precursor);


/*
  Route Table Entry
*/

class aodv_rt_entry {
        friend class aodv_rtable;
        friend class AODV;
	friend class LocalRepairTimer;
 public:
        aodv_rt_entry();
        ~aodv_rt_entry();

        void            nb_insert(nsaddr_t id);
        AODV_Neighbor*  nb_lookup(nsaddr_t id);

#ifdef AOMDV
        AODV_Path*      path_insert(nsaddr_t nexthop, u_int16_t hopcount, double expire_time, nsaddr_t lasthop=0);

        AODV_Path* 	path_lookup(nsaddr_t id);	// lookup path by nexthop

        AODV_Path* 	disjoint_path_lookup(nsaddr_t nexthop, nsaddr_t lasthop);
        bool	 	new_disjoint_path(nsaddr_t nexthop, nsaddr_t lasthop);

        AODV_Path* 	path_lookup_lasthop(nsaddr_t id);	// lookup path by lasthop
        void 		path_delete(nsaddr_t id);	// delete path by nexthop
        void 		path_delete(void);		// delete all paths
        void 		path_delete_longest(void);	// delete longest path
        bool 		path_empty(void);		// is the path list empty?
	AODV_Path*	path_find(void);		// find the path that we got first
	AODV_Path*	path_findMinHop(void);		// find the shortest path
	u_int16_t	path_get_max_hopcount(void);	
	u_int16_t	path_get_min_hopcount(void);	
	double 		path_get_max_expiration_time(void);	
	void		path_purge(void);
#endif // AOMDV

        void            pc_insert(nsaddr_t id);
        AODV_Precursor* pc_lookup(nsaddr_t id);
        void 		pc_delete(nsaddr_t id);
        void 		pc_delete(void);
        bool 		pc_empty(void);

        double          rt_req_timeout;         // when I can send another req
        u_int8_t        rt_req_cnt;             // number of route requests
	
 protected:
        LIST_ENTRY(aodv_rt_entry) rt_link;

        nsaddr_t        rt_dst;
        u_int32_t       rt_seqno;
	/* u_int8_t 	rt_interface; */

#ifndef AOMDV
        u_int16_t       rt_hops;       		// hop count
#else
        u_int16_t       rt_advertised_hops; 	// advertised hop count
#endif // AOMDV

	int 		rt_last_hop_count;	// last valid hop count

#ifndef AOMDV
        nsaddr_t        rt_nexthop;    		// next hop IP address
#else
        aodv_paths      rt_path_list;    	// list of paths
        u_int32_t       rt_highest_seqno_heard; 
	int 		rt_num_paths_;
#endif // AOMDV

	// CHANGE
	bool 		rt_error;
	// CHANGE

	/* list of precursors */ 
        aodv_precursors rt_pclist;
        double          rt_expire;     		// when entry expires
        u_int8_t        rt_flags;

#define RTF_DOWN 0
#define RTF_UP 1
#define RTF_IN_REPAIR 2

        /*
         *  Must receive 4 errors within 3 seconds in order to mark
         *  the route down.
        u_int8_t        rt_errors;      // error count
        double          rt_error_time;
#define MAX_RT_ERROR            4       // errors
#define MAX_RT_ERROR_TIME       3       // seconds
         */

#define MAX_HISTORY	3
	double 		rt_disc_latency[MAX_HISTORY];
	char 		hist_indx;
        int 		rt_req_last_ttl;        // last ttl value used
	// last few route discovery latencies
	// double 		rt_length [MAX_HISTORY];
	// last few route lengths

        /*
         * a list of neighbors that are using this route.
         */
        aodv_ncache          rt_nblist;
};


/*
  The Routing Table
*/

class aodv_rtable {
 public:
	aodv_rtable() { LIST_INIT(&rthead); }

        aodv_rt_entry*       head() { return rthead.lh_first; }

        aodv_rt_entry*       rt_add(nsaddr_t id);
        void                 rt_delete(nsaddr_t id);
        aodv_rt_entry*       rt_lookup(nsaddr_t id);

 private:
        LIST_HEAD(, aodv_rt_entry) rthead;
};

#endif /* _aodv__rtable_h__ */