In the Internet of Things（IoT）, various battery-powered wireless devices are connected to collect and exchange data, and typical traffic is periodic and heterogeneous. Polling with power management is a very promisi...In the Internet of Things（IoT）, various battery-powered wireless devices are connected to collect and exchange data, and typical traffic is periodic and heterogeneous. Polling with power management is a very promising technique that can be used for communication among these devices in the IoT. In this paper, we propose a novel and scalable model to study the delay and the power consumption performance for polling schemes with power management under heterogeneous settings（particularly the heterogeneous sleeping interval）. In our model,by introducing the concept of virtual polling interval, we successfully convert the considered energy-efficient polling scheme into an equivalent purely-limited vacation system. Thus, we can easily evaluate the mean and variance of the delay and the power consumption by applying existing queueing formulae, without developing a new theoretical model as required in previous works. Extensive simulations show that our analytical results are very accurate for both homogeneous and heterogeneous settings.展开更多
This paper presents an algorthmic procedure for a busy-period subcomponent analysis of bulkqueues. A component of interest for many server queues is the period tto reduce congestion froma level k to level k-1. For an ...This paper presents an algorthmic procedure for a busy-period subcomponent analysis of bulkqueues. A component of interest for many server queues is the period tto reduce congestion froma level k to level k-1. For an M(x)/M/c system with the possibility of total or partial rejection ofbatches, it is demonstrated that the expected length of busy periods, the proportion of delayed batchand the steady state queue length probabilities can be easily obtained. The procedure is based on thenested partial sums and monotonic properties of expected lengths of the busy periods.展开更多
Although the medium access control （MAC） signaling has been well-defined in the 3rd generation partnership project （3GPP） long term evolution （LTE） specifications, the scheduling algorithm crucial to guarantee Q...Although the medium access control （MAC） signaling has been well-defined in the 3rd generation partnership project （3GPP） long term evolution （LTE） specifications, the scheduling algorithm crucial to guarantee QoS performance, still remains as open issues. In this article, a traffic-based queue-aware scheduling （TQS） algorithm is proposed for evolved nodeB＇s （eNB＇s） MAC scheduler in 3GPP LTE broadband wireless networks. The proposed TQS is divided into three sub-algorithms： firstly, the authors propose a traffic model construction （TMC） algorithm which can construct a discrete-time Markov-modulated Poisson process （dMMPP） to represent each flow. Secondly, a newly traffic state estimation （TSE） algorithm is designed to obtain the queue＇s analytical statistics. Thirdly, based on the derived results of TSE and the channel states, a scheduling action decision （SAD） algorithm is presented that can adaptively allocate bandwidth to flows by considering both queue states and spectrum efficiency. Simulation shows that the TMC and TSE algorithm can capture the fluctuation of traffic and queue accurately. Moreover, compared with a widely accepted traffic-based scheduling algorithm, the proposed TQS has better average queue length and overflow probability performance.展开更多
基金supported by Macao FDCT-MOST grant 001/2015/AMJ, Macao FDCT grants 013/2014/A1 and 005/2016/A1the National Natural Science Foundation of China (Nos. 61373027 and 61672321)the Natural Science Foundation of Shandong Province (No. ZR2012FM023)
文摘In the Internet of Things（IoT）, various battery-powered wireless devices are connected to collect and exchange data, and typical traffic is periodic and heterogeneous. Polling with power management is a very promising technique that can be used for communication among these devices in the IoT. In this paper, we propose a novel and scalable model to study the delay and the power consumption performance for polling schemes with power management under heterogeneous settings（particularly the heterogeneous sleeping interval）. In our model,by introducing the concept of virtual polling interval, we successfully convert the considered energy-efficient polling scheme into an equivalent purely-limited vacation system. Thus, we can easily evaluate the mean and variance of the delay and the power consumption by applying existing queueing formulae, without developing a new theoretical model as required in previous works. Extensive simulations show that our analytical results are very accurate for both homogeneous and heterogeneous settings.
文摘This paper presents an algorthmic procedure for a busy-period subcomponent analysis of bulkqueues. A component of interest for many server queues is the period tto reduce congestion froma level k to level k-1. For an M(x)/M/c system with the possibility of total or partial rejection ofbatches, it is demonstrated that the expected length of busy periods, the proportion of delayed batchand the steady state queue length probabilities can be easily obtained. The procedure is based on thenested partial sums and monotonic properties of expected lengths of the busy periods.
基金supported by the National Youth Science Fund Project(61302080)the Specialized Research Fund for the Doctoral Program of Higher Education(20120005120010)the General Program of National Natural Science Foundation of China(61271182)
文摘Although the medium access control （MAC） signaling has been well-defined in the 3rd generation partnership project （3GPP） long term evolution （LTE） specifications, the scheduling algorithm crucial to guarantee QoS performance, still remains as open issues. In this article, a traffic-based queue-aware scheduling （TQS） algorithm is proposed for evolved nodeB＇s （eNB＇s） MAC scheduler in 3GPP LTE broadband wireless networks. The proposed TQS is divided into three sub-algorithms： firstly, the authors propose a traffic model construction （TMC） algorithm which can construct a discrete-time Markov-modulated Poisson process （dMMPP） to represent each flow. Secondly, a newly traffic state estimation （TSE） algorithm is designed to obtain the queue＇s analytical statistics. Thirdly, based on the derived results of TSE and the channel states, a scheduling action decision （SAD） algorithm is presented that can adaptively allocate bandwidth to flows by considering both queue states and spectrum efficiency. Simulation shows that the TMC and TSE algorithm can capture the fluctuation of traffic and queue accurately. Moreover, compared with a widely accepted traffic-based scheduling algorithm, the proposed TQS has better average queue length and overflow probability performance.
