Christian Bettstetter
ABSTRACT
This paper investigates two fundamental characteristics of a wireless multi -hop network: its minimum node degree and its k--connectivity. Both topology attributes depend on the spatial distribution of the nodes and their transmission range. Using typical modeling assumptions :--- :a random uniform distribution of the nodes and a simple link model :--- :we derive an analytical expression that enables the determination of the required range r0 that creates, for a given node density ρ, an almost surely k--connected network. Equivalently, if the maximum r0 of the nodes is given, we can find out how many nodes are needed to cover a certain area with a k--connected network. We also investigate these questions by various simulations and thereby verify our analytical expressions. Finally, the impact of mobility is discussed.The results of this paper are of practical value for researchers in this area, e.g., if they set the parameters in a network--level simulation of a mobile ad hoc network or if they design a wireless sensor network.
- B. M. Leiner, D. L. Nielson, and F. A. Tobagi, eds., Proceedings of the IEEE, Special issue on Packet Radio Networks, vol. 75, Jan. 1987.Google Scholar
- Z. J. Haas, M. Gerla, D. B. Johnson, C. E. Perkins, M. B. Pursley, M. Steenstrup, and C.-K. Toh, eds., IEEE Journal on Sel. Areas in Comm., Special issue on Wireless Ad Hoc Networks, vol. 17, Aug. 1999.Google Scholar
- P. Kermani and N. H. Vaidya, eds., IEEE Personal Comm., Special issue on Advances in Mobile Ad Hoc Networking, Feb. 2001.Google Scholar
- C. E. Perkins, ed., Ad Hoc Networking. Addison--Wesley, 2001.Google Scholar
- G. J. Pottie and W. J. Kaiser, "Wireless integrated network sensors," Comm. of the ACM, May 2000. Google ScholarDigital Library
- Y.-D. Lin and Y.-C. Hsu, "Multihop cellular: A new architecture for wireless communications," in Proc. IEEE Infocom, (Tel Aviv, Israel), Mar. 2000.Google Scholar
- W. Kellerer, C. Bettstetter, C. Schwingenschlögl, P. Sties, K.-E. Steinberg, and H.-J. Vögel," (Auto)Mobile communication in a heterogeneous and converged world," IEEE Pers. Comm., Dec. 2001.Google Scholar
- H. Hartenstein, B. Bochow, A. Ebner, M. Lott, M. Radimirsch, and D. Vollmer, "Position--aware ad hoc wireless networks for inter--vehicle communications: The Fleetnet project," in Proc. ACM Intern. Symp. on Mobile Ad Hoc Netw. and Comp. (MobiHoc), (Long Beach, CA), Oct. 2001. Google ScholarDigital Library
- R. Ramanathan and R. Rosales-Hain, "Topology control of multihop wireless networks using transmit power adjustment," in Proc. IEEE Infocom, (Tel Aviv, Israel), Mar. 2000.Google Scholar
- R. Wattenhofer, L. Li, P. Bahl, and Y.-M. Wang, "Distributed topology control for power efficient operation in multihop wireless ad hoc networks," in Proc. IEEE Infocom, (Anchorage, Alaska), Apr. 2001.Google Scholar
- P. Santi, D. M. Blough, and F. Vainstein, "A probabilistic analysis for the radio range assignment problem in ad hoc networks," in Proc. ACM Intern. Symp. on Mobile Ad Hoc Netw. and Comp. (MobiHoc), (Long Beach, CA), Oct. 2001. Google ScholarDigital Library
- R. Diestel, Graph Theory. Springer, 2nd ed., 2000.Google Scholar
- B. Bollobás, Modern Graph Theory. Springer, 1998.Google Scholar
- N. A. C. Cressie, Statistics for Spatial Data. John Wiley & Sons, 1991.Google Scholar
- H. Takahi and L. Kleinrock, "Optimal transmission ranges for randomly distributed packet radio terminals," IEEE Trans. on Comm., Mar. 1984.Google Scholar
- A. Papoulis, Probability, random variables, and stochastic processes. McGraw--Hill, 1984.Google Scholar
- M. Matsumoto and T. Nishimura, "Mersenne twister: A 623-dimensionally equidistributed uniform pseudorandom number generator," ACM Trans. on Modeling and Computer Simulation, Jan. 1998. Google ScholarDigital Library
- C. Bettstetter and O. Krause, "On border effects in modeling and simulation of wireless ad hoc networks," in Proc. IEEE Intern. Conf. on Mobile and Wireless Comm. Netw. (MWCN), (Recife, Brazil), Aug. 2001.Google Scholar
- M. K. Marina and S. R. Das, "On-demand multipath distance vector routing in ad hoc networks," in Proc. Intern. Conf. for Network Procotols (ICNP), (Riverside, CA), Nov. 2001. Google ScholarDigital Library
- B. Bollobás, Random Graphs. Academic Press, 1985.Google Scholar
- S. Janson, A. Rucinski, T. Luczak, and T. Uczak, Theory of Random Graphs. Wiley, May 2000.Google ScholarCross Ref
- I. Chlamtac and A. Faragó, "A new approach to the design and analysis of peer--to--peer mobile networks," ACM/Baltzer Wireless Networks, vol. 5, Aug. 1999. Google ScholarDigital Library
- J. Díiaz, M. D. Penrose, J. Petit, and M. Serna, "Convergence theorems for some layout measures on random lattice and random geometric graphs," Combinatorics, Probability, and Computing, no. 6, pp. 489--511, 2000. Google ScholarDigital Library
- M. D. Penrose, "On k--connectivity for a geometric random graph," Wiley Random Structures and Algorithms, vol. 15, no. 2, pp. 145--164, 1999. Google ScholarDigital Library
- P. Erdüs and A. Rényi, "On the evolution of random graphs," Publ. Math. Inst. Hungar. Acad. Sci., vol. 5, pp. 17--61, 1960.Google Scholar
- C. Bettstetter, "Mobility modeling in wireless networks: Categorization, smooth movement, and border effects," ACM Mobile Computing and Communications Review, vol. 5, no. 3, 2001. Google ScholarDigital Library
- J. Broch, D. A. Maltz, D. B. Johnson, Y.-C. Hu, and J. Jetcheva, "A performance comparison of multi-hop wireless ad hoc network routing protocols," in Proc. ACM Intern. Conf. on Mobile Comp. and Netw. (MobiCom), (Dallas, TX), Oct. 1998. Google ScholarDigital Library
- E. M. Royer and C. E. Perkins, "Multicast operation of the ad--hoc on--demand distance vector routing protocol," in Proc. ACM Intern. Conf. on Mobile Comp. and Netw. (MobiCom), (Seattle, WA), 1999. Google ScholarDigital Library
- S. R. Das, C. E. Perkins, and E. M. Royer, "Performance comparison of two on-demand routing protocols for ad hoc networks," in Proc. IEEE Infocom, (Tel Aviv, Israel), 2000.Google Scholar
- G. Holland and N. H. Vaidya, "Analysis of TCP performance over mobile ad hoc networks," in Proc. ACM Intern. Conf. on Mobile Comp. and Netw. (MobiCom), (Seattle, WA), Aug. 1999. Google ScholarDigital Library
- R. A. Guérin, "Channel occupancy time distribution in a cellular radio system," IEEE Trans. on Vehicular Technology, vol. 36, Aug. 1987.Google ScholarCross Ref
- Y.-C. Cheng and T. G. Robertazzi, "Critical connectivity phenomena in multihop radio models," IEEE Trans. on Communications, vol. 37, July 1989.Google ScholarCross Ref
- T. K. Philips, S. S. Panwar, and A. N. Tantawi, "Connectivity properties of a packet radio network model," IEEE Trans. on Inform. Theory, Sept. 1989.Google ScholarDigital Library
- P. Piret, "On the connectivity of radio networks," IEEE Trans. on Information Theory, Sept. 1991.Google ScholarDigital Library
- P. Gupta and P. R. Kumar, "Critical power for asymptotic connectivity in wireless networks," in Stochastic Analysis, Control, Optimization and Applications, pp. 547--566, Birkhauser, 1998.Google Scholar
- M. J. B. Appel and R. P. Russo, "The minumum vertex degree of a graph on uniform points in {0,1d}," Adv. in Applied Probability, vol. 29, pp. 582--594, 1997.Google ScholarCross Ref
- J. G. Proakis, E. M. Sozer, J. A. Rice, and M. Stojanovic, "Shallow water acoustic networks," IEEE Personal Communications, Nov. 2001. Google ScholarDigital Library
Index Terms
- On the minimum node degree and connectivity of a wireless multihop network
Recommendations
Connectivity of wireless multihop networks in a shadow fading environment
MSWIM '03: Proceedings of the 6th ACM international workshop on Modeling analysis and simulation of wireless and mobile systemsThis paper investigates the connectivity of wireless multihop networks in a log--normal shadow fading environment. Assuming a spatial Poisson distribution of the network nodes, we derive (a) a closed--form expression for the probability that a node is ...
Minimum Node Degree and Connectivity of Two-dimensional MANETs under Random Waypoint Mobility Model
CIT '10: Proceedings of the 2010 10th IEEE International Conference on Computer and Information TechnologyThe performance of Mobile Ad Hoc Networks (MANETs) is influenced by many factors including node mobility, node density, and wireless transmission range. The mobility model representing the moving behavior of mobile nodes plays an important role in ...
Connectivity analysis of multihop wireless networks using route distribution model
Most of the management and routing protocols in multihop wireless networks rely on strict connectivity condition among nodes. In this paper, we construct mathematical framework to model connectivity of wireless ad hoc and wireless sensor networks. We use ...
Comments