Skip to main content
SpringerLink
Log in

An Analytical Model for the Node Degree in Wireless Ad Hoc Networks

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

Node degree is regarded as an important and convenient metric to measure the connectivity of wireless ad hoc networks. Existing studies are mainly based on the assumption that nodes are static and do not provide closed-form expressions for node degree. In this paper, we investigate three fundamental characteristics of a wireless ad hoc network: Its node degree distribution, its average node degree and its maximum node degree experienced by the nodes during their movement. We introduce a novel mathematical model to derive analytical expressions in the presence of radio channel fading. Furthermore, our results reveal that the node degree distribution follows a binomial distribution regardless of the initial distribution of nodes’ location. The results of this paper are useful to study node connectivity and to improve the algorithmic complexity of incentive protocols.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Zhao, M., & Wang, W. (2007). The impacts of radio channels and node mobility on link statistics in mobile ad hoc networks. In Proceedings of IEEE GLOBECOM (pp. 1206–1210).

  2. Schwartz M. (2005) Mobile wireless communications. (1st ed.). Cambridge University Press, Cambridge

    Google Scholar 

  3. Bettstetter, C., & Hartmann, C. (2003). Connectivity of wireless multihop networks in a shadow fading environment. In Proceedings of ACM MSWiM (pp. 28–32).

  4. Bettstetter, C. (2002). On the minimum node degree and connectivity of a wireless multihop network. In Proceedings of ACM MobiHoc (pp. 80–91).

  5. Hekmat, R., & Mieghem, V. P. (2003). Degree distribution and hopcount in wireless ad-hoc networks. In Proceedings of IEEE ICON (pp. 603–609).

  6. Bettstetter, C. (2003). Topology properties of ad hoc networks with random waypoint mobility. In Proceedings of ACM MobiHoc (pp. 50–52).

  7. Penrose M. D. (1999) On k-connectivity for a geometric random graph. Wiley Random Structures and Algorithms 15(2): 145–164

    Article  MathSciNet  MATH  Google Scholar 

  8. Miorandi, D., & Altman, E. (2005). Coverage and connectivity of ad hoc networks in presence of channel randomness. In Proceedings of IEEE INFOCOM (pp. 491–502).

  9. Babu A. V., Singh M. K. (2010) Node isolated probability of wireless ad hoc networks in nagakami fading channel. International journal of Computer Networks and Communications 2(2): 21–36

    Article  Google Scholar 

  10. Kumar B. R. A., Reddy L. C., Hiremath P. S. (2010) Analysis of K-connected MANETs for QoS multicasting using EDMSTs based on connectivity index. International Journal of Computer Applications 3(12): 15–22

    Article  Google Scholar 

  11. Tseng C., Chen H., Chen K. (2007) Distribution of the node degree for wireless ad hoc networks in shadow fading environments. IEICE Transactions on Communications E90B(8): 2155–2158

    Article  Google Scholar 

  12. Doci, A., Springer, W., & Xhafa, F. (2008). Maximum node degree mobility metric for wireless ad Hoc Networks. In Proceedings of IEEE UBICOMM (pp. 463–468).

  13. Zhao, M., & Wang, W. (2006). A novel semi-markov smooth mobility model for mobile ad hoc networks. In Proceedings of IEEE global telecommunications conference (GLOBECOM) (pp. 1–5).

  14. Bettstetter C., Resta G., Santi P. (2003) The node distribution of the random waypoint mobility model for wireless ad hoc networks. IEEE Transaction on Mobile Computing 2(3): 257–269

    Article  Google Scholar 

  15. Papoulis A. (2002) Probability, random variables and stochastic process. McGraw-Hill, New York

    Google Scholar 

  16. http://en.wikipedia.org/wiki/Binomial_distribution.

  17. Mieghem P. V. (2006) Performance analysis of communications networks and systems. Cambridge university press, NewYork

    Book  MATH  Google Scholar 

  18. Jayaweera, S. K. (2007). Optimal node placement in decision fusion wireless sensor networks for distributed detection of a randomly-located target. In Proceedings of IEEE MILCOM (pp. 1–6).

  19. Miller L. E. (2001) Distribution of link distances in a wireless network. Journal of Research of the National Institute of Standards and Technology 106: 401–412

    Google Scholar 

  20. Petrova, M., Mahonen, P., & Riihijarvi, J. (2007). Connectivity analysis of clustered ad hoc and mesh networks. In Proceedings of GLOBECOM (pp. 1139–1143).

Download references

Author information

Authors and Affiliations

  1. Beijing University of Posts and Telecommunications, Beijing, China

    Lifang Guo & Huimin Xu

  2. North Carolina State University, Raleigh, NC, 27695, USA

    Khaled Harfoush

Authors
  1. Lifang Guo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Khaled Harfoush
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Huimin Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Lifang Guo.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Guo, L., Harfoush, K. & Xu, H. An Analytical Model for the Node Degree in Wireless Ad Hoc Networks. Wireless Pers Commun 66, 291–306 (2012). https://doi.org/10.1007/s11277-011-0339-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-011-0339-y

Keywords

Search

Navigation