Abstract
Network capacity is a key characteristic to evaluate the performance of wireless networks. The goal of this paper is to study the capacity of wireless ad hoc relay network. In the model, there is at most n s source nodes transmitting signal simultaneously in the network and the arbitrarily complex network coding is allowed. The upper capacity bound of the network model are derived from the max-flow min-cut theorem and the lower capacity bound are obtained by the rate-distortion function for the Gaussian source. Finally, simulation results show that the upper network capacity will decrease as the number of source nodes is increased.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
P. Gupta, P. Kumar. The capacity of wireless networks. IEEE Trans. on Information Theory, 46 (2000)2, 388–404.
M. Grossglauser, David N. C. Tse. Mobility increases the capacity of ad hoc wireless networks. IEEE/ACM Trans. on Networking, 10(2002)4, 477–486.
M. Gastpar, M. Vetterli. On the capacity of wireless networks: the relay case. IEEE Infocom, New York, 2002, 1577–1586.
E. Lawler. Combinatorial Optimization Network and Matroid. Fort Worth, TX, Saunder College Pub, 1976, ch.4.
T. M. Cover, J. A. Thomas. Elements of Information Theory. New York, Wiley. 1991, 430–448.
I. E. Telatar. Capacity of mulit-antenna Gaussian channels. Europ. Trans. Telecommun., 10(1999)11, 585–595.
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported in part by the Chinese Ministry of Science and Technology for 863 Programs (No.2003AA12331005), and in part by the National Natural Science Foundation of China (No.60496351).
About this article
Cite this article
Dai, Q., Yao, W., Peng, J. et al. On the capacity region of wireless ad hoc relay networks. J. of Electron.(China) 23, 825–830 (2006). https://doi.org/10.1007/s11767-005-0050-9
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/s11767-005-0050-9