Sensix Wireless Sensor Network Middleware    Home    Project Page    Download    CVS  Hosted by

/home/brennan/Software/sensix/source/C^4/Network.java Go to the documentation of this file. /* * Copyright 2008. Los Alamos National Security, LLC. This material * was produced under U.S. Government contract DE-AC52-06NA25396 for * Los Alamos National Laboratory (LANL), which is operated by Los * Alamos National Security, LLC, for the Department of Energy. The * U.S. Government has rights to use, reproduce, and distribute this * software. NEITHER THE GOVERNMENT NOR LOS ALAMOS NATIONAL SECURITY, * LLC, MAKES ANY WARRANTY, EXPRESS OR IMPLIED, OR ASSUMES ANY LEGAL * LIABILITY FOR THE USE OF THIS SOFTWARE. If software is modified to * produce derivative works, such modified software should be clearly * marked, so as not to confuse it with the version available from LANL. * * Additionally, this program is free software; you can redistribute * it and/or modify it under the terms of the GNU General Public * License as published by the Free Software Foundation; version 2 of * the License. Accordingly, this program is distributed in the hope * it will be useful, but WITHOUT ANY WARRANTY; without even the * implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR * PURPOSE. See the GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA. */ import java.util.*; import java.lang.Math; public class Network implements java.io.Serializable { public Vector<NodeGroup> groups; // vector of specialized vectors of nodes public Vector<Node> nodes; // direct access protected int field_width; protected boolean random; protected String identifier; transient static final int group_threshold = 5; transient static final int node_threshold = 40; transient static final int sensor_threshold = 1; transient static int TOTAL_NODES = 0; public Network() { TOTAL_NODES = 0; field_width = 600; // arbitrary groups = new Vector<NodeGroup>(); nodes = new Vector<Node>(); random = false; identifier = ""; } public Network(Network n) { this(); for (int i=0; i < n.getGroups().size(); i++) { NodeGroup curr_grp = new NodeGroup((NodeGroup)n.getGroups().elementAt(i)); for (int j=0; j < curr_grp.getNodes().size(); j++) nodes.addElement((Node)curr_grp.getNodes().elementAt(j)); groups.addElement(curr_grp); } TOTAL_NODES = nodes.size();; identifier = n.getIdentifier(); // initConnectivity(); } public int getField_width() { return field_width; } public Vector<NodeGroup> getGroups() { return groups; } public Vector<Node> getNodes() { return nodes; } public boolean getRandom() { return random; } public String getIdentifier() { return identifier; } public void setField_width(int i) { field_width = i; } public void setGroups(Vector<NodeGroup> v) { groups = v; } public void setNodes(Vector<Node> v) { nodes = v; } public void setRandom(boolean b) { random = b; Random seed = SenseGui.global_rand; Random r = new Random(seed.nextLong()); int num_groups = r.nextInt() % group_threshold; Vector<NodeGroup> g = getGroups(); int total_num_nodes = r.nextInt() % node_threshold; Vector<Node> n = getNodes(); int nodes_left = total_num_nodes; for (int g_i=0; g_i<num_groups; g_i++) { NodeGroup ng = new NodeGroup(); //ng.setApp("default"); int num_sensors = r.nextInt() % sensor_threshold; /* Vector g_s = ng.getSensors(); for (int g_s_i=0; g_s_i<num_sensors; g_s_i++) { Sensor s = new Sensor(); s.setType("default"); s.setFile("default-envir"); g_s.addElement(s); } */ int num_nodes = r.nextInt() % (nodes_left - (2 * (num_groups - g_i))); Vector<Node> g_n = ng.getNodes(); for (int g_n_i=0; g_n_i<num_nodes; g_n_i++) { Node node = new Node(); node.setRand_loc(true); node.setMygroup(ng); g_n.addElement(node); n.addElement(node); } g.addElement(ng); } } public void setIdentifier(String s) { identifier = s; } public Node findNode(int node_id) { for (int i=0; i<nodes.size(); i++) { Node n = (Node)nodes.elementAt(i); if (n.getId() == node_id) return n; } return null; } public void initConnectivity() { System.err.println("Initializing network connectivity."); for (int i=0; i<nodes.size(); i++) { Node current = (Node)nodes.elementAt(i); for (int j=i+1; j<nodes.size(); j++) { Node peer = (Node)nodes.elementAt(j); if (peer != null) { double dist = Node.distance(current, peer); } } } } public NodeGroup getGroup(int i) { return (NodeGroup)(groups.elementAt(i)); } public Node getNode(int i) { return (Node)(nodes.elementAt(i)); } public String toString() { StringBuffer s = new StringBuffer(); s.append(nodes.size() + " nodes in " + groups.size() + " groups.\n"); s.append("\n NODES:\n"); for (int i=0; i<nodes.size(); i++) s.append(" " + ((Node)nodes.elementAt(i)).toString()); s.append("\n GROUPS:\n"); for (int i=0; i<groups.size(); i++) s.append(" " + ((NodeGroup)groups.elementAt(i)).toString()); return s.toString(); } private class SortNode { int num_adj; Node node; Vector<Node> adj; int id; SortNode() { adj = new Vector<Node>(); num_adj = 0; } } private interface Compare { public int compare(Object a, Object b); public class StringCompare implements Compare { public final int compare (Object a, Object b) { return ((String) a).compareTo((String) b); } } public class IntegerCompare implements Compare { public final int compare (Object a, Object b) { return ((Integer) a).intValue() - ((Integer) b).intValue(); } } public class SortNodeCompare implements Compare { public final int compare (Object a, Object b) { if (((SortNode)a).num_adj < ((SortNode)b).num_adj) return -1; else if (((SortNode)a).num_adj > ((SortNode)b).num_adj) return 1; else { // equal if (((SortNode)a).id < ((SortNode)b).id) return -1; else if (((SortNode)a).id > ((SortNode)b).id) return 1; else // impossible return 0; } } } } private class QuickSort { private Compare delegate; private Object [] userArray; private void quicksort(int p, int r) { if (p < r) { int q = partition(p, r); if (q == r) q--; quicksort(p, q); quicksort(q+1, r); } } private int partition(int lo, int hi) { Object pivot = userArray[lo]; while (true) { while (delegate.compare(userArray[hi],pivot) >= 0 && lo < hi) hi--; while (delegate.compare(userArray[lo],pivot) < 0 && lo < hi) lo++; if (lo < hi) { Object T = userArray[lo]; userArray[lo] = userArray[hi]; userArray[hi] = T; } else return hi; } } private boolean isAlreadySorted() { for (int i=1; i<userArray.length; i++) if (delegate.compare(userArray[i], userArray[i-1]) < 0) return false; return true; } } public void partitionNet(int k) { int q = (int)Math.ceil((double)nodes.size() / (double)k); // max nodes per partition SortNode[] sorted = new SortNode[nodes.size()]; for (int s=0; s<nodes.size(); s++) { // pack into sorting array sorted[s] = new SortNode(); } QuickSort h = new QuickSort(); h.delegate = new Compare.SortNodeCompare(); h.userArray = sorted; if(!h.isAlreadySorted()) h.quicksort(0, sorted.length-1); // sort int index = 0; for (int i=0; i<k && index<nodes.size(); i++) { int p = 0; /* while (p < q) { partitioning.insertElementAt(sorted[index].node, i); for (int j=0; j<sorted[index].num_adj && p<q; j++, p++) partitioning.insertElementAt( (Node)sorted[index].adj.elementAt(j), i); Integer g = (Integer)partitioning.elementAt(sorted[index].id); while (g != null && g.intValue() != -1) { index++; g = (Integer)partitioning.elementAt(sorted[index].id); } } */ } } }

© 2008, Los Alamos National Security, LLC.