2012
DOI: 10.1109/tpds.2011.140
|View full text |Cite
|
Sign up to set email alerts
|

An Efficient Prediction-Based Routing in Disruption-Tolerant Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
117
0

Year Published

2012
2012
2017
2017

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 154 publications
(117 citation statements)
references
References 19 publications
0
117
0
Order By: Relevance
“…In the same line of [3], Q. Yuan et al in [12] introduced the idea of the contact probability as the main factor of message forwarding. They introduced a single-copy routing scheme called predict and relay (PER) in the scenario where the node movement, including the information on when the contact will occur and how long it will last, is semi-deterministic and can be predicted provided with sufficiently long mobility history.…”
Section: Related Workmentioning
confidence: 99%
See 2 more Smart Citations
“…In the same line of [3], Q. Yuan et al in [12] introduced the idea of the contact probability as the main factor of message forwarding. They introduced a single-copy routing scheme called predict and relay (PER) in the scenario where the node movement, including the information on when the contact will occur and how long it will last, is semi-deterministic and can be predicted provided with sufficiently long mobility history.…”
Section: Related Workmentioning
confidence: 99%
“…Nonetheless, they are subject to various limitations due to the simplified assumptions related to the nodal mobility scenarios [12], [23], or the utility function presentation [11]. More importantly, the channel capacity and buffer occupancy states have not completely been considered as factors in the derivation of utility functions.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Community detection can help us to uncover and understand local community structure in both offline mobile trace analysis and online applications, and it is helpful in decreasing forwarding time as well as the storage capacity of nodes. Since the relationships between nodes usually seem to be stable and less volatile than node mobility, forwarding schemes based on community [2][3][4][5][6]outperform traditional approaches [7,8]. Overlapping community detection, one of the most interesting research of community detection, is the primary focus of this paper.…”
Section: Introductionmentioning
confidence: 99%
“…A variety of DTN protocols has been proposed in recent years (e.g., [1,2,3,4,5,6,7]); common to these approaches is the idea of reasoning about users' mobility when selecting content carriers, in order to achieve high delivery, while keeping the overall network overhead (i.e., number of message replicas) low. As battery constraints on mobile phones are not expected to be significantly lifted in the coming years [8] (i.e., Moore's Law will apply to the miniaturisation of battery size, rather than increasing its lifetime), energy efficiency has become an important topic for this type of participatory networks.…”
Section: Introductionmentioning
confidence: 99%