Skip to main content Accessibility help
×
Hostname: page-component-84b7d79bbc-fnpn6 Total loading time: 0 Render date: 2024-07-28T22:15:56.720Z Has data issue: false hasContentIssue false

6 - Delay Normalized Transmission Capacity

Published online by Cambridge University Press:  05 May 2015

Rahul Vaze
Affiliation:
Tata Institute of Fundamental Research, Mumbai
Get access

Summary

Introduction

In the first part of this book, we considered the single-hop model of a wireless network, where each source–destination pair is at a fixed distance from each other and performs direct communication between themselves. For the single-hop model, we introduced the concept of transmission capacity to characterize the spatial capacity and derived it for many different strategies such as scheduling, multiple antenna transmission, and two-way communication.

Even though the single-hop model is elegant, it is not realistic in a large wireless network, where the primary mode of operation is hop-by-hop communication from each source to its destination using multiple relay nodes. Three important distinctions between single-hop and multi-hop communications are i) routing protocol, finding optimal routes for each source and destination, ii) retransmissions, any relay can forward packet only after it receives it successfully, which potentially requires retransmissions, and iii) shared relay nodes that are used by many source–destination pairs.

In this second part of the book, we exclusively consider the multi-hop communication model for wireless networks. In this chapter, we begin by extending the transmission capacity framework to allow retransmissions using ARQ over multiple hops, and define a new notion called the delay normalized transmission capacity that normalizes the end-to-end throughput with the expected number of retransmissions required for successful delivery of any packet at the destination. We analyze the delay normalized transmission capacity for a simple multi-hop model, where each source–destination pair is at a fixed distance from each other and there are dedicated relays between each source and its destination. Even though this model is simple, it still allows us to capture the interplay of three important quantities: throughput, delay, and reliability, in a multi-hop wireless network.

Even with this simple model, the analysis of the delay normalized transmission capacity is quite involved, and the exact derived expressions are not in the simplest closed form.

Type
Chapter
Information
Random Wireless Networks
An Information Theoretic Perspective
, pp. 116 - 145
Publisher: Cambridge University Press
Print publication year: 2015

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1] D., Cox. 1962. Renewal Theory. Methuen & Co.
[2] A., Kumar, E., Altman, D., Miorandi, and M., Goyal. 2007. “New insights from a fixed-point analysis of single cell IEEE 802.11 WLANs.” 15 (3): 588–01.Google Scholar
[3] M., Haenggi. 2005. “On routing in random Rayleigh fading networks.”IEEE Trans. Wireless Commun. 4 (4): 1553–62.Google Scholar
[4] S., Weber, N., Jindal, R. K., Ganti, and M., Haenggi. 2008. “Longest edge routing on the spatial ALOHA graph.” In Global Telecommunications Conference, 2008. IEEE GLOBECOM 2008. IEEE. 1–5.Google Scholar
[5] K., Stamatiou, F., Rossetto, M., Haenggi, T., Javidi, J., Zeidler, and M., Zorzi. 2009. “A delay-minimizing routing strategy for wireless multi-hop networks.” In Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, 2009. WiOPT 2009. 7th International Symposium on June 2009 1–6.Google Scholar
[6] K., Stamatiou and M., Haenggi. 2010. “Random-access Poisson networks: Stability and delay.”IEEE Commun. Lett. 14 (11): 1035–37.Google Scholar
[7] K., Stamatiou and M., Haenggi. 2010. “The delay-optimal number of hops in poisson multi-hop networks.” In Proc. (ISIT) Symp. IEEE Int Information Theory. 1733–37.Google Scholar
[8] M., Haenggi. 2010. “Local delay in static and highly mobile Poisson networks with Aloha.” In Proc. IEEE Int Communications (ICC) Conf1–5.Google Scholar
[9] T., Cover and J., Thomas. 2004. Elements of Information Theory. John Wiley and Sons.
[10] M., Haenggi. 2004. “Twelve reasons not to route over many short hops.” In Proceedings of VTC2004-Fall Vehicular Technology Conference 2004 IEEE 60th, vol. 5. 3130–34.Google Scholar
[11] F., Baccelli, B., Blaszczyszyn, and P., Muhlethaler. 2006. “An ALOHA protocol for multihop mobile wireless networks.”IEEE Trans. Inf. Theory 52 (2): 421–36.Google Scholar
[12] J., Andrews, S., Weber, M., Kountouris, and M., Haenggi. 2010. “Random access transport capacity.”IEEE Trans. Wireless Commun. 9(6): 2101–11.Google Scholar
[13] R., Vaze. 2011. “Throughput-delay-reliability tradeoff with ARQ in wireless ad hoc networks.”IEEE Trans. Wireless Commun. 10(7): 2142–49.Google Scholar
[14] F., Baccelli, B., Blaszczyszyn, and M.-O., Haji-Mirsadeghi. 2011. “Optimal paths on the space-time SINR random graph.”Adv. Appl. Prob. 43 (1): 131–50.Google Scholar
[15] R., Ganti and M., Haenggi. 2007. “Dynamic connectivity and packet propagation delay in ALOHA wireless networks.” In Proceedings of IEEE Asilomar, Pacific Grove, CA.

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×