Early Prototyping of Wireless Sensor Network Algorithms in PVS
SAFECOMP '08 Proceedings of the 27th international conference on Computer Safety, Reliability, and Security
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
A novel QOS-based broadcasting scheme for wide area networks
Journal of Computational Methods in Sciences and Engineering - Special Supplement Issue in Section A and B: Selected Papers from the ISCA International Conference on Software Engineering and Data Engineering, 2009
| Hi-index | 0.00 |
The reverse path forwarding algorithm is a protocol fordistributing messages throughout networks. The intentionis to preserve correctness-messages sent will eventuallybe received by all nodes in the originator's connectedcomponent-whilst minimising the number of propagationsof each message.We use a variety of analysis techniques to identify necessaryadditional constraints, and to prove correctness underthese conditions. In particular we present counter examplesfound by the model-checkers FDR and the Alloy Analyzer,illustrating that the protocol is incorrect if the cost oflinks is dependent upon the node using that link. We thenconsider the case where the cost of links is independent ofthe node using that link; we use a special-purpose networksampling program to increase confidence in the correctnessof this stricter protocol, and then perform a hand-proof toverify correctness. We conclude with a discussion of thesuitability of these techniques for reasoning about protocolsof this complexity.