A Service-Differentiated Access Algorithm for Future Cooperative Networks

In this paper, we propose a new cooperative random access strategy for future cooperative networks. This scheme considers the different requirements of services, and exploits the cooperative relaying nature for multi-channel environments, e.g. orthogonal frequency division multiplexing access (OFDMA). Due to differentiation of services and definition of special channels, those users with real-time (RT) request can reserve the access channels in advance, while others with non-real-time (NRT) services can access to the BS or the nearest distributed relay stations (DRSs), which are introduced for cooperative relaying, through sharing those channels remained. The analyses and numerical results demonstrate that our scheme can achieve high throughput, low collision probability and low access delay compared with conventional slotted Aloha.