geographic greedy forwarding
2016-08-23
0 0 0
no vote
Other
Earn points
There are several types of ad hoc routing protocols, such as proactive, reactive, geographic stateless routing, and so on. I believe geographic stateless routing is the simplest routing protocol to be implemented in ns2. Why it is the simplest? It is because the property of stateless indicates that no node in a network does not maintain any routing table. Note that we will still keep neighbors list at the routing component, but such information is available at logical link layer.
The purpose of this series is to learn how to implement a new routing protocol, thus we consider static networks where nodes are not move. The assumptions we hold for implementation include; 1) all nodes have its own geographic location (2-dimensional coordinates); 2) each node knows its neighbors location; and 3) a source node knows the ID and the location of the corresponding destination.
The geographic greedy forwarding protocol that we are going to implement works as follow.
On receiving a p
The purpose of this series is to learn how to implement a new routing protocol, thus we consider static networks where nodes are not move. The assumptions we hold for implementation include; 1) all nodes have its own geographic location (2-dimensional coordinates); 2) each node knows its neighbors location; and 3) a source node knows the ID and the location of the corresponding destination.
The geographic greedy forwarding protocol that we are going to implement works as follow.
On receiving a p
贪婪
转发
Related Source Codes
Computer networks route forwarding policy
1
0
no vote
Satellite communications, transparent forwarding f
2
0
no vote
OLSR protocol code
1
0
no vote
Tcl VANET code
0
0
no vote
Responsible for enhanced access control in Wireles
0
0
no vote
No comment