Eugene Perevalov

Delay-limited throughput of ad hoc networks

The delay-limited throughput of an ad hoc wireless network confined to a finite region is investigated. An approximate expression for the achievable throughput as a function of the maximum allowable delay is obtained. It is found that: 1) for moderate values of the delay d, the throughput that can be achieved by taking advantage of the motion increases as d/sup 2/3/ and 2) for a fixed value of d, the dependence of the achievable throughput on the number of nodes n is n/sup -1/3/. A transmission and relaying strategy ensuring continuous information flow is constructed. It is shown that there exists a critical value of the delay such that: 1) for values of the delay d below the critical delay, the throughput does not benefit appreciably from the motion and 2) the dependence of the critical delay on the number of nodes is a very slowly increasing function (n/sup 1/14/). Finally, asymptotic optimality of the proposed strategy in a certain class is shown.

On the capacity of ad hoc networks with clustering

We obtain an upper bound on the throughput of an ad hoc network which contains a square-shaped cluster with n nodes acting as sources communicating with another square-shaped cluster with n destination nodes. We consider the cases where the two clusters have no overlap, partial overlap, and complete overlap. We also investigate the achievability of the upper bound in the no overlap case and show that it can be achieved up to a typically small additive term.

On the delay limited capacity of ad hoc networks

The problem of capacity of a wireless ad hoc network in the presence of a uniform end-to-end delay constraint is explored. A general model for the random motion of the nodes is used. An approximate expression for the capacity as a function of the maximum allowable delay is obtained, and the asymptotic optimality of the proposed transmission strategy in a certain class is shown.

Route discovery and capacity of ad hoc networks

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 analyzed in this context. In this paper, we explicitly take route discovery into account and obtain the scaling law for the throughput capacity under general assumptions on the network environment, node behavior, and the quality of route discovery algorithms. We also discuss a number of possible scenarios and show that the need for route discovery may change the scaling for the throughput capacity dramatically

Throughput capacity of ad hoc networks with route discovery

Throughput capacity of large ad hoc networks has been shown to scale adversely with the size of network. However the need for the nodes to find or repair routes has not been analyzed in this context. In this paper, we explicitly take route discovery into account and obtain the scaling law for the throughput capacity under general assumptions on the network environment, node behavior, and the quality of route discovery algorithms. We also discuss a number of possible scenarios and show that the need for route discovery may change the scaling for the throughput capacity.

On Route Discovery Success in Ad hoc Networks

The lack of infrastructure inherent to wireless ad hoc networks leads to the problem of distributed route discovery and maintenance. We introduce an analytical model and perform a quantitative analysis of the route discovery process (RDP) in wireless ad hoc networks. Bounds on RDP performance in terms of pertinent system parameters are determined. We apply our analytical RDP model to specific system models and compare analytical results with those obtained by numerical simulations. Our results give insight into the sustainable level of RDP in an ad hoc network and allude to the possible impact on throughput as seen in a companion paper.

Threshold effect in the throughput of large clustered ad hoc networks

The performance of an ad hoc network that contains many nodes within circular clusters with fixed node density is studied. These clusters lie within a finite square area, and the space between clusters is filled with nodes such that the density of nodes is much smaller than the density of nodes in the clusters. We obtain an upper bound on the throughput and investigate the achievability of the upper bound. Through these studies, the effect of clustering on throughput is uncovered. The impact of changing the finite square area, in which the system resides, called the system size, becomes evident. In particular, we show that in clustered networks, the size of the network is important, and in particular, the behavior of the network changes greatly for small and large networks

Fluid Models for Parallel Processor Allocation

The problem of optimal processor allocation in parallel systems in the presence of nonlinear dynamics is considered. The flow of parallel jobs is modelled as that of a continuous fluid, and the Maximum Principle is applied to the resulting problem. The optimal fluid solution provides a lower bound on performance. Based on the optimal solution, several suboptimal (static partitioning) policies are proposed, and their performance is shown to be close to the lower bound in numerical examples.