In our present work we model the maximum throughput of stationary ad hoc networks. The
routing process we apply is ideal in the sense that it includes collision avoidance and …

We investigate the throughput of ad hoc networks using ideal shortest path routing between
randomly selected source-destination pairs. Our results not only confirm the n-1/2 decay of …

In this paper we propose a set of necessary and sufficient conditions under which the
throughput in an ad-hoc network can remain constant as the number of nodes n increases …

Consider a wireless ad hoc network with n nodes distributed uniformly on [0, 1] 2. The
transport capacity (TC) of such a wireless network scales like√ n. To achieve this, each …

Due to the complexity and high randomness, most current researches on ad hoc networks
are based on simulation results and empirical analysis, lacking theoretical understanding of …

Although recently we have seen many research activities on ad hoc networks, majority
among them are based on simulations. This paper proposes a general ad hoc network …

This thesis is submitted to the Department of Telecommunication Systems, School of
Engineering at Blekinge Institute of Technology in partial fulfillment of the requirements for …

Wireless networks are characterized by a dynamic topology triggered by the nodes mobility.
Thus, the wireless multi-hops connection and the channel do not have a determinist …

Throughput capacity of large ad hoc networks has been shown to scale adversely with the
size of network n. However the need for the nodes to find or repair routes has not been …

The topology of ad hoc networks is critical in determining the performance of routing
algorithms, capacity and lifetime of ad hoc networks. In this paper, we study the impact of …