Authors: John Jean Justus; Arumugam Chandrasekar
Addresses: Department of Computer Science and Engineering, St. Joseph's College of Engineering, Old Mamallapuram Road, Chennai 600119 Tamilnadu, India ' Department of Computer Science and Engineering, St. Joseph's College of Engineering, Old Mamallapuram Road, Chennai 600119 Tamilnadu, India
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.
Keywords: data aggregation; wireless sensor networks; WSNs; breadth-first search; BFS; grid partitioning; colouring; scheduling algorithms; fault tolerance; energy efficiency; residual energy; energy consumption.
International Journal of Mobile Network Design and Innovation, 2016 Vol.6 No.3, pp.164 - 173
Available online: 05 Sep 2016 *Full-text access for editors Access for subscribers Purchase this article Comment on this article