A New Dijkstra Front-Back Algorithm for Data Routing-Scheduling via Efficient-Energy Area Coverage in wireless Sensor Network

Abstract

Sensor nodes suffer from a lot of constraints, such as the limited energy source, the short radius of communication, the low processing and storage power. These fuzzy constraints deplete the energy of the implemented sensor network, especially, in coverage and routing data in the large-scale zones. The main constraint in WSNs is the energy. To outcome this constraint, we have proposed a Data Routing-Scheduling via Efficient-Energy Area Coverage in wireless Sensor Network protocol (EE_AC_DR) based on our proposed Dijkstra Front-Back algorithm. In fact, our protocol uses Dijkstra algorithm with steps to pass the nodes in the superior Cluster, or return it to the lower Cluster to choose the designed node as Cluster-Heads for playing a multiple role; a role of Cluster-Head, a role of coverage in the entire cluster and a role of communication routing the information in the best and shortest path towards the base station. This protocol is divided into the following five (5) steps: 1) the construction of the Clusters; 2) the choice of the Clusters-Heads; 3) the choice of the best neighbors; 4) the construction of Head-Clusters-Head, and 5) the choice of best Cluster-Head neighbors. We demonstrate, using some large scale simulations, that this protocol enhances the performances of the network and allows taking the best choices regarding the use of only one node in each cluster to monitor and communicate data using the shortest path with minimal cost.