Abstract
Radio Frequency Identification (RFID) Network is a collection of readers and tags with reading, computation and communication capabilities. The readers are capable of receiving data from the tags in the monitoring environment. These networks are constraint with energy, memory and computing power. One of the major problems in RFID Network is to capitalize on the lifetime of the network. Hence in order to improve and maximize on the energy efficiency of the network, life of the network needs to be maximized by decreasing the energy consumption of RFID readers and balancing their energy consumption of every reader. In this paper, a centralized, energy efficient cluster based protocol to extend the RFID network lifetime by using Dragonfly algorithm has been developed. It makes use of a high energy node as a cluster head which devotes less energy while transmitting aggregated data to base station. Clustering is one of best method to increase the lifetime of network by consuming less energy. Clustering scheme is processed in two-stages. In the first stage, the candidates of cluster head are selected based on the potential score such as mobility, energy and density. In the second stage each node will decide whether the node itself should be a cluster head or not using a potential score. After finishing the process of selecting the candidates of cluster head, the rest of the nodes that are not elected as cluster heads join the best effective cluster head in terms of link connection time and energy. Energy efficient cluster based protocol for the RFID network using Dragonfly algorithm is simulated. The simulated result in NS2 shows that Cluster based protocol selects optimal cluster head and the cluster breakage is low when compared with LEACH protocol. The reading efficiency in RFID network is also improved using Dragonfly algorithm.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.