High-Speed Pool of Aggregated Data in Multi-hop Wireless Network.

Data aggregation is a key functionality in wireless sensor networks (WSNs). Focuses on data aggregation scheduling problem to minimize the delay (or latency). The project proposes an efficient distributed algorithm that produces a collision-free schedule for data aggregation in WSNs. The project proves that the delay of the aggregation schedule generated by the algorithm is at most 16R + ? -14 time slots. Here, R is the network radius and ? is the maximum node degree in the communication graph of the original network. The algorithm significantly improves the previously known best data aggregation algorithm with an upper bound of delay of 24D + 6?+ 16 time slots, where D is the network diameter (note that D can be as large as 2R). Extensive simulations are conducted to study the practical performances of the proposed data aggregation algorithm. The simulation results corroborate the theoretical results and show that the algorithms perform better in practice. The two converge cast mechanism named Aggregate converge cast and One-Shot Raw-Data converge cast algorithms are implemented. The minimum slot length is calculated and shown the edges in the tree that are communicated in the respective time slots.