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

Generic prediction assisted single-copy routing in underwater delay tolerant sensor networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
23
0

Year Published

2014
2014
2020
2020

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 35 publications
(23 citation statements)
references
References 35 publications
0
23
0
Order By: Relevance
“…Some applications of optimization methods used in time‐critical UASNs include routing protocol development and optimal relay‐node deployment. The surface‐level gateway node‐deployment problem can be considered as an example of optimal relay‐node deployment.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Some applications of optimization methods used in time‐critical UASNs include routing protocol development and optimal relay‐node deployment. The surface‐level gateway node‐deployment problem can be considered as an example of optimal relay‐node deployment.…”
Section: Related Workmentioning
confidence: 99%
“…A considerable amount of literature has been published on the usage of optimization methods for time-critical UASNs in recent years. In these works, the objective functions of the proposed optimization models are generally defined as (a) the minimization of end-to-end delay (eg, previous studies 4,5,[13][14][15][16][17][18] ), (b) the minimization of energy consumption (eg, previous studies 2,5,7,15,[18][19][20], and (c) the maximization of network lifetime (eg, previous studies 4, [21][22][23] ). Some constraints of these optimization models include the per-node flow-balance constraint (ie, flows are balanced at each node), the end-to-end flow conservation constraint (ie, every generated data are terminated at the sink node), the energy capacity constraint (ie, amount of energy consumed by nodes are limited), data-capacity constraint (ie, the capacity of each link is bounded), and the delay constraint (ie, end-to-end delay of the network is limited), which are either defined as separate constraints 2,7,9,20,[22][23][24] or incorporated into some constraints (eg, per-flow balance).…”
Section: Related Workmentioning
confidence: 99%
“…A three-dimensional grid division method is proposed in [37], to support the packets forwarding in a grid-by-grid manner. A prediction assisted single-copy routing scheme is developed for efficient packet routing in UWSNs [38]. Intuitively, underlying network mobility patterns are characterized, and the features of the best routing paths are determined, which are applied as the guideline for selecting the most appropriate routing paths afterwards.…”
Section: Related Work and Comparisonmentioning
confidence: 99%
“…In [26], [27], the depth of sensor nodes could be controlled and nodes moved as a group with water current, thus the mobility of nodes was essentially limited and regular. A generic prediction assisted single-copy routing (PASR) scheme [28], that can be configured for multiple mobility models, was investigated. PASR differentiated the network mobility patterns according to the short-duration trace, then depicted the features of best routing paths.…”
Section: Introductionmentioning
confidence: 99%