We present a simple model, called depleatable channels, of multi-hop communication in ad hoc networks. We introduce a model for channel energy consumption, and we propose a notion of channel equivalence based on the communication service they provide, regardless of specific routing protocols. In particular, we consider equivalent two channels with identical maximum and minimum inhibiting flow, and prove that this notion of equivalence, and variants of it, coincide with standard equivalences borrowed from the theory of concurrency. Unfortunately, while the maximum flow can be computed in polynomial time, calculating the value of a minimum inhibiting flow is NP-hard. Thus, we propose a characterization of those graphs, called weak, which admit charge assignments for which the minimum inhibiting flow is strictly less than the maximum flow and show that weakness can be checked efficiently by providing an algorithm that does so in polynomial time.

中文翻译：

---

耗竭通道：网络设计中的动态、行为和效率

我们提出了一个简单的模型，称为可耗尽信道，用于自组织网络中的多跳通信。我们引入了一个信道能量消耗模型，并基于它们提供的通信服务提出了信道等效的概念，而不管特定的路由协议。特别地，我们考虑具有相同最大和最小抑制流的等效两个通道，并证明这种等效概念及其变体与从并发理论中借用的标准等效一致。不幸的是，虽然可以在多项式时间内计算最大流量，但计算最小抑制流量的值是 NP-hard 的。因此，我们提出了这些图的特征，称为弱，