Configuration of Sensor Networks by Energy Minimisation

Recent advances in wireless sensor networks have led to many new protocols specifically designed for sensor networks where energy awareness is an essential consideration. Attention has been mostly directed towards routing protocols. These protocols generally implement a view embracing a local energy reserve. This paper presents an algorithm for determining optimal paths connecting sensor nodes to the sink. These optimal paths contribute to minimizing intermediate hops and consider a global energy reserve. Most of these sensor networks will require application specific functionalities and performance requirements because of the wide range of their applications. Modelling sensor network behaviour before implementation and deployment is therefore crucial to programming efficiently the network application and to validating all its protocols. Existing works suffer from the problem of insufficient formal models for sensor network validations. Such models enable formal verification of all sensor network properties prior to deployment. This paper will also present a formal model representing sensor network behaviour.