International Publisher for Advanced Scientific Journals (IPASJ)
A novel collision avoidance algorithm is proposed to resolve the problem of collision among independent entities in transportation networks. The algorithm aims in scheduling multiple entities in a network in such a way that eliminates every possibility of collision between any two entities in the network. To achieve the desired goal the algorithm takes help of Binary locks which has found enormous and successful application in the field of database management systems. Considering each node of the network as a resource and asserting a Binary lock for each of them the algorithm ensures concurrency control for each node in the network thereby eliminating any possibility of collisions what so ever.