Short Paper: Structural Network Properties for Local Planarization of Wireless Sensor Networks

Network graphs satisfying redundancy and coexistence can be planarized by means of local algorithms without making assumptions on the nodes’ communication ranges. We generalize these properties to k -weak and k-strong coexistence and redundancy. Subsequently, we give empirical evidence that these properties are present in simulated wireless sensor networks as well as in actual testbed deployments, especially if looking at the graph’s c-hop clustered overlay representations, for \(c\le 2\).