Dependability Analysis of Diffusion Protocols in Wireless Networks with Heterogeneous Node Capabilities

Abstract

Wireless networks are starting to be populated by interconnected devices that reveal remarkable hardware and software differences. This fact raises a number of questions on the applicability of available results on dependability-related aspects of communication protocols, since they were obtained for wireless networks with homogeneous nodes. In this work, we study the impact of heterogeneous communication and computation capabilities of nodes on dependability aspects of diffusion protocols for wireless networks. We build a detailed stochastic model of the logic layers of the communication stack with the SAN formalism. The model takes into account relevant real-world aspects of wireless communication, such as transitional regions and capture effect, and heterogeneous node capabilities. Dependability-related metrics are evaluated with analytical solutions techniques for small networks, while simulation is employed in the case of large networks.

Towards Automated Dependability Analysis of Dynamically Connected Systems

“…Consumers and merchants use different channels, and we consider an exponential relation between the omission probability and the number of devices that use the channel. Taking into account recent works that analyse failure probability in heterogeneous scenarios, e.g., [18], we assume that the omission probability for consumers results in the interval …”

Dependability Analysis and Verification for Connected Systems

“…In this section, we assess coverage in the case of omission failure of the multicast search received by the merchants (M[i].mSearch) and omission failure of the responses sent by the merchants (M[i].resp). Figure 7(b) shows the coverage profiles for different probability P rxResp of failures of resp; in the figure, the probability of failure of M[i].mSearch depends on the timeout value and is derived from the analysis results reported in [17]; e.g., for T 1 = 10, the probability of failure of M[i].mSearch is 0.87.…”