Open AccessQoS‐Guaranteed Slot Allocation Algorithm for Efficient Medium Access in HR‐WPAN
Author(s) -
Sung JungSik,
Lee Hyunjeong,
Kang TaeGyu,
Huh Jaedoo
Publication year - 2015
Publication title -
etri journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.295
H-Index - 46
eISSN - 2233-7326
pISSN - 1225-6463
DOI - 10.4218/etrij.15.0115.0299
Subject(s) - superframe , computer science , quality of service , computer network , reservation , network packet , personal area network , parameterized complexity , service (business) , resource allocation , wireless , algorithm , telecommunications , economy , economics , frame (networking)
It is very important to provide a parameterized quality of service (QoS) using traffic specification (TSPEC), such as mean data rate, maximum burst size, and peak data rate, when packets from the application layer need to be transmitted with guaranteed services in a high‐rate wireless personal area network (HR‐WPAN). As medium resources are limited, the optimal medium time required for each device needs to be estimated to share the resources efficiently among devices. This paper proposes a variable‐service interval‐based resource allocation algorithm to efficiently make a reservation of medium resources based on a parameterized QoS. In other words, the proposed algorithm calculates the number of medium access slots (MASs) based on TSPEC, local resources, and local conditions and determines suitable locations for the MASs within a superframe to accommodate more devices. The simulation results show that the proposed algorithm can accommodate more devices and has greater than 10% resource allocation efficiency in an HR‐WPAN compared to existing schemes.