Max-utility subcarrier allocation for heterogeneous services in wireless OFDM system

In future wireless network, one user will require multiple homogeneous or heterogeneous services simultaneously. Then, the scheduling algorithm is not only responsible for assigning a resource block to different users but also sharing the assigned resource block among multiple services for one user. Most of the traditional scheduling algorithms are designed to serve one service per user, and cannot be applied directly to this scenario because of the fairness criterion. This article focuses on adaptive resource allocation for multiple services per user at the downlink of orthogonal frequency division multiplexing （OFDM） based system. This article addresses this integrative resource scheduling problem based on utility function. First, the optimal algorithm for dynamic subcarrier allocation and share is deduced for homogeneous best-effort service system. Then the algorithm is extended to heterogeneous services system by classifying the delay sensitive service according to the head-of-line packet delay. The design goal is to maximize aggregate utility function to exploit multiuser diversity gain to the greatest extent even as guaranteeing quality of service （QoS） for delay sensitive service.

Jitter analysis of real-time services in IEEE 802.15.4 WSNs and wired IP concatenated networks

It is challenging and significant to explore the impacts of non-real-time services on real-time services from the perspective of jitter. Most of current researches on jitter made too many mathematical hypotheses on networks and traffic. This paper puts forward a tandem queuing model to characterize the real communication scenario where heterogeneous services are served by IEEE 802.15.4 wireless sensor networks（WSNs）, and then the packets served successfully are fed to Internet protocol（IP） networks. By analyzing the contention access processes in IEEE 802.15.4 WSNs, the authors derive the departure processes of the two types of services, i.e., the arrival processes of IP networks. The IP network is modeled as a queuing system, in which the real-time service is forwarded accompanied by the non-real-time service. Investigating the jitter of real-time services is intractable. Therefore, this paper abstracts this problem as a dynamic queuing system evolving on a dynamic time interval. Referring the transient analysis method（TAM）, this paper obtains the queue length in a random time interval which is scaled by the arrival of real-time services. Queue length evolution is closely connected with the jitter. Benefiting from the derivation in probability generation domain, the jitter of real-time services is obtained.