Dynamic Scheduling of Pigeons for Delay Constrained Applications

Information collection in the disaster area is an important application of pigeon networks - a special type of delay tolerant networks (DTN). The aim of this paper is to explore highly efficient dynamic scheduling strategies of pigeons for such applications. The upper bound of traffic that can be supported under the deadline constraints for the basic on-demand strategy is given through the analysis. Based on the analysis, a waiting based packing strategy is introduced. Although the latter strategy could not change the maximum traffic rate that a pigeon can support, it improves the efficiency of the pigeon largely. The analytical results are verified by the simulations.

• Type: Conference
• Year: 2009
• Where: WASA
• Authors: Jiazhen Zhou, Jiang Li, Legand L. Burge III
• Keywords: Algorithms, Delay Tolerant Networks, Pigeon, Pigeon Networks, WASA 2009