Improving Success of Sending From Two Mutually Hidden 802.15.4 Nodes

This paper presents an interesting result obtained for IEEE 802.15.4 nonbeacon-enabled wireless personal area networks. We consider a network in which two mutually hidden nodes send one data frame to the central node. By using the statistical model-checking capability of the PRISM model checker, we have analysed the probability that the central node successfully receives the data frame of both nodes. For larger data frame sizes, this probability is equal to zero. We show that an additional node within the range of both mutually hidden nodes which transmits one data frame like the latter considerably improves this probability both in the case of using the medium access control protocol with acknowledgements and without them.