The heuristic scheduling algorithm 136 is able to cure several deficiencies in prior art scheduling schemes, some of which will now be described. A batch-size scheduling scheme that employs random selection can be used to schedule OTA file distribution of the files 134. A batch-size scheduling scheme that employs random selection divides the total amount of connected cars into “N” batches evenly and randomly. At a specified time (such as midnight), an OTA update notification is pushed to each connected car in the current batch per day so that users can start downloading the OTA update once the car is put into an “ON” operational state and the users provide their consent. A batch-size scheduling scheme that employs random selection is simple to apply, however, OTA downloads will centralize during a busy time. For example, users who drive their connected cars 106 on the same highway in the morning to their workplaces and would start OTA downloads simultaneously. Without any driving pattern specified scheduling, this scheduling scheme has no control over the number of OTA users in a given cell and the number of OTA users in that cell's neighboring cell(s). Moreover, when a cell has one or more OTA users, the throughput provided by that cell will be downgraded for other users connected on the same cell (i.e., bandwidth sharing), and meanwhile this cell's physical resource block (“PRB”) traffic loading will be increased significantly and lead to poor SINR for its neighbor cell(s). Consequently, the neighbor cell(s) also will be downgraded. In summary, a batch-size scheduling scheme that employs random selection will reduce overall network performance as the number of simultaneous OTA downloads increases.