This paper defines a new model which incorporates three key ingredients of a large class of wireless communication systems: (1) spatial interactions through interference, (2) dynamics of the queueing type, with users joining and leaving, and (3) carrier sensing and collision avoidance as used in, e.g., WiFi. In systems using (3), rather than directly accessing the shared resources upon arrival, a customer is considerate and waits to access them until nearby users in service have left. This new model can be seen as a missing piece of a larger puzzle that contains such dynamics as spatial birth-and-death processes, the Poisson-Hail model, and wireless dynamics as key other pieces. It is shown that, under natural assumptions, this model can be represented as a Markov process on the space of counting measures. The main results are then two-fold. The first result is on the shape of the stability region and, more precisely, on the characterization of the critical value of the arrival rate that separates stability from instability. The second result is of a more qualitative or perhaps even ethical nature. There is evidence that for natural values of the system parameters, the implementation of sensing and the delayed access for collision avoidance can stabilize a system that would be unstable if immediate access to the shared resources would be granted. In other words, for these parameters, renouncing greedy access makes sharing sustainable, whereas indulging in greedy access kills the system.

We introduce a new model of spatial random multiple access systems with a non-standard departure policy: all arriving messages are distributed uniformly on a finite sphere in the space, and when a successful transmission of a single message occurs, the transmitted message leaves the system together with all its neighbours within a ball of a given radius centred at the message's location. We consider three classes of protocols: centralised protocols and decentralised protocols with either ternary or binary feedback; and analyse their stability. Further, we discuss some asymptotic properties of stable protocols.

The split of a multihop, point to point TCP connection consists in replacing a plain, end-to-end TCP connection by a cascade of TCP connections. In such a cascade, connection n feeds connection n+1 through some proxy node n. This technique is used in a variety of contexts. In overlay networks, proxies are often peers of the underlying peer to peer network. Split TCP is also already proposed and largely adopted in wireless networks at the wired/wireless interface to separate links with vastly different characteristics. In order to avoid losses in the proxies, a backpressure mechanism is often used in this context. In this paper we develop a model for such a split TCP connection aimed at the analysis of the throughput dynamics on both links and that of the buffer occupancy in the proxy for long file transfers. The two main variants of Split TCP are considered: that with backpressure and that without. The study consists of two parts: the first part is purely experimental and is based on ns2 simulations. It allows us to identify complex interaction phenomena between TCP flow rates and proxy buffer occupancy, which seem to have been ignored by previous work on Split TCP. The second part of the paper is of mathematical nature. We establish the basic equations that govern the evolution of such a cascade and prove some of the experimental observations made in the first part. In particular, we give the conditions for system stability and we show the possibility of heavy tail asymptotics for proxy buffer occupancy and delays in the stationary regime.