2010 24th IEEE International Conference on Advanced Information Networking and Applications 2010
DOI: 10.1109/aina.2010.146
|View full text |Cite
|
Sign up to set email alerts
|

Mobile Element Path Planning for Time-Constrained Data Gathering in Wireless Sensor Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

1
15
0

Year Published

2014
2014
2022
2022

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 27 publications
(16 citation statements)
references
References 17 publications
1
15
0
Order By: Relevance
“…This problem can be seen as a special case of VRPTW, assuming the lower bound of the time window equal to zero. Several heuristics have been presented in the literature for these kinds of problems (e.g., [17,23,24]), which will be considered as a term of comparison in the performance evaluation of this paper. However, scalability is not always guaranteed by these classic schemes.…”
Section: Related Workmentioning
confidence: 99%
See 3 more Smart Citations
“…This problem can be seen as a special case of VRPTW, assuming the lower bound of the time window equal to zero. Several heuristics have been presented in the literature for these kinds of problems (e.g., [17,23,24]), which will be considered as a term of comparison in the performance evaluation of this paper. However, scalability is not always guaranteed by these classic schemes.…”
Section: Related Workmentioning
confidence: 99%
“…Furthermore, in our problem the mobile elements' tours are fixed and planned in advance so as to satisfy the given time constraints. Another closely related problem is studied in [17], where a data gathering solution is proposed based on mobile elements traveling disjoint tours to cover the network (including a fixed sink node) so to meet all delivery deadlines and minimize the total tour length. In particular, two heuristics for the m-TSP with Deadlines are proposed which will be considered in the performance evaluation section as a term of comparison.…”
Section: Related Workmentioning
confidence: 99%
See 2 more Smart Citations
“…The proposed solution is evaluated experimentally on a wide range of practical scenarios, showing that it consistently outperforms the algorithm of [21] and is not very far from the optimum in small instances. The problem of planning multiple MS paths that optimize the total length travelled while gathering the data has also been investigated by the same authors in [22,23].…”
Section: Introductionmentioning
confidence: 99%