Multiple Round Random Ball Placement: Power of Second Chance

DOI10.1007/978-3-642-02882-3_44MaRDI QIDQ5323092zbMATH OpenOpenAlexFDO

Authors

Publication date 23 July 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02882-3_44

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Coverage by randomly deployed wireless sensor networks
• Balls into bins with related random choices
• How many wireless sensors are needed to guarantee connectivity of a one-dimensional network with random inter-node spacing?
• Euro-Par 2004 Parallel Processing
• Barrier coverage

Cites work

• A distributed method for solving semidefinite programs arising from ad hoc wireless sensor network localization
• Coverage by randomly deployed wireless sensor networks
• scientific article; zbMATH DE number 4170917 (Why is no real title available?)
• scientific article; zbMATH DE number 1254188 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• On the theta-coverage and connectivity of large random networks
• Simple proofs of occupancy tail bounds
• Tail bounds for occupancy and the satisfiability threshold conjecture
• The capacity of wireless networks
• Theory of semidefinite programming for sensor network localization

This page was built for publication: Multiple Round Random Ball Placement: Power of Second Chance

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