- Research Article
- Open Access
Efficient Scheduling of Pigeons for a Constrained Delay Tolerant Application
© Jiazhen Zhou et al. 2010
- Received: 2 September 2009
- Accepted: 10 September 2009
- Published: 13 December 2009
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.
- Travel Salesman Problem
- Vehicle Rout Problem
- Maximum Throughput
- Disaster Area
- Delay Tolerant Network
After disasters (e.g., earthquakes, fires, tornadoes) happen, it is urgent to rescue people and protect property. To ensure the rescuing work timely and correctly executed, accurate live information (e.g., in the format of videos) is needed by the commanding headquarter. As the instant communications of large amount of message is usually unrealistic, especially after the disasters which probably destroy the communication infrastructure, a feasible solution is to send special vehicles (like helicopters) to the disaster areas to collect the information. This special type of communication belongs to the range of delay tolerant communications.
Pigeon networks [1, 2], which borrow the ancient idea of employing pigeons as the communication tool, can be viewed as a special type of delay tolerant networks (DTNs)  that use special-purpose message carriers. Of course, the "pigeons'' used here are not the real pigeons. Instead, they are vehicles that are equipped with much better moving ability and partial instant wireless communication ability. For instance, it can be an unmanned aviation vehicle or a robotic insect.
The communication in a DTN is achieved through the mobility of nodes since two nodes can only communicate when they are close enough. This mobility has two modes: random mobility and controlled mobility. Examples of random mobility include epidemic routing  and the naturally mobile sensor networks . For the controlled mobility mode, usually special purpose message carriers like message ferries  are used and they can follow desired routes to pick up or deliver messages.
The mobility of a pigeon can be controlled, which is similar to the message ferry . However, the difference is that a pigeon network has the character of being private and secure [1, 2], which is especially suitable for the purpose of disaster rescue and recovery. Thus, in the remained part of this paper, pigeon is used in place of the vehicle mentioned above.
Although the rescuing task has to be time tolerant due to the long time (compared with instant communications) needed by the travel of pigeons, the delay that can be tolerated is still limited. For example, the best time to rescuing people in an earthquake disaster should be within 48 hours, and this limit is largely shortened (two hours) if someone is wounded or if the buildings that people are locked in are in dangerous situation. In conclusion, this becomes a constrained delay tolerant problem, and the delay is the most important metric to be considered for this type of problems.
Superficially, the delay that each message demand suffers is the only important factor, and so it sounds like a pigeon can stay in an area as long as it can to make sure that the demands in that area can be satisfied. However, another fact is that the pigeons available for the disaster rescue and recovery tasks are also limited. If the pigeons can be schedule more efficiently, more disaster areas can be covered. As a result, more lives and properties can be saved if the pigeons are scheduled more efficiently.
The problem presented in this paper is very close to the dynamic vehicle routing problem (VRP) [7–9]. The arrival of new demands is stochastic, and there is no ending of time horizon. Thus, a complete solution of routing and scheduling plan like in the static vehicle routing problem is impossible. This character makes policies rather than the solution the primary goal to pursue in the area of dynamic VRP. The representative works include those by Bertsimas and van Ryzin [10, 11] and extended work by Swihart and Papastavrou .
( ) The problem in this paper is more like a dynamic traveling salesman problem (TSP) rather than a dynamic VRP. The main reason is that essentially there is no capacity constraints. The amount of information that can be picked up by a pigeon is very large due to the advanced storage technique. Thus, it can be viewed as if there is no limit.
( ) There is only one destination node, which is the headquarter. All pigeons must start from the headquarter and deliver all information to the headquarter rather than random destinations like in . This difference makes the delay considered here totally different from what are in [10, 12].
The rest of this paper is organized as follows. The basic model is described in Section 2, and the analyses on the two main strategies—the on-demand strategy and the waiting-based packing strategy—are presented in Sections 3 and 4, respectively. In Section 5, the numerical results are shown, and Section 6 concludes this paper.
A key question here is how a pigeon should be scheduled to pickup and deliver messages. If the goal is merely guaranteeing minimum delay for each message as in [10, 12], it is often beneficial to let the pigeon start picking up the messages whenever they are available. This approach can be viewed as an on-demand strategy.
However, there is a big disadvantage of the on-demand strategy in the scenario considered in this paper. As the headquarter is far away from the disaster area, if the message rate is not high, then the number of messages picked up on each trip is very limited. In other words, the throughput that can be achieved compared with the travel cost, which is defined as efficiency in Section 4.2, can be very low for the low-load case. In fact, a high-efficient scheduling scheme can allow a pigeon to be shared among different disaster areas. Based on this fact, a waiting-based scheduling is introduced.
In the following part of this paper, these two strategies are evaluated. The main performance metrics studied include the maximum throughput of the system, the maximum number of messages allowed to be picked up on each trip, and the comparison of efficiency of these two strategies under different load cases.
With the assumption that a pigeon is able to communicate with the information collectors, it is reasonable for a pigeon to determine the messages to be picked up when it arrives at the disaster area. The pickup strategies in the disaster area is a dynamic traveling salesman problem (DTSP) . As shown by Bertsimas and van Ryzin , possible strategies include Shortest TSP, Nearest Neighbor, and Space Fill Curve. Since the focus of this paper is analysis of the scheduling of the pigeon, only the Shortest TSP policy is considered due to its tractability on analysis.
With the Shortest TSP strategy applied, a shortest route will be formed after the messages for the current trip have been determined. Then the pigeon will go through those sites according to the shortest tour to pick up their messages.
3.1. Basic Scenario—A Single Pickup Point
To facilitate the analysis and get better insight, a simpler scenario with a single pickup point is firstly considered. For example, there is a sensor network and a collector in the disaster area . The pigeon just needs to pick up messages from the collector. For this simple case, there is no additional travel cost involved with picking up messages.
For the scenarios considered here, if the deadline of the message at the head of each trip can be met, the deadlines of all other messages can also be met.
( ) The maximum system utilization that can be supported is constrained by the deadline requirement and the travel costs between the headquarter and the disaster area. The longer the tolerant delivery delay is, the higher is the traffic rate that can be supported.
3.2. Scenario with Multiple Pickup Locations
As a more general case, there are multiple information collectors in a disaster area, and a Shortest TSP algorithm is to be employed. It is assumed that messages to be picked up are located on sites, one for each.
The on-demand strategy studied above has at least two disadvantages: ( ) the pigeon might never get any rest; ( ) the number of messages picked up on each trip can be quite limited, which causes low efficiency of the pigeon. To avoid these shortcomings, a waiting-based packing strategy is introduced and analyzed in this section.
As shown in Section 3.1, the number of messages picked up on each trip for the on-demand strategy is . If the pigeon waits some additional time in the disaster area (or the headquarter), more demands can be formed during the pigeon's waiting (can be for taking a rest, or going to other areas for a trip). Thus, the amount of messages to be picked up is more than . In the practical operation, a fixed amount of messages (or say a batch with size ) can be packed for the pigeon to pick up. An important constraint, however, is that the deadlines of messages should not be violated.
4.1. Maximum Number of Messages That Can Be Picked Up
4.2. Comparison of Efficiency
Efficiency measures the amount of message that can be picked up by a round trip of the pigeon. To facilitate the comparison, it is defined as the ratio of time spent on serving customers compared with the total time spent on the trip. Here the waiting time is not counted as the time in a trip since the pigeon can use this time period for resting or picking up messages from other areas.
For the multiple pickup scenarios, the efficiency can be computed similarly using the results of (11) and (17).
In this section, the above analysis is firstly verified with the simulation results, in which CSIM  simulation tool is employed. After the verification of correctness, the improvement of efficiency by the waiting-based packing scheme is shown.
The main parameters used here are the following: the time spent on picking up a message is hour (36 seconds), the single trip time between the headquarter and the disaster area is hour (12 minutes), and the deadline for a message is 4 hours. The travel time of a side of the disaster area, which is normalized as , is 0.05 hour (3 minutes).
5.1. Comparison of Simulation and Analytical Results
As can be seen from Figure 4, the delay goes up as the batch size becomes larger and larger. Also it can be seen that less number of messages can be packed when there are travel costs associated with pickup. In addition, the simulation results show that the analytical results are very accurate.
5.2. Effects of Deadline and Disaster Area on the Maximum Throughput
In Figure 5(b), is fixed at 4 hours and the effect of size of disaster area is shown. When the disaster area is very small, can be as large as 0.81; as the size of disaster area increases, the incurred travel cost also increases, which reduce the traffic that can be supported drastically. When the travel time along a single side of the disaster area is as large as 10 times of the travel distance between the headquarter and the disaster area, the maximum system utilization can be achieved is close to 0.
5.3. Comparison of Efficiency
Another benefit of the waiting-based packing strategy is that the efficiency of the pigeon is not so sensitive to the arrival rate as the on-demand strategy. For example, for the single pick up point case (Figure 6(a)), the efficiency of the pigeon under the waiting-based strategy when is 0.61, and it becomes 0.81 when , which is about 30% percent higher. In contrast, with the on-demand strategy the efficiency increases from 0.2 to 0.8 as increases from 20 to 8, which is 300% higher.
The dynamic scheduling strategies of pigeons for information pickup and delivery in the disaster area is analyzed. The upper bound of traffic that can be supported under the deadline constraints for the basic on-demand strategy is given through the analysis and verified by the simulations. Based on the analysis of the basic on-demand scheduling strategy, a waiting-based packing strategy is introduced. Although the latter strategy could not improve the maximum traffic rate that a pigeon can support, it improves the efficiency of the pigeon largely.
Possible future works include more detailed investigations of the dynamic routing strategies other than the shortest TSP policy and the effect of the different distributions of the arrival rate, service rate, deadlines on the conclusion, and bounds obtained in this paper.
The authors would like to thank the funding support from NSF under Grant CNS-0832000 and the Mordecai Wyatt Johnson Program of Howard University.
- 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.View ArticleGoogle Scholar
- 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, USAGoogle Scholar
- Fall K: A delay-tolerant network architecture for challenged internets. Proceedings of the Computer Communication Review (SIGCOMM '03), August 2003 33: 27-34.View ArticleGoogle Scholar
- Vahdat A, Becker D: Epidemic routing for partially-connected ad-hoc networks. Duke University, Durham, NC, USA; 2000.Google Scholar
- 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, USAGoogle Scholar
- 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.Google Scholar
- 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.Google Scholar
- Psaraftis HN: Dynamic vehicle routing: status and prospects. Annals of Operations Research 1995, 61(1):143-164. 10.1007/BF02098286MATHView ArticleGoogle Scholar
- Larsen A: The dynamic vehicle routing problem, dissertation. Technical University of Denmark; 2000.Google Scholar
- Bertsimas D, van Ryzin G: A stochastic and dynamic vehicle routing problem in the Euclidean plane. Operation Researches 1991, 39: 601-615. 10.1287/opre.39.4.601MATHView ArticleGoogle Scholar
- Bertsimas D, Ryzin G: Stochastic and dynamic vehicle routing with general demand and interarrival time distribution. Advanced Applied Probability 1993, 25: 947-978. 10.2307/1427801MATHView ArticleGoogle Scholar
- Swihart M, Papastavrou J: A stochastic and dynamic model for the singlevehicle pick-up and delivery problem. European Journal of Operational Research 1999, 114(3):447-464. 10.1016/S0377-2217(98)00260-4MATHView ArticleGoogle Scholar
- Beardwood J, Halton J, Hammersley J: The shortest path through many points. Proceedings of the Cambridge Philosophical Society 1959, 55: 299-327. 10.1017/S0305004100034095MATHMathSciNetView ArticleGoogle Scholar
- Johnson D: Local Optimization and the Traveling Salesman Problem. Proceedings of the 17th International Colloquium on Automata, languages and programming, 1990 446-461.View ArticleGoogle Scholar
- Mesquite Software, Inc : CSIM19 User's Guide. Austin, Tex, USA, 2001Google Scholar
This article is published under license to BioMed Central Ltd. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.