Abstract

WSN is becoming key subject of research in computational basic principle because of its great deal of applications. ACO( Ant Colony Optimization) constructs the redirecting or routing tree via a method by which, for every single circular or round, Base Station (BS) chooses the root node in addition to shows the following substitute for every node. In order to prevail over the actual constraints with the sooner work a new increased method proposed in this research work. The proposed method has the capacity to prevail over the constraints of ACO routing protocol using the principle with reactivity, mobile sink and also the compressive sensing technique. In this paper we measure the main parameters that affect the wsn that are network lifetime, packets dropped, throughput, end to end delay and remaining energy for proposed algorithm and simulation results have shown that the proposed algorithm is highly effective.