Minimizing Interference Potential Among Moving Entities

DOI10.1137/1.9781611975482.147MaRDI QIDQ5236335zbMATH OpenOpenAlexFDO

Authors Daniel Busto, W. Evans, David Kirkpatrick

Publication date 15 October 2019

Published in Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611975482.147

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Minimizing co-location potential of moving entities
• On interference among moving sensors and related problems
• On interference among moving sensors and related problems
• Displacing random sensors to avoid interference
• Interference Mitigation Through Limited Transmitter Cooperation
• Interference Mitigation via Relaying
• Controlling interference in ambients
• Minimizing interference of a wireless ad-hoc network in a plane

Cited in

(8)

• Minimizing co-location potential of moving entities
• On interference among moving sensors and related problems
• On interference among moving sensors and related problems
• Query minimization under stochastic uncertainty
• Minimizing query frequency to bound congestion potential for moving entities at a fixed target time
• A frequency-competitive query strategy for maintaining low collision potential among moving entities
• Frequency-competitive query strategies to maintain low congestion potential among moving entities
• Evolving distributions under local motion

This page was built for publication: Minimizing Interference Potential Among Moving Entities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5236335)