Capacity of Delay Tolerant Networks

[摘要] Recently, a mobile wireless network with intermittent and frequent network partition has gained momentum through its ubiquitous applications such as proximity advertisement, content distribution, etc. Networking services in this challenged network with opportunistic wireless connectivity via mobility belong to a general space of Delay Tolerant Networking (DTN). The scalability of DTN protocols is very important for protocol design and evaluation, but it is not well studied in the literature. For instance, Grossglauser and Tse only showed that a ``carry-and-forward’’ style relay protocol can achieve $\Theta(1)$ per node throughput under the connectivity regime with radio range $\Theta(1/\sqrt{n})$ where $n$ is the number of nodes. In this paper, we study the capacity/delay scaling property of DTN protocols with arbitrary network connectivity with radio range $O(1/\sqrt{n})$ by considering a class of random mobility models where inter-contact time can be modeled using an independent homogeneous Poisson process (e.g., Random Waypoint or Random Direction). This simple, yet powerful tool allows us to analyze the scaling property of DTN routing and multicast protocols with the finite buffer constraint. Our results shed lights on understanding the delay-capacity and buffer-capacity trade-offs of DTN protocols and the impacts of DTN design principles on the performance.

[发布机构] UCLA Henry Samueli School of Engineering and Applied Science

[学科分类] 计算机科学（综合）