Exact formulations for the minimum interference problem in k-connected \textit{ad hoc} wireless networks

DOI10.1111/ITOR.12327zbMATH Open1348.90176OpenAlexW2471605748MaRDI QIDQ2829159FDOQ2829159

Authors: Renato E. N. Moraes, Celso C. Ribeiro, Glaydston M. Ribeiro 

Publication date: 27 October 2016

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.12327

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

zbMATH Keywords

wireless sensor networksad hoc networksenergy consumption optimizationtopology controlexact formulationsinterference minimization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Communication networks in operations research (90B18)

Cites Work

• Wireless scheduling with power control
• Algorithms for scheduling with power control in wireless networks
• The capacity of wireless networks
• On the complexity of minimizing interference in ad-hoc and sensor networks
• Power optimization in ad hoc wireless network topology control with biconnectivity requirements
• Title not available (Why is that?)
• Constructing minimum-interference networks
• Minimizing interference of a wireless ad-hoc network in a plane
• Exact algorithms to minimize interference in wireless sensor networks
• Congestion, dilation, and energy in radio networks

Cited In (5)

• Computing and Combinatorics
• Wireless three-hop networks with stealing. II: Exact solutions through boundary value problems
• Performance evaluation for energy efficient topologic control in ad hoc wireless networks
• Complexity of increasing the secure connectivity in wireless ad hoc networks
• MLQCC: an improved local search algorithm for the set k‐covering problem

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)