A Tandem Queue Model for Performance Analysis in Multihop Wireless Networks

We present a tandem queueing model for performance analysis and engineering of multihop wireless networks. To solve the queueing model, a direct (or exact) method and a decomposition method are proposed. The proposed decomposition method reduces the computational complexity significantly which requires us to solve L single queues instead of a full tandem system of L queues. The tandem queue model captures a batch arrival process and multi-rate transmission achieved by adaptive modulation and coding. We obtain the queue length distribution and derive all end-to-end performance measures including loss probability, average delay. The proposed decomposition approach is validated and some interesting insights into the system performance and guidelines for system design are highlighted.

[1]  J. Morrison Two Discrete-Time Queues in Tandem , 1979, IEEE Trans. Commun..

[2]  Martin Haenggi,et al.  Delay performance of different MAC schemes for multihop wireless networks , 2005, GLOBECOM '05. IEEE Global Telecommunications Conference, 2005..

[3]  Limin Hu,et al.  Distributed code assignments for CDMA packet radio networks , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.

[4]  Ian F. Akyildiz,et al.  A survey on wireless mesh networks , 2005, IEEE Communications Magazine.

[5]  Michele Zorzi,et al.  Queueing Analysis for GBN and SR ARQ Protocols under Dynamic Radio Link Adaptation with Non-Zero Feedback Delay , 2007, IEEE Transactions on Wireless Communications.

[6]  Gerhard Fettweis,et al.  Relay-based deployment concepts for wireless and mobile broadband radio , 2004, IEEE Communications Magazine.

[7]  Mohamed-Slim Alouini,et al.  Adaptive Modulation over Nakagami Fading Channels , 2000, Wirel. Pers. Commun..

[8]  Chai-Keong Toh,et al.  Evaluating the communication performance of an ad hoc wireless network , 2002, IEEE Trans. Wirel. Commun..