On the complexity of minimizing interference in ad-hoc and sensor networks

DOI10.1016/j.tcs.2008.03.004zbMath1156.68303OpenAlexW2124007962MaRDI QIDQ936529

Guido Proietti, Davide Bilò

Publication date: 14 August 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.03.004

zbMATH Keywords

interferencead hoc networkssensor networkstransmission power assignment

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items

Strong minimum energy hierarchical topology in wireless sensor networks ⋮ Strong minimum energy \(2\)-hop rooted topology for hierarchical wireless sensor networks ⋮ Minimizing interference in ad hoc networks with bounded communication radius ⋮ Minimizing total interference in asymmetric sensor networks ⋮ Minimum Total Node Interference in Wireless Sensor Networks ⋮ Exact formulations for the minimum interference problem ink-connectedad hocwireless networks ⋮ Minimizing the maximum sender interference by deploying additional nodes in a Wireless Sensor Network

Cites Work

• Unnamed Item
• Unnamed Item
• Power consumption in packet radio networks
• Energy-efficient wireless network design
• Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks
• A threshold of ln n for approximating set cover
• Algorithms - ESA 2003