  We consider random-access networks with nodes representing servers with
queues. The nodes can be either active or inactive: a node deactivates at unit
rate, while it activates 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 half of the network
is active and the other half is inactive, in the limit as the queues 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.
