The sensing data of nodes is generally correlated in dense wireless sensor networks, and the active node selection problem aims at selecting a minimum number of nodes to provide required data services within error threshold so as to efficiently extend the network lifetime. In this paper, we firstly propose a new Cover Sets Balance (CSB) algorithm to choose a set of active nodes with the partially ordered tuple (data coverage range, residual energy). Then, we introduce a new Correlated Node Set Computing (CNSC) algorithm to find the correlated node set for a given node. Finally, we propose a High Residual Energy First (HREF) node selection algorithm to further reduce the number of active nodes. Extensive experiments demonstrate that HREF significantly reduces the number of active nodes, and CSB and HREF effectively increase the lifetime of wireless sensor networks compared with related works. ; National Science Foundation of China [61370210; 61103175] ; Fujian Provincial Natural Science Foundation of China [2011J01345; 2013J01232; 2013J01229] ; Development Foundation of Educational Committee of Fujian Province [2012JA12027] ; Ministerio de Ciencia e Innovacion [TEC2011-27516] ; Polytechnic University of Valencia [PAID-15-11] ; Cheng, H.; Su, Z.; Zhang, D.; Lloret, J.; Yu, Z. (2014). Energy-efficient node selection algorithms with correlation optimization in wireless sensor networks. International Journal of Distributed Sensor Networks. 2014:1-14. doi:10.1155/2014/576573. ; Senia ; 1 ; 14 ; 2014