Traveling Salesman Problem for Routing in the clustersand Estimated Time for Receiving Information to BS by Neuro-Fuzzy

In the proposed protocol of this article, In PERLDA1 sensors do not send their data directly to CH for aggregation; rather each sensor sends its data to the nearest neighbor sensor. Receives data and aggregates it with its data. Then it sends the new information to another neighbor sensor that is in line with CH. Therefore data aggregation in PERLDA does not perform only in one sensor, rather it local data aggregation network. PERLDA protocol saves a lot of energy by selecting the shortest route for data transmission by using traveling salesman problem. In PERLDA protocol for preventing in data interference, TDMA technique is used inside of each cluster. In fact, the combination of TDMA and travelling salesman problem is quite unique. The energy of each CH is checked by Neuro-Fuzzy network. The CH having the lowest energy is detected, and how long the CH can continue doing its job with the least amount of energy, is also estimated.

کلیدواژه ها:

GREEGY Algorithm in cluster ، Wireless sensor network ، local data aggregation ، Neuro-Fuzzy Network ، coordinator sensor ، Cluster head