Speeding Up Exact Algorithms for Maximizing Lifetime of WSNs Using Multiple Cores

<div>A directed network graph and three subproblems by fixing the parent node of vertex <span class="nowrap"><svg height="8.68572pt" id="M184" style="vertical-align:-0.0498209pt" version="1.1" viewbox="-0.0498162 -8.6359 9.2729 8.68572" width="9.2729pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M686 28C612 35 607 44 591 112C563 234 541 360 519 489L489 666L457 658L147 121C100 40 89 36 24 28L17 0H240L250 28C168 34 159 41 190 101L262 237H482C495 180 503 137 510 91C517 47 514 35 441 28L433 0H677L686 28ZM475 280H285L429 541H431L475 280Z" id="g113-66"></path></g></svg>.</span></div>

Wireless Communications and Mobile Computing

fig5

Figure 5

Figure 5: Speeding Up Exact Algorithms for Maximizing Lifetime of WSNs Using Multiple Cores 