Formal Probabilistic Analysis of a WSN-Based Monitoring Framework for IoT Applications

Elleuch, Mouna; Hasan, Osman; Tahar, Sofiène; Abid, Mohamed

doi:10.1007/978-3-319-53946-1_6

Cited by 5 publications

(5 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The following mathematical expression for the intrusion coverage intensity of a given object; V o , has been formally verified in Theorem 9, similarly as in (Elleuch et al, 2016a). • The predicate intrcov_intsty_pt defines the coverage behavior a specific intrusion object, as in Equation (16).…”

Section: The Intrusion Coveragementioning

confidence: 95%

“…In the previous work when abstracting an object to a point (Elleuch et al, 2011(Elleuch et al, , 2015(Elleuch et al, , 2016a, it has been possible to consider the probability of covering a point as a simple constant value q. Giving the assumptions of size and shape of the intrusion, additional parameters should be involved.…”

Section: The Intrusion Coveragementioning

confidence: 99%

“…In particular, we are interested in the higher-order-logic formalizations of the lifetime maximization problem, given in , under QoS constraints. The earlier work of (Elleuch et al, 2011(Elleuch et al, , 2015(Elleuch et al, , 2016a described a formalization of the k-set randomized scheduling algorithm and its main performance properties based on the recent probability theory formalizations (Mhamdi et al, 2011) in the HOL theorem prover. We will build upon these theoretical developments to formally show that the optimal solution for the lifetime maximization problem exists.…”

mentioning

confidence: 99%

See 2 more Smart Citations

Formal probabilistic performance verification of randomly-scheduled wireless sensor networks

Elleuch

Hasan

Tahar

et al. 2018

IJCCBS

Self Cite

View full text Add to dashboard Cite

Energy efficiency in Wireless Sensor Networks (WSN) is one of the most critical issue regardless of the target application. While scheduling sensors by partitions to preserve energy is a simple and intuitive approach in this context, it is also important to not compromise on the main performance requirements of the considered application. For mission-critical WSN applications, different Quality of Service (QoS) requirements on network performance have to be met. Besides, various assumptions, may effectively impact the sensing performance capabilities of the network. Nevertheless, most analysis techniques focus on the average performance values, and do not consider neither the targeted QoS requirements, nor the probabilistic feature of the algorithm. Based on the theorem proving approach, we first provide, in this paper, an accurate formal analysis of the network lifetime maximization problem, under QoS constraints, for randomlyscheduled wireless sensor networks. After that, we tackle the higher-order-logic formalization of the intrusion coverage intensity, for a modified version of the randomized scheduling, with more realistic assumptions for the intrusion object, in a two or three dimensional plane.

show abstract

Section: The Intrusion Coveragementioning

confidence: 95%

Section: The Intrusion Coveragementioning

confidence: 99%

mentioning

confidence: 99%

See 1 more Smart Citation

Formal probabilistic performance verification of randomly-scheduled wireless sensor networks

Elleuch

Hasan

Tahar

et al. 2018

IJCCBS

Self Cite

View full text Add to dashboard Cite

show abstract

“…Garofalaki et al [24] developed an ADOxx-based modeling tool called SAPnet that enables security evaluation of Internet of Things (IoT) systems modeled as stochastic Petri nets by associating vulnerabilities to model states and quantifying security metrics for assessment during the design phase. Elleuch et al [4] present a formal analysis approach using higher-order logic theorem proving to check coverage properties and performance of wireless sensor networks. It employed randomize node scheduling, and apply it to an IoT-based environmental monitoring framework.…”

Section: Related Workmentioning

confidence: 99%

Towards Self-Optimization of Publish/Subscribe IoT Systems using Continuous Performance Monitoring

Mohammed,

Nabila

2024

Networks, Blockchain and Internet of Things

View full text Add to dashboard Cite

Today, more and more embedded devices are being connected through a network, generally Internet, offering users different services. This concept refers to Internet of Things (IoT), bringing information and control capabilities in many fields like medicine, smart homes, home security, etc. Main drawbacks of IoTenvironment are its dependency on Internet connectivity and need continuous devices power. These dependencies may affect system performances, namely request processing response times. In this context,we propose in this paper a continuous performance monitoring methodology, applied on IoT systems based on Publish/subscribe communication model. Our approach assesses performances using Stochastic Petri net modeling, and self-optimizes whenever poor performances are detected. Our approach relies on a Stochastic Petri nets modelling and analysis to assess performances. We target improving performances, in particular response times, by online modification of influencing factors.

show abstract

“…Next, the authors formalized the indicator random variables using HOL4 and used it for the expected time complexity analysis of various algorithms, i.e., the birthday paradox, the hat-check and the hiring problems [42]. Elleuch et al [30] used the probability theory of HOL4 to formally reason about the detection properties of Wireless Sensor Networks (WSNs) and a WSN-based monitoring framework [31]. Moreover, the authors conducted the performance analysis of WSNs [29].…”

Section: Formal Probabilistic and Performance Analysismentioning

confidence: 99%

Formal Verification of Cyber-Physical Systems Using Theorem Proving

Rashid

Siddique

Tahar

2020

Communications in Computer and Information Science

Self Cite

View full text Add to dashboard Cite

Due to major breakthroughs in software and engineering technologies, embedded systems are increasingly being utilized in areas ranging from aerospace and next-generation transportation systems, to smart grid and smart cities, to health care systems, and broadly speaking to what is known as Cyber-Physical Systems (CPS). A CPS is primarily composed of several electronic, communication and controller modules and some actuators and sensors. The mix of heterogeneous underlying smart technologies poses a number of technical challenges to the design and more severely to the verification of such complex infrastructure. In fact, a CPS shall adhere to strict safety, reliability, performance and security requirements, where one needs to capture both physical and random aspects of the various CPS modules and then analyze their interrelationship across interlinked continuous and discrete dynamics. Oftentimes however, system bugs remain uncaught during the analysis and in turn cause unwanted scenarios that may have serious consequences in safety-critical applications. In this paper, we introduce some of the challenges surrounding the design and verification of contemporary CPS with the advent of smart technologies. In particular, we survey recent developments in the use of theorem proving, a formal method, for the modeling, analysis and verification of CPS, and overview some real world CPS case studies from the automotive, avionics and healthtech domains from system level to physical components.

show abstract

Formal Probabilistic Analysis of a WSN-Based Monitoring Framework for IoT Applications

Cited by 5 publications

References 24 publications

Formal probabilistic performance verification of randomly-scheduled wireless sensor networks

Formal probabilistic performance verification of randomly-scheduled wireless sensor networks

Towards Self-Optimization of Publish/Subscribe IoT Systems using Continuous Performance Monitoring

Formal Verification of Cyber-Physical Systems Using Theorem Proving

Contact Info

Product

Resources

About