Routing and Scheduling Algorithms for Non-Cooperative Multimedia Relay Network

In this study, we propose a new routing and scheduling algorithm for a relay network of Koinonia V2.0 in which each station transmits either multimedia data or multimedia streaming. Different from previous related works, all stations are used by altruistic users who don´t want to cooperate with each other. With the proposed algorithm, master stations compute paths for each single slave station and allocate divisible wireless resources to each slave station. The system with the proposed scheme reaches Nash Equilibrium Points (NEPs) per every single superframe. Simulation results show that the proposed scheme provides all slave stations with the best path which efficiently balances the capacities of relay users in the two hops.