L‐RUBI: An efficient load‐based resource utilization algorithm for bi‐partite scatternet in wireless personal area networks

Abstract

SummaryRecently, much of the wireless personal area network (WPAN) research concerns network protocols, scheduling, and security challenges but the major issue of resource utilization has been very rarely investigated. The design of resource sharing in a network gets more attention when the number of users increases. While optimizing performance, resource utilization plays a critical role. In this paper, the numerical performance of a wireless resource utilization algorithm for a bi‐partite scatternet is presented. This algorithm is focused to enhance the bandwidth allocation and power utilization of wireless scatternets. Every node can communicate with a single neighbor at a time with minimum resources. Finally, the performances of the RUBI algorithm are shown. This algorithm is compared with the existing algorithms such as the load adaptive scheduling algorithm and pseudorandom coordinated scheduling scheme in terms of various parametric metrics like reliability, throughput, collision probability, transmission probability, and signal‐to‐noise ratio (SINR). The proposed L‐RUBI achieves 93.4% of reliability, 93.6% of transmission probability, 91.4% of throughput, 76.8% of collision performance, and 72.2% SINR.