Two Efficient Approaches for Generating Topologies of Ad-Hoc Networks

Abstract

The field of Ad hoc networks has seen a rapid expansion of visibility and work due to the rapid increase of inexpensive, widely available wireless devices and the network community’s interest in mobile computing. Such networks are taking special great attention from research community due to their wide range of applications. However, because of the expensive and difficulty of real experiments, simulation technique is the primary methodological framework for research and development of such networks. One of the most important things in simulation of ad hoc network is generating a connected graph to represent the network. This paper first presents a literature survey of the most recent methods that concern the generation of network graphs. Then, it introduces two novel and fast algorithms for generating topologies of Ad-hoc networks. The proposed approaches enable the user to generate various network topologies by deciding number of nodes, radio range and minimum distance between any two adjacent nodes in the graph. Finally, the proposed approaches are evaluated and compared with the most recent algorithms. Numerical results demonstrate that the proposed approaches speed up simulation of ad hoc networks and achieve an essential computational cost reduction in comparing with the most recent methods.