A Novel Algorithm for Redundant Data Filtering in WSN and RFID Integrated Networks

Authors

  • Mahia Samani Department of Computer Engineering, Qom Branch, Islamic Azad University, Qom, Iran
  • Ahmad Khademzadeh Department of Computer Engineering, Qom Branch, Islamic Azad University, Qom, Iran
  • Kambiz Badie Department of Computer Engineering, Qom Branch, Islamic Azad University, Qom, Iran

DOI:

https://doi.org/10.5377/nexo.v35i04.15550

Keywords:

redundant data, data filtering, integration, radio frequency identification, wireless sensor network, algorithm

Abstract

Wireless sensor networks (WSN) and radio frequency identification (RFID) are base technologies employed in decentralised dynamic environments. In the hybrid network formed by integrating RFID and WSN, RFID data can be used applying WSN protocols for multi-hop communications. However, RFID data contain excessive duplication, which increases time delay and energy consumption, resulting in wastage of different resources. There exist four popular RFID–WSN integration architectures: hierarchical RFID-sensor topology, network RFID-sensor topology, reader-sensor nodes topology, and mixed topology. In this paper, we propose a new plan for a WSN–RFID integrated network. The entire network is divided into clusters, and the clustering hierarchical routing algorithm is employed to send data from the head nodes to the base station. Further, we propose two algorithms to overcome redundant data on the hybrid network. Our simulation results demonstrate that the proposed method reduces redundant data and processing time compared with existing methods.

Downloads

Download data is not yet available.
Abstract
370
PDF 207

Downloads

Published

2022-12-31

How to Cite

Samani, M. ., Khademzadeh, A. ., & Badie, K. . (2022). A Novel Algorithm for Redundant Data Filtering in WSN and RFID Integrated Networks. Nexo Scientific Journal, 35(04), 1078–1090. https://doi.org/10.5377/nexo.v35i04.15550

Issue

Section

Articles

Similar Articles

<< < 19 20 21 22 23 24 25 26 27 28 > >> 

You may also start an advanced similarity search for this article.