Skip to Main Content
The seminal work by Grossglause and David Tse showed that the mobility can increase the capacity of the wireless ad hoc network. Then many works started to characterize the capacity-delay relationship and discuss the trade-off of them in a general model. The motivation of this paper is to focus on a kind of practical wireless networks, where some special relay nodes (SRNs) move in a fixed pattern.To answer the question how we can benefit from this case, we design a simple relay algorithm to employ the SRNs relaying the packets with the short route, and analyze the capacity and average delay under the proposed algorithm. For a slow mobility situation, the network can guarantee the O(radicN) transmission delay bound, while the capacity (per node) is maintained at a constant, where N is the network node number.