Abstract
This paper undergoes quantitative analyses on fundamental properties of ad hoc networks including estimating the number of hiddenterminal pairs and the number of exposed-terminal sets. To obtain these results, we propose a paradigm to systematically derive exact formulas for a great deal of subgraph probabilities of random geometric graphs. In contrast to previous work, which established asymptotic bounds or approximation, we obtain closed-form formulas that are fairly accurate and of practical value.
Chapter PDF
Similar content being viewed by others
Keywords
References
Bettstetter, C.: On the minimum node degree and connectivity of a wireless multihop network. In: MobiHoc, pp. 80–91 (2002)
Bharghavan, V., Demers, A., Shenker, S., Zhang, L.: MACAW: a media access protocol for wireless LANs. In: ACM SIGCOMM, pp. 212–215 (1994)
Bollobas, B.: Random Graphs. Academic Press, London (1985)
Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. Macmillan Press, Basingstoke (1976)
Broth, J., Maltz, D.A., Johnson, D.B., Hu, Y.-C., Jetcheva, J.: A performance comparison of multi-hop wireless ad hoc network routing protocols. In: Mobicom, pp. 85–97 (1998)
Chang, C.-L., Lee, R.C.T.: Symbolic Logic and Mechanical Theorem Proving. Academic Press, New York (1973)
Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. Discrete Mathematics 86, 165–177 (1990)
Das, B., Bharghavan, V.: Routing in ad-hoc networks using minimum connected dominating sets. In: IEEE International Conference on Communications, pp. 376–380 (1997)
DÃaz, J., Penrose, M.D., Petit, J., Serna, M.: Convergence theorems for some layout measures on random lattice and random geometric graphs. Combinatorics, Probability, and Computing (6), 489–511 (2000)
DÃaz, J., Penrose, M.D., Petit, J., Serna, M.: Approximating layout problems on random geometric graphs. Journal of Algorithms 39, 78–116 (2001)
DÃaz, J., Petit, J., Serna, M.: Random geometric problems on [0,1]2. In: Rolim, J.D.P., Serna, M., Luby, M. (eds.) RANDOM 1998. LNCS, vol. 1518, p. 294. Springer, New York (1998)
Dousse, O., Thiran, P., Hasler, M.: Connectivity in ad-hoc and hybrid networks. Infocom (2002)
Erdös, P., Rénye, A.: On Random Graphs I. Publ. Math. Debrecen 6, 290–297 (1959)
Fullmer, C., Garcia-Luna-Aceves, J.: Solutions to hidden terminal problems in wireless networks. In: ACM SIGCOMM, pp. 39–49 (1997)
Gilbert, E.N.: Random Graphs. Ann. Math. Stat. 30, 1141–1144 (1959)
Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980)
Gräf, A., Stumpt, M.: On coloring unit disk graphs. Algorithmica 20, 277–293 (1998)
Gupta, P., Kumar, P.R.: Critical power for asymptotic connectivity in wireless networks. Stochastic Analysis, Control, Optimization and Applications, 547–566 (1998)
Gupta, P., Kumar, P.R.: The capacity of wireless networks. IEEE Transactions on Information Theory 46(2), 388–404 (2000)
Hall, P.: Introduction to the Theory of Coverage Process. John Wiley and Sons, New York (1988)
Hoel, P.G., Port, S.C., Stone, C.J.: Introduction to Probability Theory. Houghton Mifflin Company, Boston, Mass. (1971)
Hou, T., Li, V.: Transmission range control in multihop packet radio networks. IEEE Transaction on Communications 34, 38–44 (1986)
Hsin, C.-F., Liu, M.: Network coverage using low duty cycled sensors: Random and coordinated sleep algorithm. In: International Symposium on Information Processing in Sensor Networks (2004)
Khurana, S., Kahol, A., Gupta, S.K.S., Srimani, P.K.: Performance evaluation of distributed co-ordination function for IEEE 802.11 wireless LAN protocol in presence of mobile and hidden terminals. In: International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, pp. 40–47 (1999)
Khurana, S., Kahol, A., Jayasumana, A.: Effect of hidden terminals on the performance of the IEEE 802.11 MAC protocol. In: Proceedings of Local Computer Networks Conference (1998)
Kleinrock, L., Silvester, J.: Optimum transmission radii for packet radio networks or why six is a magic number. In: Proc. IEEE National Telecom. Conf., pp. 4.3.1–4.3.5 (1978)
Lee, S.-J., Gerla, M.: AODV-BR: Backup routing in Ad hoc Networks. In: IEEE Wireless Communications and Networking Conference, vol. 3, pp. 1311–1316 (2000)
Palmer, E.M.: Graphical Evolution: An Introduction to the Theory of Random Graphs. John Wiley and Sons, New York (1985)
Penrose, M.D.: Random Geometric Graphs. Oxford University Press, Oxford (2003)
Penrose, M.D.: A strong low for the longest edge of the minimal spanning tree. The Annals of Probability 27(1), 246–260 (1999)
Penrose, M.D.: The longest edge of the random minimal spanning tree. The Annals of Applied Probability 7(2), 340–361 (1997)
Penrose, M.D.: On k-connectivity for a geometric random graph. Random structures and Algorithms 15(2), 145–164 (1999)
Philips, T.K., Panwar, S.S., Tantawi, A.N.: Connectivity properties of a packet radio network model. IEEE Transactions on Information Theory, 1044–1047 (1989)
Piret, P.: On the connectivity of radio networks. IEEE Transactions on Information Theory, 1490–1492 (1991)
Pottie, G.J., Kaiser, W.J.: Wireless integrated network sensors. Commun. ACM 43(5), 51–58 (2000)
Ravelomanana, V.: Extremal Properties of three-dimensional sensor networks with applications. IEEE Transactions on Mobile Computing 3(3), 246–257 (2004)
Roberts, F.S.: Indifference graphs. In: Harary, F. (ed.) Proof Techniques in Graph Theory, pp. 139–146. Academic Press, New York (1969)
Royer, E.M., Toh, C.-K.: A Review of Current Routing Protocols for Ad Hoc Mobile Wireless Networks. IEEE Personal Communication, 46–55 (1999)
Santi, P., Blough, D.M.: The critical transmitting range for connectivity in sparse wireless ad hoc networks. IEEE Transactions on Mobile Computing 2(1), 25–39 (2003)
Santi, P., Blough, D.M.: A probabilistic analysis for the radio range assignment problem in ad hoc networks. In: MobiHoc, pp. 212–220 (2001)
Shukla, D., Chandran-Wadia, L., Iyer, S.: Mitigating the exposed node problem in IEEE 802.11 ad hoc networks. In: International Conference on Computer Communications and Networks, pp. 157–162 (2003)
Sohrabi, K., Gao, J., Ailawadhi, V., Pottie, G.J.: Protocols for self-organization of a wireless sensor network. IEEE Personal Commun. 7(5), 16–27 (2000)
Stewart, J.: Calculus, 4th edn. Gary W. Ostedt (1999)
Takagi, H., Kleinrock, L.: Optimal transmission ranges for randomly distributed packet radio terminals. IEEE Transaction on Communications 32, 246–257 (1984)
Tobagi, F., Kleinrock, L.: Packet switching in radio channels, Part II-The hidden terminal problem in carrier sense multiple access and the busy tone solution. IEEE Trans. Commun. COM-23(12), 1417–1433 (1975)
Wu, J., Li, H.: Domination and its application in ad hoc wireless networks with unidirectional links. In: International Conference on Parallel Processing, pp. 189–197 (2000)
Xue, F., Kumar, P.R.: The number of neighbors needed for connectivity of wireless networks. Wireless Networks 10, 169–181 (2004)
Yang, K.J.: On the Number of Subgraphs of a Random Graph in [0, 1]d, Unpublished D.Phil. thesis, Department of Statistics and Actuarial Science, University of Iowa (1995)
Yen, L.-H., Yu, C.W.: Link probability, network coverage, and related properties of wireless ad hoc networks. In: The 1st IEEE International Conference on Mobile Ad-hoc and Sensor Systems, pp. 525–527 (2004)
Yu, C.W., Yen, L.-H., Cheng, Y.-M.: Computing subgraph probability of random geometric graphs with applications in wireless ad hoc networks. Tech. Rep., CHU-CSIETR- 2004-005, Chung Hua University, R.O.C
Yu, C.W., Yen, L.-H., Yu, K.-M., Lee, Z.P.: An Ad Hoc Routing Protocol Providing Short Backup Routes. In: Eighth IEEE Internation Conference on Communication Systems, Singapore, pp. 1052–1056 (2002)
Yu, K.-M.V., Yand, S.-F., Yu, C.W.: An Ad Hoc Routing Protocol with Multiple Backup Routes. In: Proceedings of the IASTED International Conference Networks, Parallel and Distributed Processing, and Applications, pp. 75–80 (2002)
The Bluetooth Interest group, http://www.bluetooth.com
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 IFIP International Federation for Information Processing
About this paper
Cite this paper
Yu, C.W., Yen, LH. (2005). Computing Subgraph Probability of Random Geometric Graphs: Quantitative Analyses of Wireless Ad Hoc Networks. In: Wang, F. (eds) Formal Techniques for Networked and Distributed Systems - FORTE 2005. FORTE 2005. Lecture Notes in Computer Science, vol 3731. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11562436_33
Download citation
DOI: https://doi.org/10.1007/11562436_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29189-3
Online ISBN: 978-3-540-32084-5
eBook Packages: Computer ScienceComputer Science (R0)