Weitere Artikel dieser Ausgabe durch Wischen aufrufen
Information collection in the disaster area is an important application of pigeon networks—a special type of delay tolerant networks (DTNs) that borrows the ancient idea of using pigeons as the telecommunication method. The aim of this paper is to explore highly efficient 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 a pigeon largely. The analytical results are verified by the simulations.
Guo H, Li J, Qian Y: HoP: pigeon-assisted forwarding in partitioned wireless networks. Processings of the International Conference on Wireless Algorithms, Systems and Applications (WASA '08), 2008 72-83. CrossRef
Guo H, Li J, Qian Y, Tian Y: A practical routing strategy in delay tolerant networks using multiple pigeons. Proceedings of the IEEE Military Communications Conference (MILCOM '08), November 2008, San Diego, Calif, USA
Fall K: A delay-tolerant network architecture for challenged internets. Proceedings of the Computer Communication Review (SIGCOMM '03), August 2003 33: 27-34. CrossRef
Vahdat A, Becker D: Epidemic routing for partially-connected ad-hoc networks. Duke University, Durham, NC, USA; 2000.
Deng D, Li Q: Communication in naturally mobile sensor networks. Proceedings of the International Conference on Wireless Algorithms, Systems and Applications (WASA '09), August 2009, Boston, Mass, USA
Zhao W, Ammar M: Message ferrying: proactive routing in highlypartitioned wireless ad hoc networks. Proceedings of the 9th IEEE Workshop on Future Trends of Distributed Computing Systems, May 2003, San Juan, Puerto Rico, USA 308-314.
Psaraftis HN: Dynamic vehicle routing problems. In Vehicle Routing: Methods and Studies. Edited by: Golden BL, Assad AA. North-Holland, Amsterdam, The Netherlands; 1988:223-248.
Larsen A: The dynamic vehicle routing problem, dissertation. Technical University of Denmark; 2000.
Johnson D: Local Optimization and the Traveling Salesman Problem. Proceedings of the 17th International Colloquium on Automata, languages and programming, 1990 446-461. CrossRef
Mesquite Software, Inc : CSIM19 User's Guide. Austin, Tex, USA, 2001
- Efficient Scheduling of Pigeons for a Constrained Delay Tolerant Application
- Springer International Publishing
- EURASIP Journal on Wireless Communications and Networking
Elektronische ISSN: 1687-1499
Neuer Inhalt/© ITandMEDIA, Product Lifecycle Management/© Eisenhans | vege | Fotolia