Directed diffusion: a scalable and robust communication paradigm for sensor networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
On the accuracy of MANET simulators
Proceedings of the second ACM international workshop on Principles of mobile computing
Simulation of large ad hoc networks
MSWIM '03 Proceedings of the 6th ACM international workshop on Modeling analysis and simulation of wireless and mobile systems
Matching data dissemination algorithms to application requirements
Proceedings of the 1st international conference on Embedded networked sensor systems
Early Prototyping of Wireless Sensor Network Algorithms in PVS
SAFECOMP '08 Proceedings of the 27th international conference on Computer Safety, Reliability, and Security
Theoretical Computer Science
Analysis of Wireless Sensor Network Protocols in Dynamic Scenarios
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Formal modeling and analysis of the OGDC wireless sensor network algorithm in real-time maude
FMOODS'07 Proceedings of the 9th IFIP WG 6.1 international conference on Formal methods for open object-based distributed systems
Formal modeling and analysis of wireless sensor network algorithms in real-time maude
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
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 |
Discovering a routing tree for gathering or disseminating streams of data is an important operation in many sensor network applications. However, protocols for tree discovery may have significant performance problems for certain configurations of a network and its application task.A Temporal Logic of Actions (TLA) specification of push and pull diffusion is introduced in order to analyse such problems. This specification can be used as a basis for implementation, for visualising protocol behaviours, for simulation experiments, and for formal verification of properties of the protocol.This short paper shows how such a specification is used to understand variations in the routing trees discovered by push and pull diffusion and the effect of their shape and size on protocol performance.