A New Algorithm For Searching All The D-MPs In Multi-State Network And Message Time Delay And Reliability In Multi-State Wireless Sensor Networks

The main research in this paper includes proposing the new algorithm to search all the d-MPs in multi-state networks and defining the message time delay and reliability in multi-state wireless sensor networks. Using the child nodes generation algorithm and the multi-state tree generation algorithm, we give out the multi-state tree algorithm. Furthermore, the definition of multi-state wireless sensor network is proposed, the multi-state node model is set up. Meanwhile this paper proposes the definitions of message time delay and reliability of multi-state wireless sensor networks by the definition of multi-state wireless sensor networks.1. d-MPs searching in multi-state networks:we can calculate the reliability of the multi-state network through the d-MPs with inclusion-exclusion principle. Actually, the multi-state networks considered in this paper are all networks in which arcs are multi-state, while the nodes are perfect without consideration. All the arcs'states is disperse, random, and integer observed a certain distribution. In this paper, we have proposed multi-state tree algorithm, which simplifies the process of searching all the d-MP by using the decreasing characteristic of the multi-state tree. Then we have calculated two typical examples to illustrate the efficiency of the proposed algorithm.2. Reliability and message time delay in multi-state wirelss sensor network:In this paper, the message time delay has been defined as the expected time needed to send one message from source node to target node successfully, denoted as D=∑i=1mE(Di); The reliability of the multi-state sensor network has been defined as the probability that one message can be sent from source node to target node successfully in the time periodδ, denoted as: Then we introduce an example to illustrate the definition.