Exploring Simulated Annealing and Graphical Models for Optimization in Cognitive Wireless Networks

In this paper we discuss the design of optimization algorithms for cognitive wireless networks (CWNs). Maximizing the perceived network performance towards applications by selecting appropriate protocols and carrying out cross-layer optimization on the resulting stack is a key functionality of any CWN. We take a "black box" approach to the problem and study the use of simulated annealing for solving it. To improve the convergence rate of the basic algorithm we apply machine learning techniques to construct graphical models on the perceived relations between network stack parameters and application-specific network utilities. We test our optimizer design both in a simulation environment as well as on a network testbed with low-power radios. Our results show that even basic simulated annealing works well, but simple graphical models can further increase the convergence rate. However, use of sophisticated models such as Bayesian networks does not always lead to substantially better performance. The results indicate that enhanced simulated annealing indeed appears to be a promising foundation for future cognitive engine designs.

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

[2]  Andreas Achtzehn,et al.  Towards User-centric Network Optimization Engine , 2009, 2009 6th IEEE Annual Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks Workshops.

[3]  Jean C. Walrand,et al.  Fair end-to-end window-based congestion control , 2000, TNET.

[4]  Christian Blum,et al.  Metaheuristics in combinatorial optimization: Overview and conceptual comparison , 2003, CSUR.

[5]  Eric V. Slud Graphical Models: Methods for Data Analysis and Mining , 2003, Technometrics.

[6]  Janne Riihijärvi,et al.  Hop-by-hop toward future mobile broadband IP , 2004, IEEE Communications Magazine.

[7]  V.R. Petty,et al.  KUAR: A Flexible Software-Defined Radio Development Platform , 2007, 2007 2nd IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks.

[8]  A. Robert Calderbank,et al.  Layering as Optimization Decomposition: A Mathematical Theory of Network Architectures , 2007, Proceedings of the IEEE.

[9]  Kevin Murphy,et al.  Bayes net toolbox for Matlab , 1999 .

[10]  David J. Goodman,et al.  Subjective quality of the same speech transmission conditions in seven different countries , 1982, ICASSP.

[11]  Peter Norvig,et al.  Artificial Intelligence: A Modern Approach , 1995 .

[12]  Zheng Wang,et al.  An Architecture for Differentiated Services , 1998, RFC.

[13]  David L. Black,et al.  An Architecture for Differentiated Service , 1998 .

[14]  S. Shenker Fundamental Design Issues for the Future Internet , 1995 .

[15]  John Strassner,et al.  From Autonomic Computing to Autonomic Networking: An Architectural Perspective , 2008, International Conference on Evaluation & Assessment in Software Engineering.

[16]  Jeffrey O. Kephart,et al.  The Vision of Autonomic Computing , 2003, Computer.

[17]  Petri Mähönen,et al.  Supporting resource allocation with vertical handoffs in multiple radio network environment , 2002, The 13th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications.

[18]  Dorothea Heiss-Czedik,et al.  An Introduction to Genetic Algorithms. , 1997, Artificial Life.