Data Gathering from Path Constrained Mobile Sensors Using Data MULE
Dinesh Dash

TL;DR
This paper proposes an approximation algorithm for efficient data collection from energy-constrained mobile sensors in wireless sensor networks using mobile data mules, ensuring timely data gathering within trajectory limits.
Contribution
It introduces a novel approximation algorithm specifically designed for data gathering by mobile data mules in constrained wireless sensor networks.
Findings
Algorithm effectively reduces data collection time.
Ensures data is collected within predefined time constraints.
Improves energy efficiency of sensor networks.
Abstract
In Wireless Sensor Network (WSN) sensor nodes are deployed to sense useful data from environment. Sensors are energy-constrained devices. To prolong the sensor network lifetime, now a days mobile robots (sometimes refer as data sink, data mules, or data collectors) are used for collecting the sensed data from the sensors. In this environment sensor nodes directly transfer their sensed data to the data mules. Sensed data are sometime time sensitive; therefore, the data should be collected within a predefined period. Hence, depending on the speed of the data mules the trajectory lengths of the data mules have upper limits. In this paper an approximation algorithm is proposed for collecting data from the mobile sensors using mobile data collectors
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
