We investigate the multiple teleportation with some nonmaximally entangled channels. The efficiencies of two multiple teleportation protocols, the separate multiple teleportation protocol (SMTP) and the global multiple teleportation protocol (GMTP), are calculated. We show that GMTP is more efficient than SMTP. PACS numbers: 03.67.Hk Quantum teleportation [1] is one of the most significant components in quantum information processing, which allows indirect transmission of quantum information between distant parties by using previously shared entan-glement and classical communication between them. Indeed , it is considered as a basic building block of quantum communication nowadays. Not only is it one of the most intriguing phenomena in the quantum world, but also a very useful tool to perform various tasks in quantum information processing and quantum computing [2, 3]. For example, controlled quantum gates are implemented by means of quantum teleportation, which is very important in linear optical quantum computation [4, 5]. Recently, the original scheme for teleporting a qubit has been widely generalized in many different ways [6, 7, 8, 9, 10, 11, 12, 13, 14]. In the previous telepor-tation protocols and in many other applications of tele-portation, we want to construct an unknown input state with unity fidelity at another location while destroying the original copy, which is always achieved if two parties share a maximally entangled state. However, it might happen that our parties do not share a maximally entangled state. This limitation can be overcome by distilling out of an ensemble of partially entangled states a maximally entangled one [15]. But this approach requires a large amount of copies of partially entangled states to succeed. Another way to achieve unity fidelity teleporta-tion with limited resources is based on the probabilistic quantum teleportation protocols of Refs. [6, 7, 8]. Recently, in an interesting work, Mod lawska and Grudka [16] showed that if the qubit is teleported several times via some nonmaximally entangled states, then the "errors" introduced in the previous teleportations can be corrected by the "errors" introduced in the following teleportations. Their strategy was developed in the framework of the scheme proposed in Ref.[5] for linear optical teleportation. In this paper, we show that this feature of the multiple teleportation of Ref.[16] is not * Electronic address: flyan@mail.hebtu.edu.cn restricted to the teleportation scheme stated in Ref.[5]. Based on the general teleportation language of the original proposal shown in Ref.[1], we compare the efficiencies of two multiple teleportation protocols, the separate multiple teleportation and the global multiple teleportation. In the former protocol, a complete teleportation including error correction is strictly executed by neighboring parties. On the other hand, in the latter protocol, all errors introduced in the teleportation are corrected by the final receiver. We find the global multiple teleportation is more efficient than...