In this paper, we propose an entanglement scheme for long-distance, constant-fidelity communication in quantum networks. We discuss the optimal rate of entanglement that allows for constant fidelity in both elementary and multihop links. We also discuss time complexity and propose the mathematical order of the rate capacity for an entanglement scheme. We propose a recursive entanglement scheme, a simultaneous entanglement scheme, and an adjacent entanglement scheme mathematically analyze these schemes. The rate capacity of the recursive and simultaneous entanglement schemes is Ω(1/en ), but the adjacent entanglement scheme performs better, providing a rate of Ω(1/n ).