Heterogeneous networks raise the challenge on ubiquitous connections among heterogeneous devices and networking protocols. As a promising approach to meet this challenge, Information-centric networking (ICN) offers a new communication paradigm which can conceal the heterogeneity of underlying networks. However, it suffers from the problem of segmented cached chunks, which results in low throughput caused by high frequency of switching among different nodes holding chunk copies, and the large Interest packet overhead (IPO). Although the studies on in-network caching or Interest pipelining based on delay estimation help to improve ICN performance, they cannot address such problem and further improve ICN performance fundamentally, because of their insufficient considerations on the interplay between caching and transport protocols. We conduct the experiments and observe that 1) data chunks are cached in a distributed manner with ICN, and 2) range-based data retrieval can reduce switch-over frequency and IPO. Based on these observations, we propose the adaptive retrieval with consecutive caching (ARCC) scheme, which is composed of the consecutive data chunk caching (ConCaching) and adaptive data chunk retrieval (ACUR). ARCC bridges the gap between caching and transport, where intermediate nodes on transmission path only cache the consecutive data chunks with the size above a threshold, while users can adjust the range of requested data chunks to maximize the throughput. This way, at most a range of consecutive data chunks can be retrieved by one Interest , and users retrieve data from the small set of nodes with low switch-over frequency. The intensive simulations show that the proposed mechanisms can achieve the objectives of consecutive chunk caching, in terms of substantial reduction in IPO and switch-over frequency and higher throughput compared with the existing pipeline mechanism in ICN.