Exact formulations for the minimum interference problem in k-connected \textit{ad hoc} wireless networks
From MaRDI portal
Publication:2829159
Recommendations
- Minimizing interference for the highway model in wireless ad-hoc and sensor networks
- Power optimization in ad hoc wireless network topology control with biconnectivity requirements
- On the complexity of minimizing interference in ad-hoc and sensor networks
- Constructing minimum-interference networks
- SOFSEM 2006: Theory and Practice of Computer Science
Cites work
- scientific article; zbMATH DE number 5823062 (Why is no real title available?)
- Algorithms for scheduling with power control in wireless networks
- Congestion, dilation, and energy in radio networks
- Constructing minimum-interference networks
- Exact algorithms to minimize interference in wireless sensor networks
- Minimizing interference of a wireless ad-hoc network in a plane
- On the complexity of minimizing interference in ad-hoc and sensor networks
- Power optimization in ad hoc wireless network topology control with biconnectivity requirements
- The capacity of wireless networks
- Wireless scheduling with power control
Cited in
(6)- MLQCC: an improved local search algorithm for the set k‐covering problem
- Wireless three-hop networks with stealing. II: Exact solutions through boundary value problems
- Computing and Combinatorics
- Performance evaluation for energy efficient topologic control in ad hoc wireless networks
- Power optimization in ad hoc wireless network topology control with biconnectivity requirements
- Complexity of increasing the secure connectivity in wireless ad hoc networks
This page was built for publication: Exact formulations for the minimum interference problem in \(k\)-connected \textit{ad hoc} wireless networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829159)