Routing Protocol on Wireless Sensor Network Using ACO and DEEC

Sensors nodes in WSNs’ applications are battery constrained thus innovative techniques are needed to eliminate energy inefficiency that shorten the network lifetime. There is dead node identification problem during the transmission of data because at that time path is not identified. Another problem is the network life time problem due to the redundancy. During the transmission energy is lossed, so there is energy consumption problem. There is NP-hard scheduling problem that we have seen in the literature survey. Another problem is the more bandwidth and less network life time problem. To implement Hybrid Algorithm for routing in Wireless sensor network using CH-leach and DEEC. To ACO and LEACH protocol on wireless sensor network using Clustering. CH-Leach Protocol, an approach of algorithm proposed, this proposed research used number of connection in cluster, and for each cluster head (CH) communicate with base station, however the selection of the cluster head based on the number of cluster on the network gird area, this method allow the network to adopted the best scenario to extend life time of the network, different ways of cluster are formed, in order to avoid the condition that one cluster will contain large of connection nodes and the rest is not, the maximum number of the cluster head is chosen in different scenario to test the network coverage. a series of experiments on different scenarios were implemented and tested. For energy consumption in wireless sensor network EEUC protocol, zone-divided and energy-balanced clustering routing protocol (ZECR) is used to enhance this work. In this paintings the higher performance is executed as a substitute then the present paintings due to the fact the present paintings is most effective relies upon on bodily shape however our paintings is carried out with logical paintings and the general output is 70%.