An Optimal CDS Construction Algorithm with Activity Scheduling in Ad Hoc Networks

<div>The energy efficient optimal CDS maintenance phase after <svg height="8.85534pt" id="M194" style="vertical-align:-0.04981041pt" version="1.1" viewbox="-0.0498162 -8.80553 17.05 8.85534" width="17.05pt" 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="M610 0V27L347 666L316 657L46 26V0H610ZM504 54H116L310 537L504 54Z" id="g50-133"></path><glyph.data ascent="3443" descent="-2856" horiz-adv-x="654" vert-adv-y="654"></glyph.data></g><g transform="matrix(.013,0,0,-0.013,8.496,0)"><path d="M655 676H628C608 656 600 650 571 650H156C118 650 114 651 102 676H77C63 615 45 548 24 485L60 486C81 531 97 562 114 580C134 603 148 611 252 611H308L217 127C201 41 196 38 105 32L98 0H384L393 32C300 38 288 41 304 127L393 611H466C553 611 571 604 582 580C592 559 597 530 595 485L630 489C636 548 645 624 655 676Z" id="g50-85"></path><glyph.data ascent="3443" descent="-2856" horiz-adv-x="673" vert-adv-y="673"></glyph.data></g></svg> time with new nodes 29 and 31. Moved-out node 17, drained-out node 5.</div>

The Scientific World Journal

fig6

Figure 6

Figure 6: An Optimal CDS Construction Algorithm with Activity Scheduling in Ad Hoc Networks 