Abstract

Aiming at the problems existing in the current mechanisms of delay guarantee in wireless networks(i.e. poor scalability, coarse granularity for provided service levels, and improving delay performance at the expense of sacrificing some resource utilization), this paper puts forward both the idea of particle access and the corresponding access mechanism. In this paper, a traffic flow is modeled as a group of information particles that carry a certain amount of information and are valid for certain periods of time. Firstly, the definitions of information particles and the group of information particles are given. It is proved that the minimum reachable access bandwidth of an information particle group can be achieved by using the EDF(earliest deadline first) transmission strategy. Moreover, a fine-grained mechanism of delay guarantee based on the idea of particle access is proposed for the dynamic access environment in wireless networks. Extensive simulations are carried out for the application scenario of downlink transmissions, and it is shown that, in the case of heavy traffic loads, comparing with the rapid growth of the average packet delays and the packet loss rates in a legacy access mechanism, the proposed fine-grained access strategy based on the idea of particle access can also achieve the better performance on the average packet delays and the packet loss rates, and hence higher effective throughput is obtained. The research in this paper pave a new way for further improving quality of service (QoS) mechanisms of wireless networks.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call