1 / 1

Optimizing ITAP Placement in Wireless Networks

Solve the problem of minimizing the number of ITAPs required to cover n houses in a neighborhood, considering factors like layout, communication radius, and interference. Developed approximation algorithms with fault tolerance constraints. NP-hard variants addressed with worst-case bound O(log n).

margie
Download Presentation

Optimizing ITAP Placement in Wireless Networks

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. 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

More Related