Power-efficient scheduling technique for fault-tolerant data aggregation in WSN Online publication date: Thu, 08-Sep-2016
by John Jean Justus; Arumugam Chandrasekar
International Journal of Mobile Network Design and Innovation (IJMNDI), Vol. 6, No. 3, 2016
Abstract: Data aggregation is the most important process in WSN, but it consumes more time and energy. In order to overcome these issues, in this paper, a power-efficient scheduling technique is used where routing tree is initially constructed based on the breadth-first search (BFS) technique to choose the shortest path for transmission. After that, grid partitioning and colouring method is used to avoid any kind of interference during simultaneous transmission of aggregated data. In addition, to enhance the performance of the grid partitioning and colouring method, a scheduling algorithm based on potential increase in residual energy (SPR) can balance the energy consumption during data transmission. In this way, the proposed technique helps to maintain the energy consumption without any delay during data transmission.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mobile Network Design and Innovation (IJMNDI):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com