OMIEEPB

Abstract

Wireless Sensor Network is made up by full of nodes and base stations. It is used in many real time applications to observe the physical or environmental constraints. The main goal (intention) of the routing protocols is to shrink the consumption of nodes energy and expand the nodes life time. Among many routing protocols, PEGASIS provides efficient performance. EEPB has a long chain linking problem and that is rectified by IEEPB, high density node and heavy load to leader in IEEPB are overcome by MIEEPB. In existing model, the sink needs to visit every chain leader's location to get the data consumes more energy and time. To overcome this issue, OMIEEPB protocol is proposed to identify centroid of nearest possible chains through K-means clustering algorithm. Then the mobile sink will get the data from nearest possible leaders without travelling to each chain. If the chain count is more than 12, then another mobile needs to be employed for sharing the load of the existing sink. The proposed model will comparatively reduce the time of each round and energy of the mobile sink spend.