2011
DOI: 10.1109/tmc.2010.193
|View full text |Cite
|
Sign up to set email alerts
|

Efficient Data Collection in Wireless Sensor Networks with Path-Constrained Mobile Sinks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
160
0

Year Published

2011
2011
2017
2017

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 252 publications
(161 citation statements)
references
References 19 publications
1
160
0
Order By: Relevance
“…4) Sensors transmit data with max power in communication distance r. The energy consumption is independent with communication distance. Ignoring the energy consumption of storage and computation, the node energy consumption for communication is similar to which in [11].…”
Section: Network Modelmentioning
confidence: 99%
“…4) Sensors transmit data with max power in communication distance r. The energy consumption is independent with communication distance. Ignoring the energy consumption of storage and computation, the node energy consumption for communication is similar to which in [11].…”
Section: Network Modelmentioning
confidence: 99%
“…In Maximum Amount Shortest path (MASP) [10] data collection by mobile sink is maximized. The mobile sink travels in a fixed trajectory.…”
Section: Related Workmentioning
confidence: 99%
“…In [22] the authors of the aforementioned DMS paper use the label-covering problem to model the path planning problem. Among the more prevalent heuristics used to solve the TSP are genetic algorithms, which are used statically as in [23]. There have been other proposed solutions that use more dynamic constraints, such as in [24], where the authors compare the earliest deadline first heuristic and the weighted sum heuristic to eliminate the buffer overflow problem, while in [25] the authors construct a Hamiltonian tour by using a minimum spanning tree.…”
Section: Traveling Salesman Problemmentioning
confidence: 99%