Efficient Aggregation Scheduling in Multihop Wireless Sensor Networks
We study delay efficient data aggregation scheduling in wireless sensor networks. We construct a routing tree and propose four scheduling algorithms that can generate collision-free link schedules for data aggregation. We compare that the delay of each algorithm, where R and Del are respectively the graph radius and the maximum node degree in a reduced communication graph of the original network; the proposed algorithms are asymptotically optimum on delay in random wireless sensor networks. We evaluate the performances of the proposed algorithms and the simulation results.