Optimal Dynamic Frame-Slotted Aloha

Dr Hammad Nazir; Youzhi Xu; Alf Johansson

doi:https://doi.org/10.1109/wicom.2011.6040571

Optimal Dynamic Frame-Slotted Aloha

Dr Hammad Nazir, Youzhi Xu, Alf Johansson

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

Passive UHF RFID systems using Dynamic Frame-Slotted ALOHA (DFSA) adjust the frame size according to the number of tags, but frame size N is equals to 2 Q and cannot be adjusted exactly to the number of tags to be identified. In this paper, we propose an optimal Aloha algorithm (ODFSA), which uses probabilistic approach for tags to access the frame. The Query or Query Adjust packet contains both the parameter Q and P called frame access probability, which represents the ratio of number of active tags in the current frame to the estimated total number of tags which remain to be identified in the system. Estimation of number of unread tags is updated after end of each frame; parameters Q and P are calculated and informed at the beginning of each frame. Mathematical analysis and computer simulations show that the proposed Aloha achieves maximum system efficiency, utilizes less number of slots compared with other algorithms and also takes less identification time.

Original language	English
Title of host publication	2011 7th International Conference on Wireless Communications, Networking and Mobile Computing
Subtitle of host publication	23-25 Sept. 2011
Publisher	Institute of Electrical and Electronics Engineers
Number of pages	4
ISBN (Electronic)	978-1-4244-6252-0
ISBN (Print)	978-1-4244-6250-6
DOIs	https://doi.org/10.1109/wicom.2011.6040571
Publication status	Published - 1 Jun 2011
Externally published	Yes
Event	7th International Conference on Wireless Communications, Networking and Mobile Computing - Wuhan, China Duration: 23 Sept 2011 → 25 Sept 2011

Publication series

Name
Publisher	IEEE
ISSN (Print)	2161-9646
ISSN (Electronic)	2161-9654

Conference

Conference	7th International Conference on Wireless Communications, Networking and Mobile Computing
Country/Territory	China
City	Wuhan
Period	23/09/11 → 25/09/11

Access to Document

https://doi.org/10.1109/wicom.2011.6040571

Cite this

@inproceedings{9837ffbc687247b4890063a45a1984f9,

title = "Optimal Dynamic Frame-Slotted Aloha",

abstract = "Passive UHF RFID systems using Dynamic Frame-Slotted ALOHA (DFSA) adjust the frame size according to the number of tags, but frame size N is equals to 2 Q and cannot be adjusted exactly to the number of tags to be identified. In this paper, we propose an optimal Aloha algorithm (ODFSA), which uses probabilistic approach for tags to access the frame. The Query or Query Adjust packet contains both the parameter Q and P called frame access probability, which represents the ratio of number of active tags in the current frame to the estimated total number of tags which remain to be identified in the system. Estimation of number of unread tags is updated after end of each frame; parameters Q and P are calculated and informed at the beginning of each frame. Mathematical analysis and computer simulations show that the proposed Aloha achieves maximum system efficiency, utilizes less number of slots compared with other algorithms and also takes less identification time.",

author = "Nazir, {Dr Hammad} and Youzhi Xu and Alf Johansson",

year = "2011",

month = jun,

day = "1",

doi = "https://doi.org/10.1109/wicom.2011.6040571",

language = "English",

isbn = "978-1-4244-6250-6",

publisher = "Institute of Electrical and Electronics Engineers",

booktitle = "2011 7th International Conference on Wireless Communications, Networking and Mobile Computing",

note = "7th International Conference on Wireless Communications, Networking and Mobile Computing ; Conference date: 23-09-2011 Through 25-09-2011",

}

Nazir, DH, Xu, Y & Johansson, A 2011, Optimal Dynamic Frame-Slotted Aloha. in 2011 7th International Conference on Wireless Communications, Networking and Mobile Computing: 23-25 Sept. 2011., 6040571, Institute of Electrical and Electronics Engineers, 7th International Conference on Wireless Communications, Networking and Mobile Computing , Wuhan, China, 23/09/11. https://doi.org/10.1109/wicom.2011.6040571

TY - GEN

T1 - Optimal Dynamic Frame-Slotted Aloha

AU - Nazir, Dr Hammad

AU - Xu, Youzhi

AU - Johansson, Alf

PY - 2011/6/1

Y1 - 2011/6/1

N2 - Passive UHF RFID systems using Dynamic Frame-Slotted ALOHA (DFSA) adjust the frame size according to the number of tags, but frame size N is equals to 2 Q and cannot be adjusted exactly to the number of tags to be identified. In this paper, we propose an optimal Aloha algorithm (ODFSA), which uses probabilistic approach for tags to access the frame. The Query or Query Adjust packet contains both the parameter Q and P called frame access probability, which represents the ratio of number of active tags in the current frame to the estimated total number of tags which remain to be identified in the system. Estimation of number of unread tags is updated after end of each frame; parameters Q and P are calculated and informed at the beginning of each frame. Mathematical analysis and computer simulations show that the proposed Aloha achieves maximum system efficiency, utilizes less number of slots compared with other algorithms and also takes less identification time.

AB - Passive UHF RFID systems using Dynamic Frame-Slotted ALOHA (DFSA) adjust the frame size according to the number of tags, but frame size N is equals to 2 Q and cannot be adjusted exactly to the number of tags to be identified. In this paper, we propose an optimal Aloha algorithm (ODFSA), which uses probabilistic approach for tags to access the frame. The Query or Query Adjust packet contains both the parameter Q and P called frame access probability, which represents the ratio of number of active tags in the current frame to the estimated total number of tags which remain to be identified in the system. Estimation of number of unread tags is updated after end of each frame; parameters Q and P are calculated and informed at the beginning of each frame. Mathematical analysis and computer simulations show that the proposed Aloha achieves maximum system efficiency, utilizes less number of slots compared with other algorithms and also takes less identification time.

U2 - https://doi.org/10.1109/wicom.2011.6040571

DO - https://doi.org/10.1109/wicom.2011.6040571

M3 - Conference contribution

SN - 978-1-4244-6250-6

BT - 2011 7th International Conference on Wireless Communications, Networking and Mobile Computing

PB - Institute of Electrical and Electronics Engineers

T2 - 7th International Conference on Wireless Communications, Networking and Mobile Computing

Y2 - 23 September 2011 through 25 September 2011

ER -