10 likes | 74 Views
Placement of ITAPs. Problem formulation Given a neighborhood with n houses, minimize # ITAPs required to cover it Factors to consider Neighborhood layout, communication radius, wireless link capacity, wireless interference, ITAP capacity, fault tolerance, … All variants are NP-hard
E N D
Placement of ITAPs • Problem formulation • Given a neighborhood with n houses, minimize # ITAPs required to cover it • Factors to consider • Neighborhood layout, communication radius, wireless link capacity, wireless interference, ITAP capacity, fault tolerance, … • All variants are NP-hard • Developed approximation algorithms for different link models with & without fault tolerance constraints • Our algorithm has a provable worst case bound of O(log n), and yields very close to the optimal solution in our simulations