Routing Algorithm for Delay Tolerance in Wireless Sensor Networks
DOI:
https://doi.org/10.3991/ijoe.v12i11.6225Keywords:
MG-LEACH, network lifetime, delay tolerant, wireless sensor networksAbstract
In a regular sensor node, there are three activities that are the core sources of energy consumption i.e. sensing, computation, and radio operations. Multi-Group, a novel routing algorithm based on LEACH (MG-LEACH) that has been utilized in redundant deployed sensor nodes to improve the network lifetime is explored. It has been suppressing the correlated data gathered by the sensor nodes by monitoring the similar event, thus not only reducing the data transmission inside the clusters but also conserving the energy of deployed sensor nodes consequently to improve the overall network lifetime. The proposed routing algorithm has been simulated using MATLAB to verify the efficiency in enhancing network lifetime. A critical evaluation of routing algorithm is conducted to determine the relevance and applicability in increasing network lifetime. Simulation results demonstrated that it has performed better than LEACH and enhanced network lifetime by up to approximately 90%.
Downloads
Published
How to Cite
Issue
Section
License
The submitting author warrants that the submission is original and that she/he is the author of the submission together with the named co-authors; to the extend the submission incorporates text passages, figures, data or other material from the work of others, the submitting author has obtained any necessary permission.
Articles in this journal are published under the Creative Commons Attribution Licence (CC-BY What does this mean?). This is to get more legal certainty about what readers can do with published articles, and thus a wider dissemination and archiving, which in turn makes publishing with this journal more valuable for you, the authors.
By submitting an article the author grants to this journal the non-exclusive right to publish it. The author retains the copyright and the publishing rights for his article without any restrictions.