On computing mobile agent routes for data fusion in distributed sensor networks

Qiangqiang Wu, Nageswara S. V. Rao, J. Barhen, S.S. Iyenger, Vijay K. Vaishnavi, Hairong Qi, Krishnendu Chakrabarty

IEEE Transactions on Knowledge and Data Engineering · 2004 · 259 citations · 19 references

Concepts

TL;DR

The problem of computing a route for a mobile agent that incrementally fuses data in a distributed sensor network is considered, and the node visit order significantly affects fused data quality and cost, impacting objectives such as target classification or tracking. The study formulates the route computation as maximizing an objective function proportional to received signal strength and inversely proportional to path loss and energy consumption using a simplified analytical model. The authors prove the problem NP‑complete and propose a genetic algorithm with a two‑level encoding scheme and tailored operators to approximate the optimal route. Simulations on varied network sizes and sensor distributions show the algorithm outperforms local and global closest‑first heuristics.

Abstract

The problem of computing a route for a mobile agent that incrementally fuses the data as it visits the nodes in a distributed sensor network is considered. The order of nodes visited along the route has a significant impact on the quality and cost of fused data, which, in turn, impacts the main objective of the sensor network, such as target classification or tracking. We present a simplified analytical model for a distributed sensor network and formulate the route computation problem in terms of maximizing an objective function, which is directly proportional to the received signal strength and inversely proportional to the path loss and energy consumption. We show this problem to be NP-complete and propose a genetic algorithm to compute an approximate solution by suitably employing a two-level encoding scheme and genetic operators tailored to the objective function. We present simulation results for networks with different node sizes and sensor distributions, which demonstrate the superior performance of our algorithm over two existing heuristics, namely, local closest first and global closest first methods.

References

19