The Community for Technology Leaders
Green Image
ABSTRACT
<p><b>Abstract</b>—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.</p>
INDEX TERMS
Genetic algorithms, mobile agents, distributed sensor networks.
CITATION
Jacob Barhen, Hairong Qi, Krishnendu Chakrabarty, Nageswara S.V. Rao, S. Sitharama Iyengar, Qishi Wu, Vijay K. Vaishnavi, "On Computing Mobile Agent Routes for Data Fusion in Distributed Sensor Networks", IEEE Transactions on Knowledge & Data Engineering, vol. 16, no. , pp. 740-753, June 2004, doi:10.1109/TKDE.2004.12
108 ms
(Ver )