Heterogeneous Clustering for Secure, Energy-efficient and Fault tolerant Permutation Routing in Wireless Sensor Networks

In wireless sensor networks (WSNs), security and economy of energy are two important and necessary aspects to consider. Particularly, security helps to ensure that such a network is not subject to attacks that involve reading, modification or destruction of information. This paper presents a protocol for permutation routing, which is secure, fault tolerant and energy-efficient. The proposed protocol is based on two main principles. First, the use of a heterogeneous hierarchical clustered structure to assign the most important roles to the sensors having the most energy, in order to ensure the protection and routing of data items. Second, the use of multiple processes based on this structure to ensure, regardless of network and sensors status, no data is lost and that a data item from a point A to a point B always arrives safety. This is the first protocol that provides such a QoS per permutation routing.