Zeydan, EnginKivanc, DidemComaniciu, CristinaTureli, UfukMekatronik / Mechatronics2024-05-252024-05-252012351570-87051570-871310.1016/j.adhoc.2011.12.0092-s2.0-84859745561https://doi.org/10.1016/j.adhoc.2011.12.009https://hdl.handle.net/20.500.14517/817Tureli, Ufuk/0000-0002-4986-5270; Tureli, Didem/0000-0001-6835-2940; Zeydan, Engin/0000-0003-3329-0588In this paper, we investigate the reduction in the total energy consumption of wireless sensor networks using multi-hop data aggregation by constructing energy-efficient data aggregation trees. We propose an adaptive and distributed routing algorithm for correlated data gathering and exploit the data correlation between nodes using a game theoretic framework. Routes are chosen to minimize the total energy expended by the network using best response dynamics to local data. The cost function that is used for the proposed routing algorithm takes into account energy, interference and in-network data aggregation. The iterative algorithm is shown to converge in a finite number of steps. Simulations results show that multi-hop data aggregation can significantly reduce the total energy consumption in the network. (C) 2011 Elsevier B.V. All rights reserved.eninfo:eu-repo/semantics/closedAccessData aggregationEnergy-efficiencyRouting treesWireless sensor networksNash equilibriumArticleQ2Q1106962975WOS:000304218500007