Multiobjective Optimization for a Wireless Ad Hoc Sensor Distribution on Shaped-Bounded Areas

<div>Shortest distance from initial (<svg height="8.8423pt" id="M261" style="vertical-align:-0.2064009pt" version="1.1" viewbox="-0.0498162 -8.6359 3.66193 8.8423" width="3.66193pt" 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="M244 607C244 633 228 655 200 655C166 655 146 618 146 594C146 564 166 546 191 546C221 546 244 574 244 607ZM222 91L209 114C184 94 148 66 133 66C127 66 124 73 130 96L201 370C213 416 211 448 191 448C162 448 88 407 29 352L42 328C73 354 104 371 114 371C120 371 119 365 115 345L53 92C32 5 45 -12 68 -12C103 -12 186 50 222 91Z" id="g113-106"></path></g></svg>) to final (<svg height="6.1673pt" id="M262" style="vertical-align:-0.2063904pt" version="1.1" viewbox="-0.0498162 -5.96091 5.50181 6.1673" width="5.50181pt" 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="M391 364C391 409 353 448 295 448C249 448 198 426 152 393C65 331 23 225 23 139C23 14 96 -12 146 -12C198 -12 280 9 367 101L351 124C300 78 242 48 194 48C129 48 109 107 109 162V191C208 213 391 266 391 364ZM313 350C313 305 268 261 113 223C132 334 187 381 217 398C227 404 244 405 261 405C290 405 313 385 313 350Z" id="g113-102"></path></g></svg>) node positions generated by the Hungarian algorithm.</div>

Mathematical Problems in Engineering

fig7

Figure 7

Figure 7: Multiobjective Optimization for a Wireless Ad Hoc Sensor Distribution on Shaped-Bounded Areas 