Improved cluster based route discovery algorithm for ad-hoc networks

In case of wireless networks with infrastructure there is a base station which is reachable through all mobile nodes. Ad-hoc network defers in this point where destination nodes might be unreachable from source nodes. The Mobile Ad-Hoc Network are prone to packet loss and route congestion due to their dynamic nature. The lack of centralized infrastructure adds up to these problems. In this respect cluster based routing mechanism is necessary for dealing with such problems. This paper emphasizes the shortest path finding between the source and destination in cluster based adhoc network for reducing packet delay and energy consumption. The paper also includes a performance comparison of this logic with existing SDSSR algorithm.