Wireless sensor networks (WSN) are typically employed for monitoring applications that require data collection at specific nodes, called drains. In order to improve the robustness of data collection, multiple drains may be employed. Data from every sensor is required to be logged into two distinct sensors for data collection to be resilient to any single drain failures. In this paper, we develop a routing mechanism based on colored trees. Every node forwards the packets based on the drain address and one additional bit. The number of routing table entries at each node is 2|D|, where |D| denotes the number of drains in the network. The construction of the colored trees guarantees that every node has two node-disjoint paths to two distinct drains. The running time complexity of the algorithm is O(|D||L|), where |L| denotes the number of links in the network. Through extensive simulations, we demonstrate that employing multiple drains and disjoint routing to two distinct drains reduces the average path length compared to disjoint routing to one of the multiple drains.
展开▼
机译：无线传感器网络（WSN）通常用于监视需要在特定节点的数据收集的应用程序，称为排水管。为了提高数据收集的稳健性，可以采用多个排水管。需要每个传感器的数据都必须登录到两个不同的传感器，用于数据收集，以适应任何单一排泄故障。在本文中，我们开发了一种基于彩色树木的路由机制。每个节点都基于漏极地址和一个附加位转发数据包。每个节点的路由表条目的数量为2 | D |，其中| D |表示网络中排水数的数量。彩色树木的构造保证了每个节点都有两个节点不相交的路径，以两个不同的排水管。算法的运行时间复杂度是O（| D || L |），其中1 |表示网络中的链接数。通过广泛的仿真，我们证明使用多个排水管和不相交的路由到两个不同的排水管将平均路径长度降低到与多个排水箱中的一个不相交的路由相比。
展开▼
