On Placement of Base Stations for Cut-Through Links in Epidemic Broadcast

One of communication mechanisms in DTN is an epidemic broadcasting that performs information transmission from a certain mobile node to all other mobile nodes using short-distance wireless communications among mobile nodes. In the literature, it has been shown that the performance of epidemic broadcasting improves significantly by not only utilizing ad-hoc communication among mobile nodes but also introducing a small number of cut-through links (i.e., wired communication links connecting several base stations on the field). In this paper, utilizing the analysis of epidemic broadcasting with cut-through links, we investigate quantitatively how the performance of epidemic broadcasting is affected by the placement of base stations for cut-through links. We also examine characteristics of four simple heuristic algorithms for base stations placement (i.e., Greedy, Equalization, Plane-splitting, and Random).