IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/7854154.html
   My bibliography  Save this article

An Effective Scheduling-Based RFID Reader Collision Avoidance Model and Its Resource Allocation via Artificial Immune Network

Author

Listed:
  • Shanjin Wang
  • Zhonghua Li
  • Chunhui He
  • Jianming Li

Abstract

Radio frequency identification, that is, RFID, is one of important technologies in Internet of Things. Reader collision does impair the tag identification efficiency of an RFID system. Many developed methods, for example, the scheduling-based series, that are used to avoid RFID reader collision, have been developed. For scheduling-based methods, communication resources, that is, time slots, channels, and power, are optimally assigned to readers. In this case, reader collision avoidance is equivalent to an optimization problem related to resource allocation. However, the existing methods neglect the overlap between the interrogation regions of readers, which reduces the tag identification rate (TIR). To resolve this shortage, this paper attempts to build a reader-to-reader collision avoidance model considering the interrogation region overlaps (R2RCAM-IRO). In addition, an artificial immune network for resource allocation (RA-IRO-aiNet) is designed to optimize the proposed model. For comparison, some comparative numerical simulations are arranged. The simulation results show that the proposed R2RCAM-IRO is an effective model where TIR is improved significantly. And especially in the application of reader-to-reader collision avoidance, the proposed RA-IRO-aiNet outperforms GA, opt-aiNet, and PSO in the total coverage area of readers.

Suggested Citation

  • Shanjin Wang & Zhonghua Li & Chunhui He & Jianming Li, 2016. "An Effective Scheduling-Based RFID Reader Collision Avoidance Model and Its Resource Allocation via Artificial Immune Network," Mathematical Problems in Engineering, Hindawi, vol. 2016, pages 1-11, January.
  • Handle: RePEc:hin:jnlmpe:7854154
    DOI: 10.1155/2016/7854154
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2016/7854154.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/MPE/2016/7854154.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2016/7854154?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:jnlmpe:7854154. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.