Scalability in mobile Ad hoc networks with Brownian mobility

In this poster, we investigate the overall capacity of dynamic mobile Ad hoc networks (MANETs) with wireless nodes moving according to the Brownian motion. The minimum required capacity of these networks must not exceed the maximum packet traffic value (MPTV) in the network. The MPTV takes place at the central node of each dynamic networks. Several random topologies are produced by taking snapshots at discrete time instants. A simple central of mass principle is used to find these central nodes. Each of the N nodes transmits one packet to all other nodes in the network. Hence, the overall transmitted packets number for each under test topology equals N×(N−1). The routing algorithm used to manage the flow of packets within the network is a simple minimum hop-based algorithm with a preferential crossing through the central node while ensuring the minimum received power (MRP) required to communicate between each adjacent node in the route. The indoor attenuation factor propagation model is used to find the received power at each receiving node. Theoretical results show a significant variation in the maximum packet traffic values with time. However, the mean value of the MPTVs is lower than the MPTV value for a static Ad hoc network having the same number of nodes.