Date Added: May 2012
A special type of disruption/delay tolerant networks, known as pigeon networks, utilizes controllable vehicles called pigeons to convey messages among segregated hosts. This paper investigates the optimal assignment of multiple pigeons to serve hosts in a pigeon network such that the average message delay is minimized. To achieve this goal, first the authors provide an asymptotic analysis on the effectiveness of geographical partitioning based method, which establishes the theoretical foundation for partitioning-based pigeon assignment. Second, they derive a near optimal assignment of pigeons for a given partitioning through analysis.