Research Article
Greedy Intersection-Mode Routing Strategy Protocol for Vehicular Networks
| (1) | nS node creates pkt (nS, nD, nDLoc (x, y), and TTL), | | (2) | broadcast to neighbor nodes | | (3) | forwarding pkt by greedy mode | | (4) | if (nd = = n max) then | | (5) | find intersection mode | | (6) | Else | | (7) | find next mode to transfer | | (8) | end if | | (9) | find direction of travel node in intersection broadcast table | | (10) | forwarding pkt by intersection mode | | (11) | if (ni = = nd) then | | (12) | Send RRP (nS, nD, and Rbest) return | | (13) | else | | (14) | if (rd = = straight road) then | | (15) | forwarding pkt by greedy mode |
|
