On the Robot Assisted Movement in Wireless Mobile Sensor Networks
Sajal K. Das, Rafa{\l} Kapelko

TL;DR
This paper investigates the use of a mobile robot to efficiently reposition randomly deployed sensors on a line and plane, optimizing energy use while achieving coverage and interference constraints in wireless sensor networks.
Contribution
It introduces bounds on robot movement energy consumption and demonstrates significant reductions in movement costs for coverage and interference scheduling.
Findings
Derived upper bounds for robot movement energy consumption
Achieved sharp decrease in total robot movement cost
Ensured coverage and interference requirements simultaneously
Abstract
This paper deals with random sensors initially randomly deployed on the line according to general random process and on the plane according to two independent general random processes. The mobile robot with carrying capacity placed at the origin point is to move the sensors to achieve the general scheduling requirement such as coverage, connectivity and thus to satisfy the desired communication property in the network. We study tradeoffs between the energy consumption in robot's movement, the numbers of sensors , the sensor range , the interference distance , and the robot capacity until completion of the coverage simultaneously with interference scheduling task. In this work, we obtain upper bounds for the energy consumption in robot's movement and obtain the sharp decrease in the total movement cost of the robot so as to provide the coverage simultaneously with…
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.
Taxonomy
TopicsMobile Ad Hoc Networks · Optimization and Search Problems · Energy Efficient Wireless Sensor Networks
