Research Article
Greedy Intersection-Mode Routing Strategy Protocol for Vehicular Networks
Algorithm 2
Route discovery and route reply based on IGPSR.
| (1) | nS node creates pkt (nS, nD, nDLoc (x, y), and IDs TTL) | | (2) | broadcast to neighbor nodes | | (3) | if (ni = = nD) then | | (4) | forwarding pkt to the shortest path of destination | | (5) | else | | (6) | broadcast message to the neighbor nodes | | (7) | end if | | (8) | if (RBP reaches nd) then | | (9) | send reply response to the source node | | (10) | else | | (11) | broadcast message to the neighbor to reach destination | | (12) | end if | | (13) | if (TTL Expires) then | | (14) | re-broadcast message to the neighbor to reach the destination | | (15) | Send RRP (nS, nD, loc (x, y) IDS TTL) Return | | (16) | save hop count | | (17) | forward RPT to source node | | (18) | else | | (19) | broadcast message | | (20) | end if | | (21) | evaluate the best route based on routing protocol | | (22) | else | | (23) | forward RBP to the neighbor node | | (24) | end if |
|
