From: TIHOO: An Enhanced Hybrid Routing Protocol in Vehicular Ad-hoc Networks

1: Start procedure | |

2: Phase 1: Action of the source node | |

3: Set N j current node and N _{d} destination node
| |

4: While N _{d} destination Receive Packet or (stop criterion)
| |

5: Current node send Hello packet to neighbor nodes | |

6: Calculate input of fuzzy system 7: Call fuzzy logic system to limit broadcasting RREQ | |

8: Increment j
| |

9: End while | |

10: Interrupt for receive RREQ of all paths | |

11: Phase 2: Action of the destination node | |

12: Get available population of N paths p_{i} i = 1,2,...,n for Declared paths of source to destination
| |

13: While i < n or (stop criterion )
| |

14: Calculate reliability factor , lifetime , buffer -available for p_{i}
| |

15: Call cuckoo search algorithm | |

16: Calculate Fitness F( p_{i})
| |

17: Increment i
| |

18: End while | |

19: Choose Optimized path is path with best fitness value | |

20 : If sending data not finished | |

21: Repeat Step 4 to Step 18 | |

22: Else if | |

23: End procedure |