Complex networks properties analysis for mobile ad hoc networks

Complex networks properties analysis for mobile ad hoc networks

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
IET Communications — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

Recently, research on complex network theory and applications draws a lot of attention in both academy and industry. In mobile ad hoc networks (MANETs) area of research, a critical issue is to design the most effective topology for given problems. It is natural and significant to consider complex networks topology when optimising the MANET topology. Current works usually transform MANET or sensor network topologies into either small-world or scale-free. However, some fundamental problems remain unsolved. Specifically, what are the average shortest path length, degree distribution and clustering characteristics of MANETs? Do MANETs have small-world effect and scale-free property? In this work, the authors introduce complex networks theory into the context of MANET topology and study complex network properties of the MANETs to answer the above questions. The authors have theoretically analysed the degree distribution and clustering coefficient of MANETs and proposed approach to computing them. The degree distribution and clustering coefficient of MANETs are theoretically deduced from node space probability distribution on different mobility models (including but not limited to random waypoint model). Simulation results on average shortest path length, clustering coefficient and degree distribution show that in most cases MANETs do not have the small-world effect and scale-free property.


    1. 1)
    2. 2)
    3. 3)
    4. 4)
    5. 5)
      • J. Kleinberg . The small-world phenomenon and decentralized search. SIAM News , 3 , 1 - 2
    6. 6)
    7. 7)
    8. 8)
    9. 9)
    10. 10)
      • M. Ishizuka , M. Aida . The reliability performance of wireless sensor networks configured by power-law and other forms of stochastic node placement. IEICE Trans. Commun. (Special section on Netw. Technol. Mobile Internet Syst.) , 9 , 2511 - 2520
    11. 11)
      • Sharma, G., Mazumdar, R.: `Hybrid sensor networks: a small world', Proc. Sixth ACM Int. Symp. on Mobile Ad Hoc Networking and Computing (MobiHoc 05), May 2005, Urbana, USA, p. 366–377.
    12. 12)
    13. 13)
      •, accessed April 2009.
    14. 14)
      •, accessed September 2008.
    15. 15)
    16. 16)
    17. 17)
      • Hong, X., Gerla, M., Pei, G., Chiang, C.C.: `A group mobility model for ad hoc wireless networks', Proc. ACM Int. Workshop on Modeling and Simulation of Wireless and Mobile Systems (MSWiM 1999), August 1999, Seattle, WA, USA, p. 53–60.
    18. 18)
      • Blough, D.M., Resta, G., Santi, P.: `A statistical analysis of the long-run node spatial distribution in mobile ad hoc networks', Proc. Fifth ACM Int. Workshop on Modeling Analysis and Simulation of Wireless and Mobile Systems (MSWiM 2002), September 2002, Atlanta, USA, p. 30–37.
    19. 19)
    20. 20)
      • Bettstetter, C., Wagner, C.: `The spatial node distribution of the random waypoint mobility model', Proc. Mobile Ad Hoc Networks, first German Workshop on Mobile Ad Hoc Networks (WMAN 2002), March 2002, Ulm, Germany, p. 41–58.
    21. 21)
    22. 22)
    23. 23)
    24. 24)
    25. 25)
      • R. Shi , X.Z. Yang . Research on node space probabilistic distribution according to random direction mobility model in Ad hoc network. J. Comput. Res. Dev. , 7 , 1166 - 1173
    26. 26)
      • T. Rappaport . (2004) Wireless Communications: principles and practice.
    27. 27)
      • Royer, E.M., Melliar-Smith, P.M., Moser, L.E.: `An analysis of the optimum node density for ad hoc mobile networks', Proc. IEEE Int. Conf. on Communications, 2001(ICC 2001), June 2001, Helsinki, Finland, p. 857–861.
    28. 28)
    29. 29)
      •, accessed July 2009.
    30. 30)
      • A. Wesley . (2006) Data structures and algorithm analysis in C++.
    31. 31)
      • Yoon, J., Liu, M., Noble, B.: `Random waypoint considered harmful', Proc. 22nd Annual Joint Conf. IEEE Computer and Communications Societies (INFOCOM 2003), April 2003, San Francisco, USA, p. 1312–1321.
    32. 32)

Related content

This is a required field
Please enter a valid email address