Solver for placement of wireless sensors that maximizes coverage with given constraints. Two different methods are used; Binary Integer Programming and a greedy heuristic algorithm. It compares two solutions in performance and time manner.
-
Notifications
You must be signed in to change notification settings - Fork 0
Integer Programming solver for optimal coverage problem in wireless sensor networks
License
arjnklc/Optimal-Coverage-in-WSN
About
Integer Programming solver for optimal coverage problem in wireless sensor networks
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published