In a restricted combinatorial mobile sensor network (RCMSN), there are n sensors that continuously receive and store information from outside. Every two sensors communicate exactly once, and at an event when two sensors communicate, they receive and store additionally all information the other has stored. C. Gu, I. Downes, O. Gnawali, and L. Guibas proposed a capacity of information diffusion in mobile sensor networks. They collected all information received by two sensors between a communication event and the previous communication events for each of them into one information packet, and considered the number of sensors a packet eventually reaches. Then they defined the capacity of an RCMSN to be the ratio of the average number of sensors the packets reach and the total number of sensors. While they have studied the expected capacity of an RCMSN (when the order of communications is random), we found the RCMSNs with maximum and minimum capacities. We also found the maximum, minimum, and expected capacities for several related mobile sensor network constructions, such as ones generated from intersections of lines, as well as complexity results concerning when a mobile sensor network can be generated in such geometric ways.

中文翻译：

---

移动传感器网络：实现能力和复杂性的界限

在受限组合移动传感器网络 (RCMSN) 中，有 n 个传感器连续接收和存储来自外部的信息。每两个传感器恰好通信一次，并且在两个传感器通信的事件中，它们另外接收并存储另一个已存储的所有信息。C. Gu、I. Downes、O. Gnawali 和 L. Guibas 提出了移动传感器网络中的信息传播能力。他们将两个传感器在一次通信事件和之前的通信事件之间接收到的所有信息收集到一个信息包中，并考虑了一个数据包最终到达的传感器数量。然后他们将 RCMSN 的容量定义为数据包到达的平均传感器数量与传感器总数的比率。虽然他们研究了 RCMSN 的预期容量（当通信顺序是随机的），但我们发现了具有最大和最小容量的 RCMSN。我们还发现了几个相关移动传感器网络结构的最大、最小和预期容量，例如从线的交叉点生成的，以及关于何时可以以这种几何方式生成移动传感器网络的复杂性结果。