On some current results of graph theory for ad-hoc networks

  • Authors:
  • Giuseppe De Marco;Leonard Barolli

  • Affiliations:
  • Department of Communication and Information Engineering, Fukuoka Institute of Technology, Fukuoka, Japan;Department of Communication and Information Engineering, Fukuoka Institute of Technology, Fukuoka, Japan

  • Venue:
  • Journal of Mobile Multimedia
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

The goal of this paper is twofold. Firstly, we present results from graph-theory which can be used to understand the fundamental properties of ad-hoc networks and wireless sensor networks. Graph-theory is a well studied branch of discrete mathematics, and it has been applied in many knowledge fields, e.g. social network, Internet tomography and epidemiology. We review literature results from the point of view of the designer of an ad-hoc network, who must set simulation parameters in order to predict the behaviour of the real network. Secondly, we study the impact of the asymmetries of radio links on the connectivity properties of an ad-hoc network. To the best knowledge of the author, this further hypothesys has been addressed in the case of geometric random graph only, but not for radio models with randomnesses. As expected, we found that randomness in the radio model directly affects the distribution of the asymmetries and the connectivity properties. This result can be very useful in the understanding of more complicated aspects of ad-hoc nets, like routing and coordinated wake-up in power saving techniques.