Abstract
Two contention-based algorithms are proposed in this paper for establishing ad hoc Wireless Local Area Networks (WLANs). They are named uniform and geometric, respectively, based on the nature of the probabilistic model in the decision making process used in each algorithm. The main performance consideration in this paper is the network setup time each algorithm requires. It is shown that the network setup time is an explicit function of the total solicitation rounds required. The paper is, therefore, focused on deriving the distribution of the total solicitation rounds needed for setting up a network. It is shown analytically that the performance of uniform is better than that of geometric. It also derives the asymptotic lower and upper bounds for the average setup times for uniform.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R. Bagrodia, W. Chu, L. Kleinrock and G. Popek, Vision, issues, and architecture for nomadic computing, IEEE Personal Communications (December 1995) 14–27.
B. Bates, Wireless Networked Communications (McGraw Hill, 1994).
G. Birkhoff and S. MacLane, A Survey of Modern Algebra, revised edn. (Macmillan, New York, 1953).
K.-C. Chen, Medium access control of wireless LANs for mobile computing, IEEE Network Magazine (September 1994) 50–63.
W. Feller, An Introduction to Probability Theory and Its Applications, 2nd edn., Vol. 1 (Wiley, 1957).
Guest Editorial, IEEE Journal on Selected Areas in Communications (Wireless Ad Hoc Networks) 17(8) (1999) 1329–1332.
M. Ilyas, S. Hsu and L. Qian, Performance analysis of algorithmns for establishing ad hoc WLANs, in: International Conference on Computer Communications 1999 (ICCC '99), Vol. II, Tokyo, Japan, 14–16 September 1999, pp. 436–442.
D. Johnson and D. Maltz, Protocols for adaptive wireless and mobile networking, IEEE Personal Communications (February 1996) 34–42.
N. Johnson and S. Kotz, Urn Models and Their Application: An Approach to Modern Discrete Probability Theory (Wiley, 1997).
J.-D. Kumar and F. Proschan, Birthday problem with unlike probabilities, The Mathematical Monthly (January 1992) 10–12.
V. Li, Personal Communication Systems (PCS), Proceedings of IEEE 83(9) (1995) 1210–1243.
A.G. Munford, A note on the uniformity assumption in the birthday problem, The American Statistician 31(3) (1977) 119.
J. Padgett, C. Gunther and T. Hattori, Overview of wireless personal communications, IEEE Communications Magazine 33(1) (1995) 28–41.
R. Pandya, Emerging mobile and personal communication systems, IEEE Communications Magazine 33(6) (1995) 44–52.
C.-K. Toh, Wireless ATM and Ad-Hoc Networks (Kluwer Academic Publishers, 1997).
R. von Mises, Ñber Aufteilungs-und Besetzungs-wahrscheinlichkeiten, Revue de la Faculte des Sciences de l'Université d'Istanbul, N.S. 4 (1939) 145–163.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Hsu, S., Qian, L. & Ilyas, M. An Analytic Study of Two Probabilistic Models for Establishing Ad Hoc WLANs. Information Technology and Management 4, 55–67 (2003). https://doi.org/10.1023/A:1021876400313
Issue Date:
DOI: https://doi.org/10.1023/A:1021876400313