Maximum Entropy Principle-Based Algorithm for Simultaneous Resource Location and Multihop Routing in Multiagent Networks

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.

[1]  E. M. Lifshitz,et al.  Statistical physics. Pt.1 , 1969 .

[2]  Jie Wu,et al.  Efficient Adaptive Routing in Delay Tolerant Networks , 2009, 2009 IEEE International Conference on Communications.

[3]  L. Landau,et al.  statistical-physics-part-1 , 1958 .

[4]  Balasubramanian Raman,et al.  On Demand Routing Protocols for Mobile Ad Hoc Networks: A Review , 2009, 2009 IEEE International Advance Computing Conference.

[5]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[6]  A. Volgenant,et al.  Facility location: a survey of applications and methods , 1996 .

[7]  P. Sharma,et al.  A scalable deterministic annealing algorithm for resource allocation problems , 2006, 2006 American Control Conference.

[8]  Roger Wattenhofer,et al.  An algorithmic approach to geographic routing in ad hoc and sensor networks , 2008, TNET.

[9]  Donald Geman,et al.  Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images , 1984 .

[10]  S. P. Lloyd,et al.  Least squares quantization in PCM , 1982, IEEE Trans. Inf. Theory.

[11]  K. Rose.  Deterministic annealing for clustering, compression, classification, regression, and related optimization problems , 1998, Proc. IEEE.

[12]  Puneet Sharma,et al.  A Scalable Approach to Combinatorial Library Design for Drug Discovery , 2008, J. Chem. Inf. Model..

[13]  R. Stephenson.  A and V , 1962, The British journal of ophthalmology.

[14]  Roger Wattenhofer,et al.  Convergence to Equilibrium in Local Interaction Games , 2008, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[15]  Pierre Hansen,et al.  NP-hardness of Euclidean sum-of-squares clustering , 2008, Machine Learning.

[16]  M. A. Dahleh,et al.  Constraints on locational optimization problems , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[17]  R. Baierlein.  Probability Theory: The Logic of Science , 2004 .

[18]  Alan M. Frieze,et al.  Clustering Large Graphs via the Singular Value Decomposition , 2004, Machine Learning.

[19]  Donald Geman,et al.  Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[20]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[21]  P. Sharma,et al.  A Maximum Entropy Based Scalable Algorithm for Resource Allocation Problems , 2007, 2007 American Control Conference.

[22]  Kevin Barraclough,et al.  I and i , 2001, BMJ : British Medical Journal.

[23]  Allen Gersho,et al.  Vector quantization and signal compression , 1991, The Kluwer international series in engineering and computer science.

[24]  E. Jaynes.  Information Theory and Statistical Mechanics , 1957 .

[25]  JAMAL N. AL-KARAKI,et al.  Routing techniques in wireless sensor networks: a survey , 2004, IEEE Wireless Communications.

[26]  Francesco Bullo,et al.  COVERAGE CONTROL FOR MOBILE SENSING NETWORKS: VARIATIONS ON A THEME , 2002 .

[27]  Meena Mahajan,et al.  The Planar k-means Problem is NP-hard I , 2009 .