TLRDA-D: Traffic Locality Oriented Route Discovery Algorithm with Delay

  • Lewis Mackenzie
  • Mohamed Ould-Khaoua


Communication may follow certain pattern that is not necessarily spatial or temporal but rather to follow special needs as a part of group for collaboration purposes. In MANETs, the source node tends to communicate with a certain set of nodes more than others regardless of their location exhibiting traffic locality where this set changes over time. We are introducing a traffic locality oriented route discovery algorithm with delay, TLRDA-D. It utilises traffic locality by establishing a neighbourhood that includes the most likely destinations for a particular source node. Within the neighbourhood, each node broadcasts the route request according to the original routing used. Beyond this boundary, each intermediate node broadcasts the route request with a delay to give higher priority for route requests that are travelling within their own source node’s neighbourhood region. This approach improves the end-to-end delay and packet loss, as it generates less contention throughout the network. TLRDA-D is analysed using both mathematical and simulation modelling to study the effect of adding different amount of delays to route request propagation and to decide on the most suitable quantity of added delay.