#### Filter Results:

#### Publication Year

1988

2014

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

In this paper we study the so-called random waypoint (RWP) mobility model in the context of cellular networks. In the RWP model the nodes, i.e. mobile users, move along a zigzag path consisting of straight legs from one waypoint to the next. Each waypoint is assumed to be drawn from the uniform distribution over the given convex domain. In this paper we… (More)

— The random waypoint model (RWP) is one of the most widely used mobility models in performance analysis of ad hoc networks. We analyze the stationary spatial distribution of a node moving according to the RWP model in a given convex area. For this we give an explicit expression, which is in the form of a one-dimensional integral giving the density up to a… (More)

We compare the performance of three usual allocations, namely max-min fairness, proportional fairness and balanced fairness, in a communication network whose resources are shared by a random number of data flows. The model consists of a network of processor-sharing queues. The vector of service rates, which is constrained by some compact, convex capacity… (More)

—We consider an opportunistic content sharing system designed to store and distribute local spatio-temporal " floating " information in uncoordinated P2P fashion relying solely on the mobile nodes passing through the area of interest, referred to as the anchor zone. Nodes within the anchor zone exchange the information in opportunistic manner, i.e.,… (More)

The RED algorithm is one of the active queue management methods promoted by the IETF for congestion control in backbone routers. We analyze the dynamic behavior of a single RED controlled queue receiving a Poisson stream with time varying arrival rate, describing the aggregate traffic from a population of TCP sources. The queue is described in terms of the… (More)

— Fountain codes provide an efficient way to transfer information over erasure channels. We give an exact performance analysis of a specific type of fountain codes, called LT codes, when the message length N is small. Two different approaches are developed. In a Markov chain approach the state space explosion, even with reduction based on permutation… (More)

Recommended by Stavros Toumpis We study the load balancing problem in a dense wireless multihop network, where a typical path consists of a large number of hops, that is, the spatial scales of a typical distance between source and destination and mean distance between the neighboring nodes are strongly separated. In this limit, we present a general… (More)