Sensor deployment and target localization based on virtual forces
read more
Citations
Variational Filtering algorithm for interdependent target tracking and sensor localization in wireless sensor network
A distributed deployment algorithm for communication coverage in wireless robotic networks
Energy Balancing Routing Algorithms in Wireless Sensor Networks Connected as Grids
Optimal Coverage Scheme based on QPSO in Wireless Sensor Networks
A deployment algorithm for mobile wireless sensor networks based on the electrostatic field theory
References
The Cricket location-support system
Coverage problems in wireless ad-hoc sensor networks
Art gallery theorems and algorithms
Mobile Sensor Network Deployment using Potential Fields: A Distributed, Scalable Solution to the Area Coverage Problem
Grid coverage for surveillance and target location in distributed sensor networks
Related Papers (5)
Frequently Asked Questions (10)
Q2. What are the future works mentioned in the paper "Sensor deployment and target localization based on virtual forces" ?
Their future work will be focused on overcoming the current limitations of the VFA algorithm. Since the current target localization algorithm considers only one target in the sensor field, it is necessary to extend the proposed approach to facilitate the localization of multiple objects. Extensions to non-mobile sensor nodes, and situations of sensor node failures will also be considered in future work. The VFA algorithm can be made more efficient if it is provided with the theoretical bounds on the number of sensors needed to achieve a given coverage threshold.
Q3. How is the message from the sensor to the cluster head kept small?
In order to conserve power and bandwidth, the message from the sensor to the cluster head is kept very small; in fact, the presence or absence of a target can be encoded in just one bit.
Q4. How can the VFA algorithm be used to ensure flexibility?
the desired sensor field coverage and model parameters can be provided as inputs to the VFA algorithm, thereby ensuring flexibility.
Q5. What is the role of the cluster head?
The cluster head is responsible for executing the VFA algorithm and managing the one-time movement of sensors to the desired locations.
Q6. How many units of detection error is the probabilistic detection model?
Each sensor has a detection radius as 5 units (r = 5), and range detection error as 3 units (re = 3) for the probabilistic detection model.
Q7. What is the way to cover a large grid?
This ensures that the detection regions of two sensors do not overlap, thereby minimizing “wasted overlap” and allowing us to cover a large grid with a small number of sensors.
Q8. What is the probability table for the detection of a target?
After the VFA algorithm is used to determine the final sensor locations, the cluster head generates a detection probability table for each grid point.
Q9. What is the probability that the grid point is not covered?
Since the term (1− cx,y(si))(1− cx,y(sj)) expresses the probability that neither si nor sj covers grid point at (x, y), the probability that the grid point (x, y) is covered is given by Equation (5).
Q10. What is the value of the set Srep(t)?
The set Srep(t) indicates sensors that have reported the detection at time instant t. The set Sq(t) includes sensors that are selected for querying by the cluster head at time t.