Skip to main content
U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

Capacity of Random Wireless Networks: Impact of Cooperative Network Coding

Published

Author(s)

Yi Qian, Kejie Lu, Shengli Fu

Abstract

The throughput capacity of random wireless networks has been studied extensively in the literature. Nevertheless, most existing studies are based on the assumption that each transmission has one sender and one receiver. In our recent study, we have proposed a fundamentally different transmission scheme, i.e., the cooperative network coding scheme, in which data on opposite directions can be delivered to the same intermediate node simultaneously. In this paper, we investigate the impact of cooperative network coding on the throughput capacity of random wireless networks. Our analysis show that the cooperative network coding scheme can substantially improve the throughput capacity. Tighter bounds for the capacity in two-dimensional random wireless networks are proved in this paper. Also, we derive an achievable lower bound for random wireless networks with network coding.
Proceedings Title
Proceedings of IEEE ICC 2008
Conference Dates
May 19-23, 2008
Conference Location
Beijing, CH
Conference Title
IEEE ICC (International Conference on Communications)

Keywords

capacity, cooperative, network coding, wireless network

Citation

Qian, Y. , Lu, K. and Fu, S. (2008), Capacity of Random Wireless Networks: Impact of Cooperative Network Coding, Proceedings of IEEE ICC 2008, Beijing, CH, [online], https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=51347 (Accessed December 15, 2024)

Issues

If you have any questions about this publication or are having problems accessing it, please contact reflib@nist.gov.

Created May 19, 2008, Updated February 19, 2017