本powerpoint演示文稿介绍了一项研究，旨在通过以下方式在整个系统中分配传感器: 目标: 尽早发现污染事件； 尽量减少受影响人口； 尽量减少污水量；和 最大化检测可能性。项目挑战包括: 定义污染事件 -可以在任何时间、任何地点发生 可以在一个位置发生，也可以同时在多个位置发生 同时； 传感器位置 -多种组合，以及 从n个节点分配k个传感器；有多少可能的污染事件 -对于一个小系统来说是一个巨大的数字，理论上是无限的； 解空间 -巨大到天文的组合， e、 g.1000个节点有5个、10个和20个传感器，以及 可能的解决方案包括8.2x10¹²、2.6x10²³和3.4x10⁴¹。介绍了水传感器网络（BWSN），以及BWSN的设计目标、配方、网络解决方案、网络比较和实用技巧。 包括表格、数字。

This powerpoint presentation presents a study to allocate sensors throughout a system with the objectives of: detecting contamination events as early as possible; minimizing the affected population; minimizing the contaminated water volume; and, maximizing detection likelihood. Project challenges included: define contamination events - can happen any time at any location, and can happen at one location and multiple locations at the same time; sensor locations - many combinations, and allocate k sensors from n nodes; how many possible contamination events - huge number for a small system, and theoretically infinite; solution space - huge to astronomical combination, e.g. for 1000 nodes to have 5, 10 and 20 sensors, and possible solutions include 8.2x10¹², 2.6x10²³, and 3.4x10⁴¹. Battle of Water Sensors Network (BWSN) is presented, along with BWSN design objectives, formulation, network solutions, network comparisons, and practical tips. Includes tables, figures.