Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
A compositional approach to performance modelling
A compositional approach to performance modelling
Theoretical Computer Science
Lifetime analysis of a sensor network with hybrid automata modelling
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
VESTA: A Statistical Model-checker and Analyzer for Probabilistic Systems
QEST '05 Proceedings of the Second International Conference on the Quantitative Evaluation of Systems
Exploiting mobility for energy efficient data collection in wireless sensor networks
Mobile Networks and Applications
Improving networks using group-based topologies
Computer Communications
Redesign of the LMST Wireless Sensor Protocol through Formal Modeling and Statistical Model Checking
FMOODS '08 Proceedings of the 10th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
Model-based validation of QoS properties of biomedical sensor networks
EMSOFT '08 Proceedings of the 8th ACM international conference on Embedded software
Energy conservation in wireless sensor networks: A survey
Ad Hoc Networks
Specifying and Verifying Sensor Networks: An Experiment of Formal Methods
ICFEM '08 Proceedings of the 10th International Conference on Formal Methods and Software Engineering
Theoretical Computer Science
Graphical Modelling for Simulation and Formal Analysis of Wireless Network Protocols
Methods, Models and Tools for Fault Tolerance
PRISM: probabilistic model checking for performance and reliability analysis
ACM SIGMETRICS Performance Evaluation Review
Overview of networking protocols for underwater wireless communications
IEEE Communications Magazine
PMaude: Rewrite-based Specification Language for Probabilistic Object Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Quantitative Analysis With the Probabilistic Model Checker PRISM
Electronic Notes in Theoretical Computer Science (ENTCS)
Modelling and verification of the LMAC protocol for wireless sensor networks
IFM'07 Proceedings of the 6th international conference on Integrated formal methods
All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic
PVESTA: a parallel statistical model checking and quantitative analysis tool
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Probabilistic linda-based coordination languages
FMCO'04 Proceedings of the Third international conference on Formal Methods for Components and Objects
Statistical abstraction and model-checking of large heterogeneous systems
International Journal on Software Tools for Technology Transfer (STTT)
Grouping nodes in wireless sensor networks using coalitional game theory
FMOODS'10/FORTE'10 Proceedings of the 12th IFIP WG 6.1 international conference and 30th IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
Hi-index | 0.00 |
Wireless sensor networks (WSNs) consist of resource-constrained nodes; especially with respect to power. In most cases, the replacement of a dead node is difficult and costly. It is therefore crucial to minimize the total energy consumption of the network. Since the major consumer of power in WSNs is the data transmission process, we consider nodes which cooperate for data transmission in terms of groups. A group has a leader which collects data from the members and communicates with the outside of the group. We propose and formalize a model for data collection in which mobile entities, called data MULEs, are used to move between group leaders and collect data messages using short-range and low-power data transmission. We combine declarative and operational modeling. The declarative model abstractly captures behavior without committing to specific transitions by means of probability distributions, whereas the operational model is given as a concrete transition system in rewriting logic. The probabilistic, declarative model is not used to select transition rules, but to stochastically capture the result of applying rules. Technically, we use probabilistic rewriting logic and embed our models into PMaude, which gives us a simulation engine for the combined models. We perform statistical quantitative analysis based on repeated discrete-event simulations in Maude.