Communities & Collections
Researchers & Labs
Titles
DGIST
LIBRARY
DGIST R&D
Detail View
ETC
1. Journal Articles
A novel superframe structure and optimal time slot allocation algorithm for IEEE 802.15.4–based Internet of things
Khan, Sangrez
;
Alvi, Ahmad Naseem
;
Khan, Mohammad Zubair
;
Javed, Muhammad Awais
;
Alhazmi, Omar H
;
Bouk, Safdar Hussain
ETC
1. Journal Articles
Citations
WEB OF SCIENCE
Citations
SCOPUS
Metadata Downloads
XML
Excel
Title
A novel superframe structure and optimal time slot allocation algorithm for IEEE 802.15.4–based Internet of things
DGIST Authors
Khan, Sangrez
;
Alvi, Ahmad Naseem
;
Khan, Mohammad Zubair
;
Javed, Muhammad Awais
;
Alhazmi, Omar H
;
Bouk, Safdar Hussain
Issued Date
2020-12
Citation
Khan, Sangrez. (2020-12). A novel superframe structure and optimal time slot allocation algorithm for IEEE 802.15.4–based Internet of things. doi: 10.1177/1550147720984645
Type
Article
Article Type
Article
Author Keywords
Internet of things
;
IEEE 802
;
15
;
4
;
medium access control
;
guaranteed time slots
Keywords
Air traffic control
;
Internet of things
;
Physical layer
;
Structural optimization
;
Analytical results
;
Beacon-Enabled IEEE 802.15.4
;
Contention access periods
;
Contention free periods
;
Guaranteed time slots
;
IEEE 802.15.4 standards
;
Internet of Things (IOT)
;
Knapsack algorithms
;
IEEE Standards
ISSN
1550-1477
Abstract
IEEE 802.15.4 standard is specifically designed for a low-rate and low-processing Internet of things (IoT) applications and offers guaranteed time slots. A beacon-enabled IEEE 802.15.4 consists of a superframe structure that comprises of the contention access period and contention-free period. During contention-free period, nodes transfer their data using guaranteed time slots without any collision. The coordinator node receives data transmission requests in one cycle and allocates guaranteed time slots to the nodes in the next cycle. This allocation process may cause large delay that may not be acceptable for few applications. In this work, a novel superframe structure is proposed that significantly reduces guaranteed time slots allocation delay for the nodes with data requests. The proposed superframe structure comprises of two contention access periods and one contention-free period, where contention-free period precedes both contention access periods with reduced slot size. In addition, the knapsack algorithm is modified for better guaranteed time slots allocation by allowing more guaranteed time slots requesting nodes to send their data as compared to the IEEE 802.15.4 standard. The simulation and analytical results show that the proposed superframe structure reduces the network delay by up to 80%, increases contention-free period utilization up to 50%, and allocates guaranteed time slots up to 16 nodes in a single superframe duration. © The Author(s) 2020.
URI
http://hdl.handle.net/20.500.11750/12660
DOI
10.1177/1550147720984645
Publisher
SAGE Publications Ltd
Show Full Item Record
File Downloads
2-s2.0-85098280695.pdf
공유
공유하기
Total Views & Downloads