Adding edge dynamics to bipartite random-access networks
From MaRDI portal
Abstract: We consider random-access networks with nodes representing transmitter-receiver pairs whose signals interfere with each other depending on their vicinity. Data packets arrive at the nodes over time and form queues. The nodes can be either active or inactive: a node deactivates at unit rate, while it activates at a rate that depends on its queue length, provided none of its neighbors is active. In order to model the effects of user mobility in wireless networks, we analyze dynamic interference graphs where the edges are allowed to appear and disappear over time. We focus on bipartite graphs and study the transition time between the two states where one part of the network is active and the other part is inactive, in the limit as the queue lengths become large. Depending on the speed of the dynamics, we are able to obtain a rough classification of the effects of the dynamics on the transition time.
Recommendations
- Transition time asymptotics of queue-based activation protocols in random-access networks
- Crossover times in bipartite networks with activity constraints and time-varying switching rates
- Probabilistic-time characteristics of bistable random access networks
- Slow transitions and starvation in dense random-access networks
- Queues on a dynamically evolving graph
Cites work
- A stochastic network with mobile users in heavy traffic
- Asymptotically exponential hitting times and metastability: a pathwise approach without reversibility
- Crossover times in bipartite networks with activity constraints and time-varying switching rates
- Delay performance in random-access networks
- Distributed Random Access Algorithm: Scheduling and Congestion Control
- Flow-level performance and capacity of wireless networks with user mobility
- Hitting time asymptotics for hard-core interactions on grids
- scientific article; zbMATH DE number 1433445 (Why is no real title available?)
- Induced idleness leads to deterministic heavy traffic limits for queue-based random-access algorithms
- Introduction to Matrix Analytic Methods in Stochastic Modeling
- Low-temperature behavior of the multicomponent Widom-Rowlison model on finite square lattices
- Markov chain models - rarity and exponentiality
- Metastability of hard-core dynamics on bipartite graphs
- Mobility can drastically improve the heavy traffic performance from \(\frac{1}{1-\varrho}\) to \(\log(1/(1-\varrho))\)
- Opportunistic beamforming using dumb antennas
- Packet Switching in Radio Channels: Part I--Carrier Sense Multiple-Access Modes and Their Throughput-Delay Characteristics
- Queue-based random-access algorithms: fluid limits and stability issues
- Randomized scheduling algorithm for queueing networks
- Stochastic geometry and wireless networks. Volume I. Theory
- Stochastic geometry and wireless networks. Volume II. Applications
- Transition time asymptotics of queue-based activation protocols in random-access networks
- Tunneling of the hard-core model on finite triangular lattices
Cited in
(3)
This page was built for publication: Adding edge dynamics to bipartite random-access networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5044428)
