Detection and Counter Measure of Packet Misrouting by GPS-Free Positioning of Ad-Hoc Nodes
Algorithm 3
The source node will discover a path.
(1)
Details of aggregate no. of packets to be transmitted will be sent at the time of path request.
(2)
Traveling time from source to current node = (way for request packet/received time at current node) − (path for request/packet delivery time at source).
(3)
Each node appends its GPS-free positioning (Vector Value) with every packet.
(4)
Each node keeps up its previous two nodes GPS-free positioning.
(5)
Expected time of next packet T (exp) = Max (Travelling time of path request/pervious packet) + Max (time term between two back to back packets) ± X
(6)
X relies on upon GPS-free positioning of previous nodes.
(7)
If no packet is gotten from pervious node after the normal time T (EXP), then the current node presumes that its previous node drops or misroutes the packet and sends a ready message to the nodes to have a place with the present path.
(8)
Source node will give a substitute path to current node and sends remaining packets through new path up to current node.
