Distributed algorithms for the RFID coverage problem

Jedda, Ahmed; Khair, Mazen G.; Mouftah, Hussein T.

doi:10.1109/icc.2013.6654773

Cited by 7 publications

(4 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A reader can only use one of the interrogation ranges at one time. In addition, because of the limited energy of the readers and processing time constraints and link layer protocols 6,7 where the processing of readers on each tag's information is maintained under a limited number of time slots, a reader therefore reads at most tags. To avoid collision, a tag in a sensing field is read by at most one reader.…”

Section: Model and Definitionsmentioning

confidence: 99%

“…The authors of 1,2 described the problem of data collision avoidance in RFID networks that must be addressed in order to increase the reading performance of RFID readers. Recently, many studies [3][4][5][6] have investigated activating readers in an RFID system to cover the maximum number of tags. Redundant readers increase the network overheads because they inquire and provide the same tag's information, and increase the number of unnecessary communication exchanges.…”

mentioning

confidence: 99%

“…Due to a limited financial budget, the number of readers sometimes was also considered. In Jedda et al, 6 the authors proposed a greedy distributed elimination (GDE) method to cover all the tags in the RFID network by using a minimum number of readers. Unfortunately, most of the recently proposed solutions rely on heuristic algorithms which often result in low performance in the worst case scenario.…”

mentioning

confidence: 99%

See 2 more Smart Citations

Optimal solution for data collision avoidance in radio frequency identification networks

Nguyen

Leu

Zeadally

et al. 2018

Internet Technology Letters

View full text Add to dashboard Cite

When data collisions happen in radio frequency identification (RFID) networks, inaccurate tag's information or the communication between the RFID reader and the RFID tag occur. Although recent technological advances have improved the inquiry capacity performance of RFID readers, the performance of RFID networks can still be affected by collisions. We propose a novel solution that helps select RFID readers which have the appropriate interrogation range to enable the highest number of tags to be read without collisions (often referred to as the reader‐tag‐data collision avoidance [RTDCA] problem). To solve the RTDCA problem, we introduce a relative collision graph to transform the original problem into one that involves finding the maximum weight independent set. We then formulate the RTDCA problem using a mathematical model. To solve the RTDCA problem by using a linear programming model requires an exponential number of variables which cannot be solved in polynomial time. Our proposed solution makes use of dynamic programming with path decomposition to determine the optimal number of RFID tags that can be read without data collisions.

show abstract

Section: Model and Definitionsmentioning

confidence: 99%

mentioning

confidence: 99%

mentioning

confidence: 99%

See 1 more Smart Citation

Optimal solution for data collision avoidance in radio frequency identification networks

Nguyen

Leu

Zeadally

et al. 2018

Internet Technology Letters

View full text Add to dashboard Cite

show abstract

“…When the number of tags and their locations are given, Jedda, Khair, and Mouftah (2013) introduced several distributed algorithms to optimise the RNP that cover every tag in the surveillance field. Ma et al (2014) proposed a cooperative multi-objective artificial colony algorithm to solve the multi-objective RNP problem and illustrated its outperformance compared to the NSGA-II and another MOABC in terms of optimisation accuracy and computation robustness.…”

Section: Introductionmentioning

confidence: 99%

An improved multi-objective genetic algorithm for heterogeneous coverage RFID network planning

Lin

Liu

Cao

et al. 2015

International Journal of Production Research

View full text Add to dashboard Cite

Recent research has demonstrated the potential benefits of radio frequency identification (RFID) technology in the supply chain and production management via its item-level visibility. However, the RFID coverage performance is largely impacted by the surrounding environment and potential collisions between the RFID devices. Thus, through RFID network planning (RNP) to achieve the desired coverage within the budget becomes a key factor for success. In this study, we establish a novel and generic multi-objective RNP model by simultaneously optimising two conflicted objectives with satisfying the heterogeneous coverage requirements. Then, we design an improved multi-objective genetic algorithm (IMOGA) integrating a divide-and-conquer greedy heuristic algorithm to solve the model. We further construct a number of computational cases abstracted from an automobile mixed-model assembly line to illustrate how the proposed model and algorithm are applied in a real RNP application. The results show that the proposed IMOGA achieves highly competitive solutions compared with Pareto optimal solutions and the solutions given by four recently developed well-known multi-objective evolutionary and swarm-based optimisers (SPEA2, NSGA-II, MOPSO and MOPS 2 O) in terms of solution quality and computational robustness.Keywords: RFID network planning; mixed-model assembly line; heterogeneous coverage; multi-objective genetic algorithm 1. Introduction Radio frequency identification (RFID) refers to the technology that uses radio waves to transfer data between tags and readers without requiring contact or line of sight. It enables automatic object identification and data transfer, where it can accurately provide real-time information about the locations or states of machines, materials, people or tools. An RFID network consists of readers, which are deployed in different geographical locations within a field to collectively monitor this field, and tags, which are attached to the objects of interest. RFID networks are becoming increasingly pervasive in various applications, e.g. ubiquitous learning (Chen and Huang 2012; Chen and Lin 2014), wireless manufacturing (Brintrup, Ranasinghe, and McFarlane 2010; Huang, Williams, and Zheng 2011), warehousing operation (Pacciarelli, D'Ariano, and Scotto 2011), production schedule (Pacciarelli and D'Ariano 2012) and product life cycle management (Cao et al. 2009(Cao et al. , 2010.Owing to the limited effective tag-reader communication distance (e.g. 3-5 m for UHF RFID devices), deploying an RFID application in a large field often requires a great number of readers, which makes it expensive. The coverage performance, loosely defined as the data communication quality in the coverage area, is mainly impacted by the interference of surrounding objects and the collisions caused by the RFID devices themselves. The high cost and the unstable coverage performance resulted from interference and collusions are two main obstacles for large-scale implementation of RFID technology (Bindel, Conway, and West 2012)...

show abstract