The Community for Technology Leaders
RSS Icon
Issue No.04 - April (2012 vol.11)
pp: 591-602
Nachiket V. Kale , University of Illinois at Urbana-Champaign, Urbana
Srinivasa M. Salapaka , University of Illinois at Urbana-Champaign, Urbana
This paper presents a framework that develops algorithms for solving combined locational and multihop routing optimization problems. The objective is to determine resource node locations in a multiagent network and to specify the multihop routes from each agent to a common destination through a network of resource nodes that minimize total communication cost. These problems are computationally complex (NP-hard) where the cost functions are riddled with multiple minima. Algorithms based on Maximum Entropy Principle, which guarantee local minima and are heuristically designed to seek the global minimum are presented. These algorithms accommodate practical constraints on resource nodes as well as on the routing network architectures. Simulation results show that the multihop routes and resource locations allocated by these algorithms achieve lower costs (as low as 47 percent) than those algorithms where resource locational optimization is done without multihop routing or where the locational and routing optimization objectives are separated. The enabling feature of these algorithms is accommodating problems with resource constraints which is demonstrated through simulations.
Networks, optimization methods, resource management, routing.
Nachiket V. Kale, Srinivasa M. Salapaka, "Maximum Entropy Principle-Based Algorithm for Simultaneous Resource Location and Multihop Routing in Multiagent Networks", IEEE Transactions on Mobile Computing, vol.11, no. 4, pp. 591-602, April 2012, doi:10.1109/TMC.2011.93
[1] P. Sharma, S. Salapaka, and C. Beck, “A Maximum Entropy Based Scalable Algorithm for Resource Allocation Problems,” Proc. Am. Control Conf., pp. 516-521, 2007.
[2] P. Sharma, S. Salapaka, and C. Beck, “A Scalable Deterministic Annealing Algorithm for Resource Allocation Problems,” Proc. Am. Control Conf., pp. 3092-3097, 2006.
[3] P. Sharma, S. Salapaka, and C. Beck, “A Scalable Approach to Combinatorial Library Design for Drug Discovery,” J. Chemical Information and Modeling, vol. 48, no. 1, pp. 27-41, 2008.
[4] J. Cortés, S. Martínez, T. Karatas, and F. Bullo, “Coverage Control for Mobile Sensing Networks: Variations on a Theme,” Proc. Mediterranean Conf. Control and Automation, July 2002.
[5] S. Salapaka and A. Khalak, “Locational Optimization Problems with Constraints on Resources,” Proc. 41st Allerton Conf., pp. 1240-1249, Oct. 2003.
[6] S. Salapaka and A. Khalak, “Constraints on Locational Optimization Problems,” Proc. IEEE Control and Decision Conf., pp. 1741-1746, Dec. 2003.
[7] K. Rose, “Deterministic Annealing for Clustering, Compression, Classification, Regression and Related Optimization Problems,” Proc. IEEE, vol. 86, no. 11, pp. 2210-39, Nov. 1998.
[8] Z. Drezner, Facility Location: A Survey of Applications and Methods. Springer Verlag, 1995.
[9] S. Lloyd, “Least Squares Quantization in PCM,” IEEE Trans. Information Theory, vol. 28, no. 2, pp. 129-137, Mar. 1982.
[10] A. Gersho and R. Gray, Vector Quantization and Signal Compression, first ed. Kluwer, 1991.
[11] S. Kirkpatrick, C. Gelatt, and M. Vechhi, “Optimization by Simulated Annealing,” Science, vol. 220, pp. 671-680, 1983.
[12] J.N. Al-Karaki and A.E. Kamal, “Routing Techniques in Wireless Sensor Networks: A Survey,” IEEE Wireless Comm., vol. 11, no. 6, pp. 6-27, Dec. 2004.
[13] F. Kuhn, R. Wattenhofer, and A. Zollinger, “An Algorithmic Approach to Geographic Routing in Ad Hoc and Sensor Networks,” IEEE/ACM Trans. Networking, vol. 16, no. 1, pp. 51-62, Feb. 2008.
[14] T. Moscibroda, M. Wattenhofer, R. O'Dell, and R. Wattenhofer, “Virtual Coordinates for Ad Hoc and Sensor Networks,” Proc. Joint Workshop Foundations of Mobile Computing (DIALM-POMC '04), pp. 8-16, 2004.
[15] N.S. Kulkarnit, B. Ramantt, and I. Gupta, “On Demand Routing Protocols for Mobile Ad Hoc Networks: A Review,” Proc. IEEE Int'l Advance Computing Conf. (IACC '09), pp. 586-591, 2009.
[16] C. Liu and J. Wu, “Efficient Adaptive Routing in Delay Tolerant Networks,” Proc. IEEE Int'l Conf. Comm., 2009.
[17] S. Geman and D. Geman, “Stochastic Relaxation, Gibbs Distribution, and the Bayesian Restoration of Images,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 6, no. 6, pp. 721-741, Nov. 1984.
[18] M. Mahajan, P. Nimbhorkar, and K. Varadarajan, “The Planar k-Means Problem Is np-Hard,” Proc. the Third Int'l Workshop Algorithms and Computation (WALCOM '09), pp. 274-285, 2009.
[19] D. Aloise, A. Deshpande, P. Hansen, and P. Popat, “NP-Hardness of Euclidean Sum-of-Squares Clustering,” Machine Learning, vol. 75, no. 2, pp. 245-248, 2009.
[20] P. Drineas, A. Friexe, R. Kannan, S. Vempala, and V. Vinay, “Clustering Large Graphs via the Singular Value Decomposition,” Machine Learning, vol. 56, pp. 9-33, 2004.
[21] E.T. Jaynes, “Information Theory and Statistical Mechanics,” Physical Rev., vol. 106, pp. 620-630, 1957.
[22] E.T. Jaynes, Probability Theory—The Logic of Science. Cambridge Univ., 2003.
[23] C.E. Shannon and W. Weaver, The Mathematical Theory of Communication. Univ. of Illi nois, 1949.
[24] L.D. Landau and E.M. Lifshitz, Statistical Physics, Part 1, third ed., vol. 3. Oxford, 1980.
18 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool