hu / en

Megjelent Csercsik Dávid és szerzőtársa cikke az IEEE Tranasctions on Wireless Communications folyóiratban

IEEE Transactions on Wireless Communications

A publikáció témája, hogy hogyan lehet alkalmazni a közgazdaságtanból eredeztethető mechanizmusokat (többek között a kombinatorikus aukció egy speciális változatát), magas-megbízhatóságú, alacsony-latenciájú vezeték nélküli távközlési hálózatok esetén a csatorna-allokáció megoldásának problémájára.

Preallocation-based Combinatorial Auction for Efficient Fair Channel Assignments in Multi-Connectivity Networks

Dávid Csercsik, Eduard Jorswieck

Abstract:

We consider a general multi-connectivity framework, intended for ultra-reliable low-latency communications (URLLC) services, and propose a novel, preallocation-based combinatorial auction approach for the efficient allocation of channels. We compare the performance of the proposed method with several other state-of-the-art and alternative channel-allocation algorithms. The two proposed performance metrics are the capacity-based and the utility-based context. In the first case, every unit of additional capacity is regarded as beneficial for any tenant, independent of the already allocated quantity, and the main measure is the total throughput of the system. In the second case, we assume a minimal and maximal required capacity value for each tenant, and consider the implied utility values accordingly. In addition to the total system performance, we also analyze fairness and computational requirements in both contexts. We conclude that at the cost of higher but still plausible computational time, the fairness-enhanced version of the proposed preallocation based combinatorial auction algorithm outperforms every other considered method when one considers total system performance and fairness simultaneously, and performs especially well in the utility context. Therefore, the proposed algorithm may be regarded as candidate scheme for URLLC channel allocation problems, where minimal and maximal capacity requirements have to be considered.

2024

Jún

21

H

K

Sz

Cs

P

Sz

V

27

28

29

30

31

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

1

2

3

4

5

6

7

Következő hónap >
a

2024

Jún

21

H

K

Sz

Cs

P

Sz

V

27

28

29

30

31

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

1

2

3

4

5

6

7

Következő hónap >