Paper Info
Title
Formal probabilistic performance verification of randomly-scheduled wireless sensor networks.
Abstract
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 maximisation problem, under QoS constraints, for randomly-scheduled wireless sensor networks. After that, we tackle the higher-order-log...
Year
DOI
Venue
2018
10.1504/IJCCBS.2018.096438
IJCCBS
Field
DocType
Volume
Intrusion,Efficient energy use,Scheduling (computing),Computer science,Automated theorem proving,Quality of service,Probabilistic logic,Wireless sensor network,Network performance,Distributed computing
Journal
8
Issue
Citations 
PageRank 
3/4
0
0.34
References 
Authors
0
4
Name
Order
Citations
PageRank
Maissa Elleuch1143.00
osman hasan212.07
Sofiène Tahar3915110.41
Abid Mohamed43919.08