Minimizing the Maximum Interference is Hard
classification
💻 cs.NI
cs.CG
keywords
interferencetransmissionmaximummodelrangescasechoosingcommunication
read the original abstract
We consider the following interference model for wireless sensor and ad hoc networks: the receiver interference of a node is the number of transmission ranges it lies in. We model transmission ranges as disks. For this case we show that choosing transmission radii which minimize the maximum interference while maintaining a connected symmetric communication graph is NP-complete.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.