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

Algorithm 1

Unicast(𝑉,𝑠,𝑑,𝐴).

(1) for all 𝑣∈𝑉 do

(2)   REU𝑣←−∞.

(3)   assign benefit value to destination 𝑑∶REU_𝑑←𝐴.

(4) end for

(5) while 𝑠 ∉ 𝑉 do

(6)   Find node 𝑣∈𝑉 with the largest REU.

(7)   Remove node 𝑣 from 𝑉.

(8)   For each node 𝑢∈ 𝑉 RELAX(𝑣,𝑢).

(9) end while

(10) procedure Relax(𝑣, 𝑢)

(11)   Find the optimal 𝑝^∗_𝑢and 𝑛^∗_𝑢 to maximize 𝑅_𝑢,𝑣(𝑝_𝑢, 𝑛_𝑢)×

(12)   REU_𝑣-𝐶_𝑢(𝑝_𝑢,𝑛_𝑢).

(13)   if  REU_𝑢< 𝑅_𝑢,𝑣(𝑝^∗_𝑢, 𝑛^∗_𝑢)×REU_𝑣-𝐶_𝑢(𝑝^∗_𝑢,𝑛^∗_𝑢). then

(14)   Update REU_𝑢 with 𝑝^∗_𝑢 and 𝑛^∗_𝑢.

(15)  end if

(16) end procedure