Wireless multihop communication in sparse Vehicular Ad-Hoc Networks
International Journal of Internet Protocol Technology
PreDA: predicate routing for DTN architectures over MANET
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
IEEE Journal on Selected Areas in Communications
Opportunistic data collection in sparse wireless sensor networks
EURASIP Journal on Wireless Communications and Networking - Special issue on opportunistic and delay tolerant networks
Comparison of efficient random walk strategies for wireless multi-hop networks
Computer Communications
Reasonable routing in delay/disruption tolerant networks
Frontiers of Computer Science in China
Buffer dimensioning of delay-tolerant network nodes - a large deviations approach
ICDCN'12 Proceedings of the 13th international conference on Distributed Computing and Networking
Cost efficient data transfer for M2M infrastructure with heterogeneous wireless networks
Proceedings of the first ACM international workshop on Practical issues and applications in next generation wireless networks
Analytical model of epidemic routing for delay-tolerant networks
Proceedings of the 1st ACM workshop on High performance mobile opportunistic systems
Network coded routing in delay tolerant networks: an experience report
Proceedings of the 3rd Extreme Conference on Communication: The Amazon Expedition
Performance Modeling for Relay Cooperation in Delay Tolerant Networks
Mobile Networks and Applications
Multi-Spreader Routing for sparsely populated mobile ad hoc networks
Wireless Networks
Performance modeling of DTN routing with heterogeneous and selfish nodes
Wireless Networks
| Hi-index | 0.07 |
This paper considers (p, q )-Epidemic Routing, a class of store-carry-forward routing schemes, for sparsely populated mobile ad hoc networks. Our forwarding scheme includes Two-Hop Forwarding and the conventional Epidemic Routing as special cases. In such forwarding schemes, the original packet is copied many times and its packet copies spread over the network. Therefore those packet copies should be deleted after a packet reaches the destination. We analyze the performance of (p, q)-Epidemic Routing with VACCINE recovery scheme. Unlike most of the existing studies, we discuss the performance of (p, q)-Epidemic Routing in depth, taking account of the recovery process that deletes unnecessary packets from the network.