On the public citation graph
On the Robot Assisted Movement in Wireless Mobile Sensor Networks
0 signed · 34 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-030-01177-2_28openalex-extracted
An Energy Efficient Coverage Path Planning Approach for Mobile Robots
inferredcites →https://doi.org/10.1007/978-3-319-08783-2_43openalex-extracted
Displacing Random Sensors to Avoid Interference
inferredcites →https://doi.org/10.1007/978-3-319-19662-6_11openalex-extracted
On the Displacement for Covering a Square with Randomly Placed Sensors
inferredcites →https://doi.org/10.1007/s00453-019-00611-7openalex-extracted
Weak Coverage of a Rectangular Barrier
inferredcites →https://doi.org/10.1007/s10846-013-9856-0openalex-extracted
On the Complete Coverage Path Planning for Mobile Robots
inferredcites →https://doi.org/10.1007/s11276-006-9856-0openalex-extracted
Barrier coverage with wireless sensors
inferredcites →https://doi.org/10.1016/j.adhoc.2007.05.003openalex-extracted
Strategies and techniques for node placement in wireless sensor networks: A survey
inferredcites →https://doi.org/10.1016/j.adhoc.2015.08.005openalex-extracted
Deployment and reallocation in mobile survivability-heterogeneous wireless sensor networks for barrier coverage
inferredcites →https://doi.org/10.1016/j.adhoc.2016.01.002openalex-extracted
On the displacement for covering a d-dimensional cube with randomly placed sensors
inferredcites →https://doi.org/10.1016/j.comcom.2017.06.010openalex-extracted
Coverage in mobile wireless sensor networks (M-WSN): A survey
inferredcites →https://doi.org/10.1016/j.comnet.2016.08.007openalex-extracted
Autonomous deployment of wireless sensor networks for optimal coverage with directional sensing model
inferredcites →https://doi.org/10.1016/j.dam.2020.04.027openalex-extracted
Optimal online and offline algorithms for robot-assisted restoration of barrier coverage
inferredcites →https://doi.org/10.1016/j.ipl.2016.06.004openalex-extracted
On the displacement for covering a unit interval with randomly placed sensors
inferredcites →https://doi.org/10.1016/j.jnca.2017.01.010openalex-extracted
Constructing event-driven partial barriers with resilience in wireless mobile sensor networks
inferredcites →https://doi.org/10.1016/j.pmcj.2008.02.001openalex-extracted
Coverage and connectivity issues in wireless sensor networks: A survey
inferredcites →https://doi.org/10.1016/j.pmcj.2018.10.006openalex-extracted
On the maximum movement to the power of random sensors for coverage and interference
inferredcites →https://doi.org/10.1016/j.pmcj.2018.12.001openalex-extracted
Relay node placement under budget constraint
inferredcites →https://doi.org/10.1016/j.tcs.2009.07.007openalex-extracted
Optimal movement of mobile sensors for barrier coverage of a planar region
inferredcites →https://doi.org/10.1017/s0263574719001127openalex-extracted
GM-VPC: An Algorithm for Multi-robot Coverage of Known Spaces Using Generalized Voronoi Partition
inferredcites →https://doi.org/10.1109/infocom.2016.7524334openalex-extracted
A PTAS to minimize mobile sensor movement for target coverage problem
inferredcites →https://doi.org/10.1109/tc.2011.82openalex-extracted
Centralized and Clustered k-Coverage Protocols for Wireless Sensor Networks
inferredcites →https://doi.org/10.1109/tim.2018.2800178openalex-extracted
Area Coverage Optimization Using Heterogeneous Robots: Algorithm and Implementation
inferredcites →https://doi.org/10.1109/tmech.2019.2963439openalex-extracted
Active SLAM for Mobile Robots With Area Coverage and Obstacle Avoidance
inferredcites →https://doi.org/10.1109/tnet.2018.2815630openalex-extracted
Approximation Algorithms for Sweep Coverage Problem With Multiple Mobile Sensors
inferredcites →https://doi.org/10.1109/tpds.2008.146openalex-extracted
Critical Density for Coverage and Connectivity in Three-Dimensional Wireless Sensor Networks Using Continuum Percolation
inferredcites →https://doi.org/10.1109/tpds.2008.246openalex-extracted
Movement-Assisted Connectivity Restoration in Wireless Sensor and Actor Networks
inferredcites →https://doi.org/10.1137/140968094openalex-extracted
Optimal One-Dimensional Coverage by Unreliable Sensors
inferredcites →https://doi.org/10.1142/s1793830919500150openalex-extracted
Asymptotic formula for sum of moment mean deviation for order statistics from uniform distribution
inferredcites →https://doi.org/10.1145/1462187.1462189openalex-extracted
Fault tolerance measures for large-scale wireless sensor networks
inferredcites →https://doi.org/10.1145/2486159.2486171openalex-extracted
Expected sum and maximum of displacement of random sensors for coverage of a domain
inferredcites →https://doi.org/10.1145/3154273.3154330openalex-extracted
On the Maximum Movement of Random Sensors for Coverage and Interference on a Line
inferredcites →https://doi.org/10.1145/3369740.3369773openalex-extracted
Optimal Patrolling of High Priority Segments while Visiting the Unit Interval with a Set of Mobile Robots
inferredcites →https://doi.org/10.1145/3457408openalex-extracted
On the Range Assignment in Wireless Sensor Networks for Minimizing the Coverage-Connectivity Cost
inferredcites →https://doi.org/10.11650/tjm/200503openalex-extracted
On Binomial and Poisson Sums Arising from the Displacement of Randomly Placed Sensors
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.