This paper deals with an efficient resource allocation algorithm for Wide-Area Low Rate Wireless Personal Area Networks (LR-WPANs), based on the IEEE 802.15.4m standard. The proposed scheme aims at lowering the spectrum congestion problems and optimizing performance in terms of data packets dropping probability for all the active clusters of end-devices. The algorithm realizes a many-to-one mapping between the sets of LR-WPANs and available access bands (i.e., TV white space bands). It is based on a matching game with externalities and involves two-side preferences, i.e., clusters over bands and bands over clusters, respectively. The procedure provides high resource reuse, adaptation to changes of system conditions, and improvements on quality of service. Furthermore, a postmatching procedure is also discussed to ensure stability of the provided many-to-one matching. Finally, the good behavior of the matching approach is validated by providing performance comparisons with alternative schemes based on the random assignment, the Brelaz graph coloring algorithm applied in a modified form and potential game strategy.
An Efficient Resource Allocation Scheme for Applications in LR-WPANs based on a Stable Matching with Externalities Approach / Giulio Bartoli, Francesco Chiti, Romano Fantacci, Benedetta Picano. - In: IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY. - ISSN 0018-9545. - STAMPA. - 68:(2019), pp. 5893-5903. [10.1109/TVT.2019.2909136]
An Efficient Resource Allocation Scheme for Applications in LR-WPANs based on a Stable Matching with Externalities Approach
Giulio Bartoli;Francesco Chiti;Romano Fantacci
Membro del Collaboration Group
;PICANO, BENEDETTA
2019
Abstract
This paper deals with an efficient resource allocation algorithm for Wide-Area Low Rate Wireless Personal Area Networks (LR-WPANs), based on the IEEE 802.15.4m standard. The proposed scheme aims at lowering the spectrum congestion problems and optimizing performance in terms of data packets dropping probability for all the active clusters of end-devices. The algorithm realizes a many-to-one mapping between the sets of LR-WPANs and available access bands (i.e., TV white space bands). It is based on a matching game with externalities and involves two-side preferences, i.e., clusters over bands and bands over clusters, respectively. The procedure provides high resource reuse, adaptation to changes of system conditions, and improvements on quality of service. Furthermore, a postmatching procedure is also discussed to ensure stability of the provided many-to-one matching. Finally, the good behavior of the matching approach is validated by providing performance comparisons with alternative schemes based on the random assignment, the Brelaz graph coloring algorithm applied in a modified form and potential game strategy.I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.