帮忙翻译

帮忙翻译

The first step in solving the problem is to identify the parts of the area covered by different sensor nodes. A straightforward approach to the question would be to treat each point in the area (assuming some finite resolution) as a distinctive part of the area. In that case a sensor node would be characterized by a list of all points it covers. In order to reduce dimensionality of the problem, we introduce notion of the field, defined in the following way: DEFINITION: A field is a set of points. Two points belong to the same field iff they are covered by the same set of sensors. An example how points are organized in fields is given in Fig. 2. The part of the algorithm that determines fields is shown in Fig. 3. The algorithm uses the locations of the nodes as the input, and allocates the points in the area into fields. Whenever a new sensor is added to the set of sensors, the status of all points covered by that sensor is examined. The new sensor may cover some points that were not previously covered by any sensor, as well as points already belonging to some established fields. All points previously not covered belong to one new field. A part of an existing field or a whole existing field covered by the new sensor becomes a new field, whose covering set consists of the covering set of sensors for the original old field with addition of the new sensor. After the fields are established, for each sensor a list of all fields covered by that sensor is created. The set of all fields in the area is denoted as A, and set of sensors as C. We can now formally define the SET K-COVER problem:第一步，在解决这个问题是要确定零件该地区所涵盖的各种传感器节点。 1 直率的态度来处理问题，将是治疗每一个点在该地区（假设一些有限决议） ，作为与众不同的部分地区。在这种情况下，传感器节点将特点列出了所有要点，它涵盖了。为了减少维度的问题，我们引进的概念外地的，这样定义的： 定义：一个外地的是一套点。两点属于以同一领域论坛，他们所涵盖的同一套传感器。 一个例子是如何分组织在各个领域给出图。 2 。该部分的算法，决定等各个领域显示图。 3 。该算法使用地点的节点作为投入，并拨出了点，在该地区成领域的合作。每当一个新的传感器是增加一套传感器， 地位的各点，所涵盖的传感器是审查。 新的传感器有可能掩盖了一些被认为是不先前所涵盖的任何传感器，以及点已属于一些既定领域的合作。所有点以前不包括属于一个新的领域。一部分现有外地或整个现有领域涵盖了新的传感器成为一个新的领域，其覆盖集选区的包括一套传感器原来的旧场，除了这个新的传感器。 之后，该领域确立后，为每一个传感器列出了所有涵盖的领域由该传感器就产生了。集合各领域该地区是用字母A和一套传感器作为丙现在，我们可以正式确定台K覆盖的问题：