A delay-tolerant network architecture for challenged internets
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Routing in a delay tolerant network
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Spray and wait: an efficient routing scheme for intermittently connected mobile networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Ant system: optimization by a colony of cooperating agents
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Dynamic Scheduling of Pigeons for Delay Constrained Applications
WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
Efficient scheduling of pigeons for a constrained delay tolerant application
EURASIP Journal on Wireless Communications and Networking - Special issue on wireless network algorithms, systems, and applications
| Hi-index | 0.00 |
Due to the mobility, limited radio range and low density of mobile devices, the mobile ad-hocand sensor networks are vulnerable to be partitioned into a group of clusters. In our work, we propose using a set of messengers (called pigeons) that relay messages among clusters. Each cluster in networks owns multiple dedicated pigeons moving around the plane to deliver messages to their destinations. We name this form as homing-pigeon (HoP) based messaging scheme. The proposed scheme is different from the preceding work such as Message Ferry and Data Mules that it is a dedicated messenger scheme. Our goal is to exploit an optimized pigeon scheduling algorithm that can promote cooperation among multi-pigeons, enhance the system performance and reduce the cost. Using simulations, we evaluate the algorithms under different scenarios. The results can be used for better understanding the impact of algorithms on system performance.