Thomas Kunz
 Systems and Computer Engineering
8
Prediction Algorithm
lBasic Idea:
uPredict the link breakage time (prediction algorithm)
uRebuild a route before link breaks (pro-active route maintenance)
lPrediction Algorithm
uMonitor unicast packets from neighboring nodes
uUsing signal power strength to predict the link breakage time
node A
node B
V
d
0
t
2
t
3
t
q
Our solution is divided into two parts: first use the reception signal power strength which from neighboring node to predict the link breakage time, we call it prediction algorithm.
   Second, in the routing protocol, when one link is going to break based on the prediction, a message is sent to the source, source node can rebuild a new route before the route breaks, then the packet won’t be dropped.

In prediction algorithm, a node only monitors unicast packets from neighboring nodes. Because nodes are not move totally randomly. In our simulation model, a node will move to a randomly selected destination at a constant speed which is also randomly picked. After arrive the destination, it will stop for a pause time, then move to another randomly selected destination.

In the graph, node A and B are neighboring nodes in an active route. V is the relative speed. We can assume that node A is still relative to B,and node B move at speed of vector v.