Learn More
A stochastic model is introduced that accurately models the message delay in mobile ad hoc networks where nodes relay messages and the networks are sparsely populated. The model has only two input parameters: the number of nodes and the parameter of an exponential distribution which described the time until two random mobiles come with communication range(More)
Previous work on the coverage of mobile sensor networks focuses on algorithms to reposition sensors in order to achieve a static configuration with an enlarged covered area. In this paper, we study the dynamic aspects of the coverage of a mobile sensor network that depend on the process of sensor movement. As time goes by, a position is more likely to be(More)
— In this work we develop simple inference models based on finite capacity single server queues for estimating the buffer size and the intensity of cross traffic at the bottleneck link of a path between two hosts. Several pairs of moment-based estimators are proposed to estimate these two quantities. The best scheme is then identified through simulation.
We propose a general framework for obtaining asymptotic distributional bounds on the stationary backlog W A 1 +A 2 ;c in a buuer fed by a combined uid process A 1 + A 2 and drained at a constant rate c. The uid process A 1 is an (independent) on-oo source with average and peak rates 1 and r 1 , respectively, and with distribution G for the activity periods.(More)
The Differentiated services (diffserv) architecture has been proposed as a scalable solution for providing service differentiation among flows without any per-flow buffer management inside the core of the network. It has been advocated that it is feasible to provide service differentiation among a set of flows by choosing an appropriate “marking(More)
The Transmission Control Protocol (TCP) was designed to provide reliable end-to-end delivery of data over unreliable networks. In practice, most TCP deployments have been carefully designed in the context of wired networks. Ignoring the properties of wireless Ad Hoc Networks can lead to TCP implementations with poor performance. In order to adapt TCP to Ad(More)
Sample path methods are now among the most used techniques in the control of queueing systems. However, due to the lack of mathematical formalism, they may appear to be non-rigorous and even sometimes mysterious. The goal of this paper is threefold: to provide a general mathematical setting, to survey the most popular sample path methods including forward(More)