PERFORMANCE COMPARISON OF DRAGONFLY AND FIREFLY ALGORITHM IN THE RFID NETWORK TO IMPROVE THE DATA TRANSMISSION

RFID (Radio Frequency Identification) network is used for sensing and tracking the objects. The main flaw in this network is reader collision which leads to redundant data. Consequently, due to dissimilar mobility between a head and its member nodes causes unstable clustering. Hence, the protocol known as Dragonfly based Clustering Protocol (DCP) is proposed to minimize the frequent cluster breakage and to improve the data transmission in the network. The readers with high residual energy level are picked as an eligible cluster head. After picking the eligible head, the distance, speed and neighbor count values are calculated between the head nodes and its neighbors. The values are added and optimum cluster heads are opted if the calculated value is high. Then the other nodes join the cluster based on the movement of the head. The conclusion shows that optimal cluster heads are opted using DCP than LEACH and firefly algorithm in which mobility and neighbor count are not taken into account while picking the cluster head. The simulated result in NS2 shows that DCP protocol selects optimal cluster head and the cluster breakage is low when compared with LEACH protocol and firefly algorithm. The reading efficiency in RFID network is also improved using Dragonfly based clustering.