A Link Distribution Algorithm with Efficient Relay Node Optimization for Congestion Control in Urban Vanets

Abstract

This research work develops a new algorithm i.e. Link distribution algorithm and efficient link distribution algorithm. A Link distribution algorithm is the distribution of the link to the nodes so that communication between the nodes takes place in case of any link failure whereas efficient link distribution algorithm is distribution of the packets to the nodes which has high transmission power. The technique used in Link distribution algorithm (LDA) is link establishment whenever there is any link failure happen we apply this concept which is LDA whereas the technique used in efficient link distribution algorithm (ELDA) is relay node selection the relay node is selected based upon the received signal strength ratio (RSSI) value and which node is having high RSSI value that node we allocate the link. The above algorithms can be applied wherever there is high congestion on the road due to the high congestion link failure will happen and due to the link failure emergency event occurs. Results of model achieved in a realistic state of affairs validate our theoretical deliberation and confirm the efficiency and the efficacy of our protocol by screening significant expansion in terms of busy ratio, collision rate, deviation, local density and transmission power compared to previous scheme ETSI DCC. The work has been successfully done with the help open source network simulator NS3.