Algorithm 1 Design space exploration.
1: procedure Explore($PS,SN,DV$)
2:     $PS$: Power source model
3:     $SN$: Sensor node/network model
4:     $DV$: Sets of design variables ranges ($DV=\left\{{\{{\overline{I}}_{chg},{\overline{V}}_{chg},\overline{E},{\overline{t}}_{chg},\overline{T}\}}_i\right\},\forall i\in$
$[0,k-1]$,   ${\overline{I}}_{chg}=[min\left(I_{chg}\right),max\left(I_{chg}\right)],{\overline{V}}_{chg}=[min\left(V_{chg}\right),max\left(V_{chg}\right)],\overline{E}=$
$[min\left(E\right),max\left(E\right)],$   ${\overline{t}}_{chg}=[min\left(t_{chg}\right),max\left(t_{chg}\right)],\overline{T}=[min\left(T\right),max\left(T\right)]$)
5:     /* Outer Loop Start */
6:     $\mathcal{TC}\leftarrow \varnothing$;	▹ Empty Tradeoff Curve
7:     $iLS\leftarrow 0$;	▹ Init local search index
8:     $k=sizeof\left(DV\right)$;	▹ Number of local search subsets
9:     repeat
10:         $LS\leftarrow D{V}_{iLS}$;	▹ Get design space subset
11:         /* Inner Loop Start */
12:         $Pop\leftarrow$ initPopulation($PS,SN,LS$);	▹ Initialize first population
13:         $Ge{n}_i\leftarrow 0$;	▹ Generation index to zero
14:         repeat
15:            for all $\mathcal{X}\in Pop$do	▹ Evaluate population
16:                Simulate($PS,SN,\mathcal{X}$);	▹ Call Simulink using the proposed
	▹ individual implementation
17:                Evaluate($Fitnes{s}_1\left(\mathcal{X}\right),Fitnes{s}_2\left(\mathcal{X}\right)$);	▹ Compute Equations (12) and (13)
18:            end for
19:            Sort(non-dominated, $Pop$);	▹ Categorize proposals
20:            Tournament($Pop$);	▹ Select parents
21:            CrossAndMut($Pop$);	▹ Obtain new offspring
22:            $Ge{n}_i\leftarrow Ge{n}_i+1$;	▹ Increase generation
23:         until $(Ge{n}_i==Gen{s}_{max})$	▹ Check last generation
24:         /* Inner Loop End */
25:         ${\mathcal{LTC}}_{iLS}\leftarrow$ ExtractLocalTradeoffCurve(Pop);	▹ Save optimal design points
26:         $\mathcal{TC}$ = $\mathcal{TC}\bigcup {\mathcal{LTC}}_{iLS}$;
27:         /* Propose next local search */
28:         $iLS\leftarrow iLS+1$;	▹ Next, search space subset
29:     until ($iLS$ == k)	▹ Check next outer iteration
30:     /* Outer Loop End */
31:     SaveAndPlot($\mathcal{TC},FoM,D$);	▹ Present Pareto front curve
	▹ using Equations (14) and (15)
32: end procedure