![](bg5.png)
Figure 6: The 3-D plot of
)1(coll
p versus s and p.
By a comparison, the probability that a given
station participates in collision for non-persistent
CSMA with a number of
W contending slots equals
1/W and is independent of the number of contenders
(Koscielnik, Miskowicz, 2010).
4 CONCLUSIONS
We compare the maximum transmission
unreliability in the non-persistent CSMA and
persistent CSMA for the same average number of
contention slots in both schemes. In the persistent
CSMA, the latter equals simply 1/
p. In the non-
persistent CSMA, the contention window is constant
in each transmission cycle and equals
W slots.
As proved in (Koscielnik, Miskowicz, 2010), the
maximum probability of participating in a collision
in the non-persistent CSMA scheme is upper
bounded by 1/
W, that is, by the probability of a
selection of a single slot in the transmission attempt.
On the other hand, as follows from the present
paper, maximum probability of participating in a
collision by a given station, according to the
persistent CSMA scheme, is upper bounded by the
persistence level (
p), which a main parameter of the
protocol. Thus, the complementary results defined
by (14) are valid for the persistent CSMA scheme.
REFERENCES
Tay, Y. C., Jamieson, K., Balakrishnan, H., 2004.
“Collision-minimizing CSMA and its applications to
wireless sensor networks”, IEEE Journal on Selected
Areas in Communication, vol.22, pp.1048-1057.
Miśkowicz, M., Golański R., 2006. LON technology in
wireless sensor networking applications, Sensors, vol.
6, no. 1, pp. 30-48.
Miśkowicz, M, 2009. Average channel utilization of
CSMA with geometric distribution under varying
workload, IEEE Transactions on Industrial
Informatics, vol. 6, no. 2, pp.123-131, 2009.
Egea-López, E., Vales-Alonso, J. Martínez-Sala, A. S.,
Bueno-Delgado, M. V., M. V. García-Haro, J., 2007.
Performance evaluation of non-persistent. CSMA as
anti-collision protocol for active RFID tags”, Lecture
Notes in Computer Science LNCS 4517, pp. 279-289.
Kleinrock, L., Tobagi, F.A, 1975. Carrier sense multiple-
access modes and their throughput-delay
characteristics, IEEE Transactions on Communication,
vol. COM-23, no. 12, pp. 1400-1416.
Lam, S.S., 1980. A carrier sense multiple access protocol
for local networks, Computer Networks, vol. 4, no. 1,
pp. 21-32.
Bruno, R., Conti, M., Gregori, E., 2002. Optimization of
efficiency and energy consumption in p-persistent
CSMA-based wireless LANs, IEEE Transactions on
Mobile Computing, vol. 1, no. 1, pp. 10-31.
Calì, F., Cont, M., Gregori, E., 2000. Dynamic tuning of
the IEEE 802.11 protocol to achieve a theoretical
throughput limit, IEEE/ACM Transactions on
Networking, vol. 8, no. 6, pp. 785-799.
Miśkowicz, M., 2009. Access delay in LonTalk MAC
protocol, Computer Standards & Interfaces, vol. 31,
no. 3, pp. 548-556.
Bianchi, G., 1998. IEEE 802.11—Saturation throughput
analysis, IEEE Communications Letters, vol. 2, no. 12,
pp. 318-320.
Miśkowicz, M., Kościelnik, D., 2010. On the upper bound
of transmission unreliability in memoryless backoff
contention, Proceedings of IEEE International
Workshop on Factory Communication Systems WFCS
2010, Nancy, France, May 2010.
p s
ICINCO 2010 - 7th International Conference on Informatics in Control, Automation and Robotics
186