With link correlation information (CPRP) available among neighboring nodes, collective ACKs are achieved in an accumulative manner. The success of a transmis- sion to a node (defined as the coverage probability of a node) is no longer a binary (0/1) estimation, but a prob- ability value between 0 and 1. Using collective ACKs, a sender updates the coverage probability values of neigh- boring receivers whenever (i) it transmits or (ii) over- hears a rebroadcast message. To improve efficiency, a transmission is considered necessary only when the cov- erage probability of a neighboring node has not reached a certain user-desired reliability threshold. In addition to collective ACKs, we propose a dynamic forwarding technique to.
