Quality-of-service performance bounds in wireless multi-hop relaying networks

Access Full Text

Quality-of-service performance bounds in wireless multi-hop relaying networks

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Add to cart
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)
Add to cart

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IET Communications — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

© The Institution of Engineering and Technology
Published

The theoretical analysis on quality-of-service (QoS) performances is required to provide the guides for the developments of the next-generation wireless networks. As a good analysis tool, the probabilistic network calculus with moment generating functions (MGFs) recently can be used for delay and backlog performance measures in wireless networks. Different from the existed studies which mostly focused on the single-hop networks with single-user under a two state Markov channel model, this study develops an analytical framework for wireless multi-hop relaying networks under the finite-state Markov channel by using probabilistic network calculus with MGFs. By using the concatenation character of network calculus, the authors regard a two-hop wireless relaying channel as a single server equivalently, which consisting of two dynamic servers in series. When the single-user model is straightforwardly extended and applied in multi-user scenarios, the state space of service process is increased exponentially with the number of users, which is only applicable in case of very small user number. Then, in order to avoid the limitation of user number, the authors propose to reflect the multi-user effects by using the equivalent data rate of the modified service process, whose transition and stationary probabilities are kept unchanged with those in single-user scenarios. Next, delay and backlog bounds of multi-hop wireless relaying networks are derived with the proposed analytical framework. Simulation results show that analytical bounds match simulation results, whose accuracy depends on the required violation probability. The effectiveness of the relaying techniques in improving the performances is also demonstrated.

Inspec keywords: quality of service; Markov processes; multi-access systems; radio networks

Other keywords: wireless multi-hop relaying networks; quality-of-service; probabilistic network calculus; single-user model; next-generation wireless networks; Markov channel model; wireless relaying channel; multi-user scenarios; moment generating functions; performance bounds

Subjects: Markov processes; Radio links and equipment; Multiple access communication

References

    1. 1)
    2. 2)
      • 3GPP TR 36.814 V1.4.1: ‘Further advancements for E-UTRA physical layer aspects’. March 2010.
    3. 3)
      • Fidler, M.: `An end-to-end probabilistic network calculus with moment generating functions', IFIP Int. Workshop on Quality of Service, June 2006, p. 261–270.
    4. 4)
      • D.J. Goodman . (1997) Wireless personal communications.
    5. 5)
      • C. Li , A. Burchard , J.A. Liebeherr . Network calculus with effective bandwidth. IEEE/ACM Trans. Netw. , 6 , 1442 - 1453
    6. 6)
      • C.S. Chang . (2000) Performance guarantees in communication networks.
    7. 7)
      • Fidler, M.: `A network calculus approach to probabilistic quality of service analysis of fading channels', IEEE Global Telecommunications Conf., 2006, p. 1–6.
    8. 8)
      • J.Y. Le Boudec , P. Thiran . (2004) Network calculus a theory of deterministic queuing systems for the internet.
    9. 9)
      • IEEE 802.16m-08/004r5: ‘IEEE 802.16m evaluation methodology document (EMD)’. January 2009.
    10. 10)
      • IEEE 802.16m-07/002r10: ‘IEEE 802.16m System requirements’. January 2010.
    11. 11)
      • Q. Yin , Y. Jiang , S. Jiang , P.Y. Kong . Analysis of generalized stochastically bounded bursty traffic for communication networks. IEEE Local Comput. Netw. , 141 - 149
    12. 12)
      • K. Zheng , Y. Wang , L. Lei , W. Wang . Cross-layer queuing analysis on multihop relaying networks with adaptive modulation and coding. IET Commun. , 3 , 295 - 302
    13. 13)
      • Jiang, Y., Emstad, P.J.: `Analysis of stochastic service guarantees in communication networks: a server model', IFIP Int. Workshop on Quality of Service, June 2005, p. 233–245.
    14. 14)
    15. 15)
      • F. Agharebparast , V.C.M. Leung . Modeling wireless link layer by network for efficient evaluations of multimedia QoS. IEEE Int. Conf. on Communications , 1256 - 1260
    16. 16)
      • F.P. Kelly . (1996) Notes on effective bandwidths. Number 4 in Royal Statistical Society Lecture Notes.
    17. 17)
      • D. Starobinski , M. Sidi . Stochastically bounded burstiness for communication networks. IEEE Trans. Inf. Theory , 1 , 206 - 212
    18. 18)
      • M.H. Ahmed , I. Syed , H. Yanikomeroglu . On the performance of time division multiple access-based multihop fixed cellular networks with respect to available frequency carriers. IET Commun. , 9 , 1196 - 1204
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-com.2009.0794
Loading

Related content

content/journals/10.1049/iet-com.2009.0794
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading