On the Displacement for Covering a Unit Interval with Randomly Placed Sensors

July 31, 2015 Β· Declared Dead Β· πŸ› Information Processing Letters

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors RafaΕ‚ Kapelko, Evangelos Kranakis arXiv ID 1507.08923 Category cs.DS: Data Structures & Algorithms Citations 16 Venue Information Processing Letters Last Checked 3 months ago
Abstract
Consider $n$ mobile sensors placed independently at random with the uniform distribution on a barrier represented as the unit line segment $[0,1]$. The sensors have identical sensing radius, say $r$. When a sensor is displaced on the line a distance equal to $d$ it consumes energy (in movement) which is proportional to some (fixed) power $a > 0$ of the distance $d$ traveled. The energy consumption of a system of $n$ sensors thus displaced is defined as the sum of the energy consumptions for the displacement of the individual sensors. We focus on the problem of energy efficient displacement of the sensors so that in their final placement the sensor system ensures coverage of the barrier and the energy consumed for the displacement of the sensors to these final positions is minimized in expectation. In particular, we analyze the problem of displacing the sensors from their initial positions so as to attain coverage of the unit interval and derive trade-offs for this displacement as a function of the sensor range. We obtain several tight bounds in this setting thus generalizing several of the results of [10] to any power $a >0$.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Data Structures & Algorithms

Died the same way β€” πŸ‘» Ghosted