Utility-Based Joint Routing, Network Coding, and Power Control for Wireless Ad Hoc Networks

Algorithm 2

MIEUDF(𝑉,𝐷,𝑠,𝐴,𝑇).

(1)   for all 𝑣∈𝐷 do

(2)  IEU_𝑣 and 𝑠∼*𝑣 assigned by UNICAST(𝑉,𝑠,𝑣,𝐴).

(3) end for

(4) T with only root s

(5) 𝑈_all⟵0.

(6) while 𝐷≠∅ do

(7)  remove the maximum IEU destination 𝑢 from 𝐷.

(8)  𝑈_all←𝑈_all+IEU_𝑢.

(9)  insert the branch connecting 𝑢 to 𝑇.

(10)  determine 𝑝^∗_𝑡 and 𝑛^∗_𝑡 for each sender 𝑡 along the inserted

(11)  branch of 𝑇.

(12) for each node 𝑣∈𝐷 do

(13)   if 𝑠∼*𝑣 shares sub-path with the inserted branch then

(14)    increase IEU_𝑣by expected power cost along the

(15)    sharing sub-path.

(16)   end if

(17)  end for

(18) end while