In this paper, the average packet delay on IEEE 802.11 DCF under finite load traffic in multi-hop ad hoc networks is analyzed. We employ a Markov chain model to analyze the probability of transmission at each node in ...In this paper, the average packet delay on IEEE 802.11 DCF under finite load traffic in multi-hop ad hoc networks is analyzed. We employ a Markov chain model to analyze the probability of transmission at each node in an arbitrary slot and derive the channel access delay. We model each node using an M/G/1 queue and derive the queueing delay. The model is extended from analyzing the single-hop average packet delay to evaluating the end-to-end packet delay in multi-hop ad hoc networks without assuming the traffic to be in a saturation state. To validate our analytic results, we have done extensive simulation. The analytic and the simulation results match very well.展开更多
In this paper, a modified access mechanism named Constrained-send DCF (CDCF) is proposed to improve the performance of IEEE 802.11 DCF protocol. It is found that, in DCF, the transmission probability is higher than th...In this paper, a modified access mechanism named Constrained-send DCF (CDCF) is proposed to improve the performance of IEEE 802.11 DCF protocol. It is found that, in DCF, the transmission probability is higher than the reasonable value when the node number is greater than 4 under basic access scheme or than 17 under RTS/CTS scheme, and it results in serious collision. To avoid collision of high access loading, a constrained-send probability is introduced at the end of each back off procedure for the station transmitting. The performance of this mechanism is analyzed based on a 2-Dimension Markov analytical model, after that the optimum constrained-send probability is derived. Numerical results show that the CDCF mechanism has much better performance than DCF with respect to both system throughput and average packet delay. And under RTS/CTS scheme, although CDCF slightly improve the throughput performance (due to the natural good throughput performance of RTS/CTS-scheme DCF), it leads to a much better average packet delay performance compared to DCF. The CDCF keeps all the features of the IEEE 802.11 DCF protocol and is quite easy to implement.展开更多
A call admission control scheme is proposed for real-time services in packet-switched orthogonal frequency division multiplexing (OFDM) wireless cellular networks. The main idea of the proposed scheme is to use maxi...A call admission control scheme is proposed for real-time services in packet-switched orthogonal frequency division multiplexing (OFDM) wireless cellular networks. The main idea of the proposed scheme is to use maximum acceptance ratio to maintain maximum channel utilization for real-time services according to the desired packet-level and call- level quality-of-service (QoS) requirements. The acceptance ratio is periodically adjusted by using a time discrete Markov chain and Wiener prediction theory according to the varying traffic load. Extensive simulation results show that this algorithm maintains high channel utilization, even as it guarantees packet-level and call-level QoS requirements for real-time services.展开更多
基金the National Natural Science Foundation of China (Grant Nos. 60472078 and 90604013)
文摘In this paper, the average packet delay on IEEE 802.11 DCF under finite load traffic in multi-hop ad hoc networks is analyzed. We employ a Markov chain model to analyze the probability of transmission at each node in an arbitrary slot and derive the channel access delay. We model each node using an M/G/1 queue and derive the queueing delay. The model is extended from analyzing the single-hop average packet delay to evaluating the end-to-end packet delay in multi-hop ad hoc networks without assuming the traffic to be in a saturation state. To validate our analytic results, we have done extensive simulation. The analytic and the simulation results match very well.
基金Sponsored by the National Natural Science Foundation of China(Grant No.60832008)the National S&T Major Project (Grant No.2010ZX03003-002-02)the National Key Basic Research and Development Project (Grant No.2012CB316006)
文摘In this paper, a modified access mechanism named Constrained-send DCF (CDCF) is proposed to improve the performance of IEEE 802.11 DCF protocol. It is found that, in DCF, the transmission probability is higher than the reasonable value when the node number is greater than 4 under basic access scheme or than 17 under RTS/CTS scheme, and it results in serious collision. To avoid collision of high access loading, a constrained-send probability is introduced at the end of each back off procedure for the station transmitting. The performance of this mechanism is analyzed based on a 2-Dimension Markov analytical model, after that the optimum constrained-send probability is derived. Numerical results show that the CDCF mechanism has much better performance than DCF with respect to both system throughput and average packet delay. And under RTS/CTS scheme, although CDCF slightly improve the throughput performance (due to the natural good throughput performance of RTS/CTS-scheme DCF), it leads to a much better average packet delay performance compared to DCF. The CDCF keeps all the features of the IEEE 802.11 DCF protocol and is quite easy to implement.
基金the National Basic Research Program of China(2007CB310604)the National Natural Science Foundation of China(60772108).
文摘A call admission control scheme is proposed for real-time services in packet-switched orthogonal frequency division multiplexing (OFDM) wireless cellular networks. The main idea of the proposed scheme is to use maximum acceptance ratio to maintain maximum channel utilization for real-time services according to the desired packet-level and call- level quality-of-service (QoS) requirements. The acceptance ratio is periodically adjusted by using a time discrete Markov chain and Wiener prediction theory according to the varying traffic load. Extensive simulation results show that this algorithm maintains high channel utilization, even as it guarantees packet-level and call-level QoS requirements for real-time services.