AbsIrmt-Sensor nodes have limited sensing range and are not very reliable. To obtain accurate sensing data, many sensor nodes should be deployed and then the collaboratiw among them becomes an important issue. In 111, a tree-based approach bas been proposed to facilitate sensor nodes collaborating in detecting and tracking a mobile target. As the target moves, many nodes in the tree may bemme faraway from the root of the tree, and hence a large amount of energy may be wasted for them to send tbeir sensing data to (he root. In this paper, we address the tree reconfiguration problem. We formalize it as linding a mineost convoy tree sequence, and solve it by proposing an optimized complete reeonfiguration scheme and an optimized interception-based reconfiguration scheme. Analysir, and simulation are conducted to compare the proposed schemes with each other and with other reconfiguration schemes. The results show that the proposed schemes are more.energy efficient than others.
In REF the tree reconfiguration problem is formalized as finding a min-cost tree sequence.
Optimizing tree reconfiguration for mobile target tracking in sensor networks
IEEE INFOCOM 2004
IEEE INFOCOM 2004
Computer Science