I. Cidon and M. Sidi, "The Effect of Capture on Collision Resolution Algorithms," IEEE Transactions on Communications 33(4), pp. 317-324 (April 1985).  Home/Search   Document Not in Database   Summary   Related Articles   Check

....to treat the receipt of corrupted feedback by a station as a collision show superior performance for throughput values greater than approximately 0.2, whereas, at low throughput values, there is relatively little difference in the performance among the various approaches studied. Cidon and Sidi [Sidi85, Cidon85] consider environments with capture, i.e. systems where while more than one packet are transmitted simultaneously, stations can still receive one of the packets successfully. In [Cidon85] they suggest extensions to the algorithms for the two situations in which the receiver can and cannot ....

....relatively little difference in the performance among the various approaches studied. Cidon and Sidi [Sidi85, Cidon85] consider environments with capture, i.e. systems where while more than one packet are transmitted simultaneously, stations can still receive one of the packets successfully. In [Cidon85] they suggest extensions to the algorithms for the two situations in which the receiver can and cannot distinguish between success slots and capture slots. In particular, the authors present a class of retransmission schemes for packets that have been transmitted during capture slots but have not ....

I. Cidon and M. Sidi, "The Effect of Capture on Collision Resolution Algorithms," IEEE Transactions on Communications 33(4), pp. 317-324 (April 1985).

....the mobile units to the base stations on each reception. It is argued that ALOHA is quite robust in an overlapping transmission cell environment. Although theoretically pure slotted ALOHA has a maximum throughput of 1=e, in a practical implementation there is the possibility of capture [Cidon 85] in which a collision between two sources is not necessarily destructive [Namislo 84] Simulation of a realistic propagation model [Porter 94] suggests that throughput of approximately half the bit rate are achievable. The combination of capture and large scale diversity also has a large impact ....

....traffic, a number of features of the CSMA AED protocol are identified as the potential candidates for further augmentation. Incorporating a MAC layer traffic priority structure would further enhance the protocol capabilities for transporting multiservice traffic. Introduction of capture [Cidon 85] and the adaptive power control with a suitable antenna diversity scheme may also prove to be useful for the CSMA AED performance enhancement. Another interesting approach would be to incorporate some synchronisation strategy for the base stations, where by exchanging synchronisation messages ....

I. Cidon and M. Sidi, "The Effect of Capture on Collision-Resolution Algorithms, " IEEE Transactions on Communications, vol. com-33, April 1985, pp. 317-324.

....for each transmission attempt by the mobile. 2.4. 3 Performance considerations Theoretically pure slotted ALOHA has a maximum throughput of 1=e, in a practical implementation there is the possibility of capture in which a collision between two sources is not necessarily destructive [Nam84] CS85] For perfect capture, that is where one of any colliding cells will be received correctly, the throughput approaches the capacity of the base station and capture improves the performance of all sources in the system, not just those close to the base [GS87] Simulation of a realistic propagation ....

I. Cidon and M. Sidi. The effect of capture on collision resolution algorithms. IEEE Trans. Comm., 33(4):317--324, April 1985.

....is based on the tree collision resolution algorithm (CRA) Ill, 8] while that in [6] is based on Gallager s 0. 487 algorithm [4] 10] Erasures have been handled in [3] A deterministic capture model in which the nodes of the network are divided into priority groups has been studied in [2], 7] In this paper, we propose and analyze (in Section HI) the performance of tree like algorithms that can handle erasures, captures, and noise errors. The algorithms are similar to those presented in [3] A remarkable feature of these algorithms is that they ensure that all packets are ....

....the erased packets, whenever the arrival rate of new packets to the system is less than the maximal throughput that the algorithms can support. An example is given which shows that, in practice, the positive effect of captures compensates the negative effect of erasures. As opposed to [2], 7] where capture has been modeled as a deterministic phenomena, the model for capture used in this paper is probabilistic and therefore more realistic. This model motivates a new approach (introduced in Section IV) to effectively exploit the capture phenomena. This approach incorporates a ....

[Article contains additional citation context not shown here]

I. Cidon and M. Sidi, "The effect of capture on collision resolution algorithms," IEEE Trans. Commun., vol. COM-33, pp. 317-324, Apr. 1985.

....feedback. The best upper bound known to date is 0.568 and is due to Tsybakov and Likhanov [53] Practical multiple access communication systems are prone to various types of errors. Collision resolution protocols that operate in presence of noise errors, erasures and captures have been studied in [9], 10] 12] 42] 54] Collision resolution protocols yielding high throughputs for general arrival processes (even if their statistics are unknown) were developed in [11] 21] The expected packet delay of the binary tree protocol has been derived in [15] 51] Bounds on the expected packet ....

I. Cidon and M. Sidi, The Effect of Capture on Collision-Resolution Algorithms, IEEE Trans. Commun., 33 (4), 317-324, April 1985.

....or because of fading problems. Note that whenever a capture occurs, an ACK is sent with the identity of the node that captured the receiver. Multiple access algorithms which handle deterministic captures, in which the nodes of the network are divided into priority groups have been studied in [2], 9] Models that considered probabilistic captures were studied in [3] 8] There it has been assumed that the probability of a capture in a slot may depend on the number of users that transmit during that slot, but is independent from slot to slot, i.e. the capture phenomenon has been assumed ....

I. Cidon and M. Sidi, "The Effect of Capture on Collision Resolution Algorithms", IEEE Trans. Commun., Vol. COM--33, pp. 317--324, Apr. 1985.

No context found.

I. Cidon and M. Sidi, "The Effect of Capture on Collision Resolution Algorithms," IEEE Transactions on Communications 33(4), pp. 317-324 (April 1985).

No context found.

I. Cidon and M. Sidi, "The effect of capture on collision resolution algorithms," IEEE Trans. Commun., Vol.COM-33, pp.317-324, April 1985.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC