|
|||||
|
|
Coverage with k-transmitters in the presence of obstacles |
|
| Authors: | Brad Ballinger Nadia Benbernou Prosenjit Bose Mirela Damian Erik D. Demaine Vida Dujmović Robin Flatland Ferran Hurtado John Iacono Anna Lubiw Pat Morin Vera Sacristán Diane Souvaine Ryuhei Uehara |
| Affiliation: | 1. Humboldt State University, Arcata, USA 2. Massachusetts Institute of Technology, Cambridge, USA 3. Carleton University, Ottawa, Canada 4. Villanova University, Villanova, USA 5. Siena College, Loudonville, USA 6. Universitat Politècnica de Catalunya, Barcelona, Spain 7. Polytechnic Institute of New York University, New York, USA 8. University of Waterloo, Waterloo, Canada 9. Tufts University, Medford, USA 10. Japan Advanced Institute of Science and Technology, Ishikawa, Japan |
| Abstract: | For a fixed integer k≥0, a k-transmitter is an omnidirectional wireless transmitter with an infinite broadcast range that is able to penetrate up to k “walls”, represented as line segments in the plane. We develop lower and upper bounds for the number of k-transmitters that are necessary and sufficient to cover a given collection of line segments, polygonal chains and polygons. |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |