Clustered and leveled disjoint multipath routing algorithm for wireless sensor networks

As the complexity of the wireless sensor networks increase, in routing protocols increase. Since energy efficiency is the primary criteria in performance of the network, any saving in energy is highly desirable. Sensor networks consists of nodes in which have limited computational power and are limited in energy resource. The transmission of data packets to the base station with the minimum possible energy and least possible delay are the goals of efficient routing algorithms. The data collected by each node is communicated through the network to the base station which processes it to gather information about the network or to detect an event in the environment. In this paper we propose a new routing scheme which exploits the redundancy and geometrical properties of the wireless network. The approach we take is to combine the ideas of directional flooding, leveling, clustering and disjoint multipath routing to achieve an optimal routing scheme in terms of average energy consumed and total number of transmitted packets. Processing and structuring of the network before the implementation of the directional flooding algorithm improves the performance considerably when compared to the implementation of directional flooding algorithm without any preprocessing. We carry out extensive experimentation and simulations to corroborate our claims.