Efficient Medium Access Control Protocols for Broadband Wireless Communications

Nakpeerayuth, Suvit; Wuttisittikulkij, Lunchakorn; Vanichchanunt, Pisit; Srichavengsup, Warakorn; Wattanamongkhol, Norrarat; Annur, Robithoh; Saadi, Muhammad; Wannakong, Kamalas; Siwamogsatham, Siwaruk

doi:10.5772/16040

Cited by 3 publications

(2 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…When there is a collision, the reader will not be able to distinguish these signals and identify each individual tag correctly. To overcome this collision problem, several anti-collision algorithms have been proposed in literature [5][6][7][8][9], some of which are presented in the following section in greater details.…”

Section: Rfid Technologymentioning

confidence: 99%

A Reduced Complexity of Vahedi's Tag Estimation Method for DFSA

Wijayasekara¹,

Annur²,

Sasithong³

et al. 2017

Self Cite

View full text Add to dashboard Cite

Abstract. In order to calculate the number of tags in a radio frequency identification (RFID) system, several tag estimation methods have been investigated in literature and most of the available estimation methods need the overall knowledge of idle, success and collision slots of the previous frame to carry out the tag estimation process. In this article, we present three techniques to reduce the complexity of Vahedi's tag estimation for tag King Mongkut's University of Technology North Bangkokcollision resolution in RFID systems using dynamic frame slotted ALOHA. Our modified and useful approach considers the information about only the number of empty, successful or colliding slots in the previous frame for the tag estimation. Three decision rules were obtained by maximizing the likelihood of success, idle and collision which helps in the reduction of complexity substantially. However, the accuracy of estimation decreases for success-only and idle-only methods while the collision-only method gives a consistent and lower estimate error when the frame sizes and the number of tags increase.

show abstract

Section: Rfid Technologymentioning

confidence: 99%

A Reduced Complexity of Vahedi's Tag Estimation Method for DFSA

Wijayasekara¹,

Annur²,

Sasithong³

et al. 2017

Self Cite

View full text Add to dashboard Cite

show abstract

“…However, the concurrent messaging from several tags to the reader leads to a problem termed as tag collision, where the reader denies the identification of the tags. In this scenario, messages are retransmitted and consume more system resources leading to an inefficient system performance [3][4][5][6].…”

Section: Introductionmentioning

confidence: 99%

Frame Size Analysis of Optimum Dynamic Tree in RFID Systems

Wijayasekara¹,

Saadi²,

Srichavengsup³

et al. 2020

View full text Add to dashboard Cite

In RFID (Radio Frequency Identification) system, an anti-collision algorithm plays a prominent role in the tag recognition process to reduce the required time for identifying the tag and enhance the RFID system efficiency. In this paper, we present a theoretical analysis of optimal frame size assignment for the maximization of system efficiency of a tree-based anti-collision algorithm, called optimum dynamic tree (ODT) algorithm, which is used for RFID tag recognition process. Analysis indicates that the appropriate frame size for a given number of competing tags should not be set equal to the number of tags, which is usually adopted in literature. Instead of this, the frame size should be kept smaller roughly by a factor of 0.871 to maximize system efficiency. The closed-form solution for calculating system efficiency has been derived. The simulated results show excellent correlation with the theoretical one. Range for the exact appropriate frame sizes for the number of tags is from 2 to 100. Comparison has been made for the tag-identification time of conventional binary tree and ODT algorithms according to the international standard ISO 18000-6B.

show abstract