Alan Kaminsky Department of Computer Science Rochester Institute of Technology 4486 + 2220 = 6706
Home Page
Advanced Computer Networks 4005-741-01 Fall Quarter 2009
Course Page

4005-741-01 Advanced Computer Networks
Module 4. Combinatorial Optimization
Lecture Notes

Prof. Alan Kaminsky -- Fall Quarter 2009
Rochester Institute of Technology -- Department of Computer Science


Combinatorial Optimization


Reactive Tabu Search


Example: Sensor Network Cluster Heads

A sensor network is located in a square area of D×D meters. The area is divided into NX×NY subareas. A sensor node is located at a random position in each subarea. There is a base station at the center of the area. The nodes are to be arranged into a two-level tree topology, as follows. Certain nodes are designated as cluster heads. There is a link from each leaf node (non-cluster-head node) to the closest cluster head node. There is a link from each cluster head node to the base station.

Question: Which nodes should be cluster head nodes, so as to minimize the total transmitter power in the sensor network?

Each node's transmitter power is determined by the length of the longest link attached to that node. So we will modify the question: Which nodes should be cluster head nodes, so as to minimize the sum of the lengths of the longest links attached to each node?

The program below conducts a reactive tabu search to solve this combinatorial optimization problem. Class ClusterHeads represents a configuration, stating which nodes are cluster heads and which are not. Class SensorNet01 is the main program. Whenever the search finds a new best solution, the program both prints the solution and displays a plot of the solution.

Advanced Computer Networks 4005-741-01 Fall Quarter 2009
Course Page
Alan Kaminsky Department of Computer Science Rochester Institute of Technology 4486 + 2220 = 6706
Home Page
Copyright © 2009 Alan Kaminsky. All rights reserved. Last updated 03-Nov-2009. Please send comments to ark­@­cs.rit.edu.