2009
DOI: 10.1016/j.adhoc.2008.04.001
|View full text |Cite
|
Sign up to set email alerts
|

Using group structures for efficient routing in delay tolerant networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
21
0

Year Published

2011
2011
2022
2022

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 16 publications
(21 citation statements)
references
References 14 publications
0
21
0
Order By: Relevance
“…Thomas et al [20,21] and Dang and Wu [22] consider the scenario in DTN where some nodes under entity mobility may stay close to each other for some time and thus they can form a cluster. Making use of this vicinity among the nodes in one cluster for packet delivery could improve the routing performance.…”
Section: Introductionmentioning
confidence: 99%
See 3 more Smart Citations
“…Thomas et al [20,21] and Dang and Wu [22] consider the scenario in DTN where some nodes under entity mobility may stay close to each other for some time and thus they can form a cluster. Making use of this vicinity among the nodes in one cluster for packet delivery could improve the routing performance.…”
Section: Introductionmentioning
confidence: 99%
“…The first mechanism is the group-based packet exchange. Similar to [20][21][22], by treating each cluster/group as a single node, G-ER is a two-layer routing, including the inter-group routing and intra-group routing. The strategy of ER is adopted for the inter-group routing to exchange packets between groups, and a table-driven routing is employed for the intra-group routing to handle the packet delivery inside the group.…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations
“…At present, many research works of DTN mainly focus on routing protocols. Due to the uncertainty of transmission opportunities, the routing algorithm needs to select some nodes as relay which carry and forward data for other nodes [9,10] . A flood-based Epidemic routing algorithm was proposed in [11,12].…”
Section: Introductionmentioning
confidence: 99%