RANDOMIZATION OF NODE SCHEME WITH OPTIMIZATION IN WIRELESS SENSOR NETWORK

Swarm Intelligence has nature inspired intelligence dependent on aggregate conduct of swarms having self-sorted out nature. Different techniques are being planned as far as ACO, PSO, Fish Swarm, Bats Swarm, Bacterial Foraging, TABU search and so forth.TABU search is regarded as heuristic method derived by Glover in 1986 depends on the memory structure. TABU search is used to determine the engineering design problems having continuous and real number variables. TABU is utilized to take care of different discrete issues in various regions of sciences and engineering. Since its advancement TABU has pulled in loads of specialists to take up its calculations and apply to take care of different complex issues and has been demonstrated the best strategy to get enhanced outcomes. The objective of this research paper is to implement TABU search to make the protocol more efficient and effective. This paper proposed MSEEC (multilevel stable and energy efficient clustering protocol) utilizing TABU mechanism in which normal nodes are randomly changed after each round in the territory of 200m×200m.The recreation is done under the MATLAB environment and observed the performance of TABUMSEEC against MSEEC protocol on 4% increase in the case of first node dead (FND) and 20% increase in the case of last node dead (LND) and average remaining energy is delayed by 12% in advance nodes and 20% in super nodes respectively.