Abstract

In this work, we investigate the use of epidemic routing in energy constrained Delay Tolerant Networks (DTNs). In DTNs, connected paths between source and destination rarely materialize due to the mobility and sparse density of nodes. Epidemic routing is well-suited for these environments due to its simplicity and fully distributed implementation. In epidemic routing, messages are relayed by intermediate nodes at contact opportunities, i.e., when pairs of nodes come within transmission range. Each node needs to decide whether to forward its message upon contact with a new node based on its residual energy level and the age of that message.

Keywords:
Computer network Computer science Routing (electronic design automation) Node (physics) Geographic routing Simplicity Transmission (telecommunications) Static routing Energy (signal processing) Distributed computing Routing protocol Telecommunications Engineering

Metrics

56
Cited By
12.89
FWCI (Field Weighted Citation Impact)
31
Refs
0.99
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Opportunistic and Delay-Tolerant Networks
Physical Sciences →  Computer Science →  Computer Networks and Communications
Energy Harvesting in Wireless Networks
Physical Sciences →  Engineering →  Electrical and Electronic Engineering
Mobile Ad Hoc Networks
Physical Sciences →  Computer Science →  Computer Networks and Communications

Related Documents

JOURNAL ARTICLE

Optimal Energy-Aware Epidemic Routing in DTNs

Soheil EshghiM. H. R. KhouzaniSaswati SarkarNess B. ShroffSantosh S. Venkatesh

Journal:   IEEE Transactions on Automatic Control Year: 2015 Vol: 60 (6)Pages: 1554-1569
JOURNAL ARTICLE

Incentive-aware routing in DTNs

Upendra ShevadeHan Hee SongLili QiuYin Zhang⋆

Journal:   Proceedings/Proceedings - International Conference on Network Protocols Year: 2008 Pages: 238-247
© 2026 ScienceGate Book Chapters — All rights reserved.