This Article 
 Bibliographic References 
 Add to: 
On Computing Mobile Agent Routes for Data Fusion in Distributed Sensor Networks
June 2004 (vol. 16 no. 6)
pp. 740-753

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.

[1] A.K. Hyder, E. Shahbazian, and E. Waltz, Multisensor Fusion. Kluwer Academic, 2002.
[2] D.N. Jayasimha, S.S. Iyengar, and R.L. Kashyap, Information Integration and Synchronization in Distributed Sensor Networks IEEE Trans. Systems, Man, and Cybernetics, vol. 21, no. 5, pp. 1032-1043, Sept./Oct. 1991.
[3] Y.F. Zheng, Integration of Multiple Sensors into a Robotics System and Its Performance Evaluation IEEE Trans. Robotic Automation, vol. 5, pp. 658-669, Oct. 1989.
[4] R.C. Luo and M.G. Kay, Multisensor Integration and Fusion in Intelligent Systems IEEE Trans. Systems, Man, and Cybernetics, vol. 19, no. 5, pp. 901-931, Sept.-Oct. 1989.
[5] H. Qi, S.S. Iyengar, and K. Chakrabarty, Multi-Resolution Data Integration Using Mobile Agents in Distributed Sensor Networks IEEE Trans. Systems, Man, and Cybernetics Part C: Applications and Rev., vol. 31, no. 3, pp. 383-391, Aug. 2001.
[6] T. Sander and C. Tschudin, Protecting Mobile Agents against Malicious Hosts Mobile Agent and Security, G. Vigna, ed., pp. 44-60, Springer-Verlag, 1998.
[7] S. Berkovits, J.D. Guttman, and V. Swarup, Authentication for Mobile Agents Mobile Agents and Security, G. Vigna, ed., pp. 114-136, Springer-Verlag, 1998.
[8] C.G. Harrison and D.M. Chess, Mobile Agents: Are They a Good Idea? Technical Report RC 1987, IBM T.J. Watson Research Center, Mar. 1995,
[9] P. Dasgupta, N. Narasimhan, L.E. Moser, and P.M. Melliar-Smith, MagNET: Mobile Agents for Networked Electronic Trading IEEE Trans. Knowledge and Data Eng., vol. 11, no. 4, pp. 509-525, May/June 1999.
[10] K.N. Ross and R.D. Chaney, Mobile Agents in Adaptive Hierarchical Bayesian Networks for Global Awareness Proc. IEEE Int'l Conf. Systems, Man, and Cybernetics, pp. 2207-2212, 1998.
[11] S.S. Iyengar, D.N. Jayasimha, and D. Nadig, A Versatile Architecture for the Distributed Sensor Integration Problem IEEE Trans. Computers, vol. 43, no. 2, Feb. 1994.
[12] Revision A, WINS NG 2.0 User's Manual and API Specification, Sensoria Corp., 30 May 2002.
[13] T.S. Rappaport, Wireless Communications Principles and Practice, second ed. Prentice Hall PTR, 2002.
[14] N.S.V. Rao, Multisensor Fusion Under Unknown Distributions: Finite Sample Performance Guarantees Multisensor Fusion, A.K. Hyder, E. Shahbazian, and E. Waltz, eds., 2002.
[15] V. Swaminathan and K. Chakrabarty, Real-Time Task Scheduling for Energy-Aware Embedded Systems Proc. IEEE Real-Time Systems Symp. (Work-In-Progress Sessions), Nov. 2000.
[16] A. Barvinok et al. The Geometric Maximum Traveling Salesman Problem J. ACM, combined journal version of previous paper and Fekete's 1999 SODA paper on the maximum TSP, including a faster algorithm for arbitrary polyhedral metrics, submitted for publication in 2002.
[17] J.H. Holland, Adaptation in Nature and Artificial Systems. Univ. of Michigan Press, reprinted by MIT Press, 1992.
[18] D.A. Coley, An Introduction to Genetic Algorithms for Scientists and Engineers. World Scientific, 1999.
[19] D.E. Goldberg, Genetic Algorithms in Search, Optimization&Machine Learning. Addison-Wesley, 1989.
[20] D.B. Lange and M. Oshima, Seven Good Reasons for Mobile Agents Comm. ACM, vol. 42, no. 3, pp. 88-89, Mar. 1999.
[21] S. Papavassiliou, A. Puliafito, O. Tomarchio, and J. Ye, “Mobile Agent-Based Approach for Efficient Network Management and Resource Allocation: Framework and Applications,” IEEE J. Selected Areas in Comm., vol. 20, no. 4, pp. 858-872, May 2002.
[22] J. Sum, H. Shen, C.S. Leung, and G. Young, Analysis on a Mobile Agent-Based Algorithm for Network Routing and Management IEEE Trans. Parallel and Distributed Systems, vol. 14, no. 3, pp. 193-202, Mar. 2003.
[23] T. Umezawa, I. Satoh, and Y. Anzai, A Mobile Agent-Based Framework for Configurable Sensor Networks Proc. Fourth Int'l Workshop Mobile Agent for Telecomm. Applications, pp. 128-140, Oct. 2002.

Index Terms:
Genetic algorithms, mobile agents, distributed sensor networks.
Qishi Wu, Nageswara S.V. Rao, Jacob Barhen, S. Sitharama Iyengar, Vijay K. Vaishnavi, Hairong Qi, Krishnendu Chakrabarty, "On Computing Mobile Agent Routes for Data Fusion in Distributed Sensor Networks," IEEE Transactions on Knowledge and Data Engineering, vol. 16, no. 6, pp. 740-753, June 2004, doi:10.1109/TKDE.2004.12
Usage of this product signifies your acceptance of the Terms of Use.