Patch-based mobile sink movement
A sensor network is divided into patches. The patches contain sensors which
collect their information, but do not forward them. Several mobile sinks are
moving around the field, visiting patches and collecting information. We assume
that we have a way to determine how much information was generated in a given
Develop and compare several methods to intelligently visit the patches.
- Greedy: each sink goes to the patch which is the most active, and no other
sink goes there.
- Planned visits: the sink go around to a set of assigned patches.
- Adaptive: dynamicaly respond to the current environment. Predict the patch
hotness for the next 10 minutes. Which path would create the greatest
reward? Which set of discrete paths (for the sinks) would create the greatest
reward in the next 10 minutes.
MORE INFO TO COME