Efficient Scheduling of Pigeons for a Constrained Delay Tolerant Application
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 strate...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
SpringerOpen
2010-01-01
|
Series: | EURASIP Journal on Wireless Communications and Networking |
Online Access: | http://dx.doi.org/10.1155/2010/142921 |
id |
doaj-0f4c0524216c420f9259d5e1fbf08018 |
---|---|
record_format |
Article |
spelling |
doaj-0f4c0524216c420f9259d5e1fbf080182020-11-25T01:57:22ZengSpringerOpenEURASIP Journal on Wireless Communications and Networking1687-14721687-14992010-01-01201010.1155/2010/142921Efficient Scheduling of Pigeons for a Constrained Delay Tolerant ApplicationLegand BurgeJiang LiJiazhen ZhouInformation 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. http://dx.doi.org/10.1155/2010/142921 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Legand Burge Jiang Li Jiazhen Zhou |
spellingShingle |
Legand Burge Jiang Li Jiazhen Zhou Efficient Scheduling of Pigeons for a Constrained Delay Tolerant Application EURASIP Journal on Wireless Communications and Networking |
author_facet |
Legand Burge Jiang Li Jiazhen Zhou |
author_sort |
Legand Burge |
title |
Efficient Scheduling of Pigeons for a Constrained Delay Tolerant Application |
title_short |
Efficient Scheduling of Pigeons for a Constrained Delay Tolerant Application |
title_full |
Efficient Scheduling of Pigeons for a Constrained Delay Tolerant Application |
title_fullStr |
Efficient Scheduling of Pigeons for a Constrained Delay Tolerant Application |
title_full_unstemmed |
Efficient Scheduling of Pigeons for a Constrained Delay Tolerant Application |
title_sort |
efficient scheduling of pigeons for a constrained delay tolerant application |
publisher |
SpringerOpen |
series |
EURASIP Journal on Wireless Communications and Networking |
issn |
1687-1472 1687-1499 |
publishDate |
2010-01-01 |
description |
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. |
url |
http://dx.doi.org/10.1155/2010/142921 |
work_keys_str_mv |
AT legandburge efficientschedulingofpigeonsforaconstraineddelaytolerantapplication AT jiangli efficientschedulingofpigeonsforaconstraineddelaytolerantapplication AT jiazhenzhou efficientschedulingofpigeonsforaconstraineddelaytolerantapplication |
_version_ |
1724974501588893696 |