As application requirements evolve, the software on sensor nodes needs to be updated, or patched to fix errors to all the nodes of the entire networks. Recently, coding-based reprogramming protocols are proposed to provide efficient code dissemination in environments with high packet loss rate. Methods in analyzing the performance of these protocols, however, need further study. This paper presents an analytical model for energy cost based on time of dissemination and network topology. In this model, page pipelining and communication range between nodes are taken into accounts. Results from extensive simulations of a representative coding-based reprogramming protocol called Rateless Deluge coincide with the performance predicted by this model (the average relative error of single-node energy consumption is about 0.23%), thus validating the approach. These analytical results show that network density, network size and the number of packets per page all have significant impact on energy cost of the whole network. Particularly, a decrease in density of the network harms the energy performance (the energy consumption and network density is synthesized to be quadratic function). The energy cost of reprogramming the network is linear with the size of network (for the N×N grid network, the average growth rate is 50% when n change from 3 to 10) while the energy consumption of single node increases (the average growth rate is 6.9%). The energy cost is inverse with the page size of code image (the average rate of reduce is 11.2%).