On the scalability of routing protocols in WSN

A lot of routing protocols have been developed for Wireless sensor networks where the related work has been done on small size of network like hundred or thousand depending on the applications, but today scenarios demanding for large size of network where the number of nodes may reach extreme values of millions. WSNs collect the essential information as per requirement where scalability is the essential factor to persuade the routing protocols. Scalability is to extend huge number of sensor nodes in the network without degrading the performance of WSN which is essential factor for designing the routing protocol. If routing protocol is scalable and adaptive as per dynamic topology is called best fitted protocol, and works even enhance the size of network and workload. In this paper, five protocols have been considered specifically LEACH, FAIR, SEP, TEEN and EAMMH for their scalability prototype in wireless sensor networks. Scalability is introduced in terms of number if sensor nodes in network field where the number of nodes increases 100-1000 for each protocol. The protocols have been simulated using MATLAB considered various parameters for evaluating the performance. The results represents that majority time FAIR protocol performs better than LEACH, SEP, TEEN and EAMMH for measured parameters such as dead nodes decreases and clusters formation, cluster head formation and packet delivery ratio to base station extends.