Overall Delay Analysis of IEEE 802.16 Network

Andreev, Sergey; Saffer, Zsolt; Anisimov, Alexey

doi:10.1109/iccw.2009.5208110

Cited by 9 publications

(8 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It accounts for the restrictions of the system model and was previously used in [7], [16], [14] and [17]. According to [24] we set the typical simulation parameters and summarize them in Table 1.…”

Section: Numerical Results and Conclusionmentioning

confidence: 99%

“…The analytical model enables the extension for the case of the noisy channel. Finally, the proposed analytical model could be modified to account also for the unicast polling of the SSs incorporating the models of [16] and [17].…”

Section: Numerical Results and Conclusionmentioning

confidence: 99%

“…The above summary implies that contention-based polling is the most widespread reservation mechanism in IEEE 802.16. Moreover, it is more difficult to analyze it due to its randomized nature in comparison to the analysis of the contention-free mechanism [16], [17]. Below we formulate a set of assumptions and detail the joint model to account for both the reservation and the scheduling stages.…”

Section: Ieee 80216 Short Summarymentioning

confidence: 99%

See 2 more Smart Citations

Upper Bound on Overall Delay in Wireless Broadband Networks with Non Real-Time Traffic

Andreev

Saffer

Turlikov

et al. 2010

Analytical and Stochastic Modeling Techniques and Applications

View full text Add to dashboard Cite

Abstract. In this paper we consider the non real-time traffic in IEEE 802.16-based wireless broadband networks with contention-based bandwidth reservation mechanism. We introduce a new system model and establish an upper bound on the overall data packet delay. The model enables symmetric Poisson arrival flows and accounts for both the reservation and the scheduling delay components. The analytical result is verified by simulation.

show abstract

Section: Numerical Results and Conclusionmentioning

confidence: 99%

Section: Numerical Results and Conclusionmentioning

confidence: 99%

Section: Ieee 80216 Short Summarymentioning

confidence: 99%

See 1 more Smart Citation

Upper Bound on Overall Delay in Wireless Broadband Networks with Non Real-Time Traffic

Andreev

Saffer

Turlikov

et al. 2010

Analytical and Stochastic Modeling Techniques and Applications

View full text Add to dashboard Cite

show abstract

“…First, the operations of framebased systems are executed frame by frame, and the continuous-time queueing models cannot characterize the system states change at each frame boundary. According to the report of Andreev et al [24], the overall delay of a tagged packet in WiMAX network, from its arrival at the uplink queue to the end of its transmission, includes three parts, (1) interval of polling, (2) interval of scheduling, and (3) interval of delivery, which are shown in Figure 2. In addition, most previous studies [3,[21][22][23] only considered the polling interval, but ignored the intervals from scheduling and transmission which likely result in inaccurate prediction.…”

Section: Related Workmentioning

confidence: 99%

“…As Kobayashi and Konheim [2] emphasized the accuracy of discrete-time queueing model in the performance analysis of the framebased systems, in our previous work [3], we made an effort in applying the discrete-time models to capture the synchronous property of WiMAX networks which was overlooked by continuoustime queueing models. Although all the delay components are considered within service time in [24], the service time ignores the bandwidth allocation and is assumed to be deterministic. According to the report of Andreev et al [24], the overall delay of a tagged packet in WiMAX network, from its arrival at the uplink queue to the end of its transmission, includes three parts, (1) interval of polling, (2) interval of scheduling, and (3) interval of delivery, which are shown in Figure 2.…”

Section: Related Workmentioning

confidence: 99%

Using GI‐G‐1 queuing model for rtPS performance evaluation in 802.16 networks

Kao¹,

Chuang²

2011

Int J Communication

View full text Add to dashboard Cite

Among the scheduling services, rtPS (real-time polling service) is designated for real-time applications. Among three packet delay intervals, performance effect on polling interval has been widely studied, but less on the intervals of scheduling and delivery. To evaluate the performance of delay-sensitive rtPS applications, instead of using continuous queueing model, a discrete-time GI-G-1 model, which considers intervals of polling, scheduling, and delivery, is proposed. By taking VoIP as a typical rtPS application, the transmission latency under different QoS settings, polling probability, and traffic load are presented. The latency is also compared among various codec schemes. The results indicate that when the codec rate is either fulfilled or dissatisfied by the promised bandwidth of service levels, the performance is highly dependent upon the polling probability, no matter what the traffic condition is. However, if the codec rate is in between the promised bandwidth of various service levels, the polling probability is a dominant factor in light traffic environment, while the settings on QoS parameters will strongly determine the performance in heavy traffic situation. In addition to the verification using simulation, the bandwidth utilization derived from the GI-G-1 model can be applied to improve the serving capacity of base stations. Copyright (c) 2011 John Wiley & Sons, Ltd

show abstract

An efficient and adaptive channel handover procedure for cognitive radio networks

Kahraman

Buzluca

2013

Wirel. Commun. Mob. Comput.

View full text Add to dashboard Cite

In designing cognitive radio systems, one of the most critical issues is handling the channel handover process (CHP). The CHP consists of spectrum sensing, spectrum decision, negotiation on the common control channel, and adjustment of frequency and modulation settings, and such, it can be a time-consuming process. Consequently, initiating the CHP after each detected user activity (UA) can decrease the aggregate spectrum utilization. To alleviate this problem, we introduce a novel handover strategy to find the optimal trade-off between the durations of the CHP and UAs. With the use this model, secondary users (SUs) track only local information on their current data channel to make the decision to initiate the CHP or to wait for the termination of the ongoing UA. The system adapts to the dynamic conditions of the data channels and reduces the frequency of handovers to increase throughput and decrease access delay. We give analytical utilization bounds for SUs and also compare the performance of our model to those of other channel handover strategies by using extensive simulations. Our results for channels with heterogeneous loads and dynamic environments show that this model can clearly decrease the frequency of handover and consequently increase the aggregate SU utilization.

show abstract

Overall Delay Analysis of IEEE 802.16 Network

Cited by 9 publications

References 8 publications

Upper Bound on Overall Delay in Wireless Broadband Networks with Non Real-Time Traffic

Upper Bound on Overall Delay in Wireless Broadband Networks with Non Real-Time Traffic

Using GI‐G‐1 queuing model for rtPS performance evaluation in 802.16 networks

An efficient and adaptive channel handover procedure for cognitive radio networks

Contact Info

Product

Resources

About