Reconfiguration in Heterogeneous Mobile Wireless Sensor Networks

This paper investigates reconfiguration in large-scale mobile wireless sensor networks. Consider a Field of Interest (FoI) divided into sub-regions, each of which has a distinct set of sensing requirements. Consider a mobile network consisting of nodes with heterogeneous sensing capabilities distributed within the FoI. The paper addresses the problem of reconfiguring the network at minimal cost so as to satisfy all sensing requirements while maintaining connectivity. The paper shows that under certain conditions the problem may be decomposed into spatial and assignment sub-problems, and proceeds to state a geometrical solution to the former and a mathematical programming approach to the latter. The paper states the resulting linear and convex integer programs, then develop an optimal decentralized solution algorithm to the convex program.