The two-terminal reliability calculation for wireless sensor networks (WSNs) is a #P-hard problem. The reliability calculation of WSNs on the multicast model provides an even worse combinatorial explosion of node states with respect to the calculation of WSNs on the unicast model; many real WSNs require the multicast model to deliver information. This research first provides a formal definition for the WSN on the multicast model. Next, a symbolic OBDD Multicast algorithm is proposed to evaluate the reliability of WSNs on the multicast model. Furthermore, our research on OBDD Multicast construction avoids the problem of invalid expansion, which reduces the number of subnetworks by identifying the redundant paths of two adjacent nodes and s-t unconnected paths. Experiments show that the OBDD Multicast both reduces the complexity of the WSN reliability analysis and has a lower running time than Xing's OBDD-(ordered binary decision diagram-) based algorithm.
Yan et al. REF proposed a symbolic ordered-binary-decision-diagram-multicast method to evaluate the reliability of multicast WSNs.
A Novel OBDD-Based Reliability Evaluation Algorithm for Wireless Sensor Networks on the Multicast Model
Mathematical Problems in Engineering
Computer Science