87 lines
2.5 KiB
Java
87 lines
2.5 KiB
Java
/*
|
|
* Copyright (c) 2008, Swedish Institute of Computer Science.
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* 3. Neither the name of the Institute nor the names of its contributors
|
|
* may be used to endorse or promote products derived from this software
|
|
* without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*
|
|
*
|
|
* -----------------------------------------------------------------
|
|
*
|
|
* Link
|
|
*
|
|
* Authors : Joakim Eriksson, Niclas Finne
|
|
* Created : 3 jul 2008
|
|
* Updated : $Date: 2010/11/03 14:53:05 $
|
|
* $Revision: 1.1 $
|
|
*/
|
|
|
|
package org.contikios.contiki.collect;
|
|
|
|
/**
|
|
*
|
|
*/
|
|
public class Link {
|
|
|
|
public final Node node;
|
|
|
|
private double etx;
|
|
private int quality = 100;
|
|
private long lastActive = 0L;
|
|
|
|
public Link(Node node) {
|
|
this.node = node;
|
|
this.lastActive = System.currentTimeMillis();
|
|
}
|
|
|
|
public Node getNode() {
|
|
return node;
|
|
}
|
|
|
|
public int getQuality() {
|
|
return quality;
|
|
}
|
|
|
|
public void setQuality(int quality) {
|
|
this.quality = quality;
|
|
}
|
|
|
|
public double getETX() {
|
|
return etx;
|
|
}
|
|
|
|
public void setETX(double etx) {
|
|
this.etx = etx;
|
|
}
|
|
|
|
public long getLastActive() {
|
|
return lastActive;
|
|
}
|
|
|
|
public void setLastActive(long time) {
|
|
this.lastActive = time;
|
|
}
|
|
|
|
}
|