Efficient Route Redundancy in DAG-Based Wireless Sensor Networks

Wireless Sensor Networks (WSN) need to be organized in order to be more resource-efficient and scalable. Directed Acyclic Graphs (DAG) are of interest for WSN organization because of their route redundancy to the root. A recent routing protocol for WSNs coming from the IETF ROLL Working Group specifies the use of DAGs and proposes to improve the route redundancy even further by routing through sibling nodes as well. In this paper, we investigate the effectiveness of routing through sibling nodes and we propose a new use of siblings which preserves most of the performance but reduces algorithmic complexity and memory requirements.