[Tinyos-2-commits] CVS: tinyos-2.x/doc/txt tep119.txt,1.9,1.10

[Omprakash Gnawali]

Update of /cvsroot/tinyos/tinyos-2.x/doc/txt
In directory sc8-pr-cvs10.sourceforge.net:/tmp/cvs-serv17526

Modified Files:
	tep119.txt 
Log Message:
some updates

Index: tep119.txt
===================================================================
RCS file: /cvsroot/tinyos/tinyos-2.x/doc/txt/tep119.txt,v
retrieving revision 1.9
retrieving revision 1.10
diff -C2 -d -r1.9 -r1.10
*** tep119.txt	1 May 2008 20:18:50 -0000	1.9
--- tep119.txt	4 May 2008 18:38:27 -0000	1.10
***************
*** 239,243 ****
  reference implementation, and is not the only possibility.  It
  consists of three major components, which are wired together to form
! a CollectionC: LinkEstimatorP, CtpTreeRoutingEngineP, and
  CtpForwardingEngineP. 
  
--- 239,243 ----
  reference implementation, and is not the only possibility.  It
  consists of three major components, which are wired together to form
! a CollectionC: LinkEstimatorP, CtpRoutingEngineP, and
  CtpForwardingEngineP. 
  
***************
*** 252,274 ****
  
  LinkEstimatorP estimates the quality of link to or from each
! neighbor. Link estimation can be done in a variety of ways, and we
! do not impose one here. It is decoupled from the establishment of
! routes. There is a narrow interface -- LinkEstimator -- between the
! link estimator and the routing engine. The one requirement is that
! the quality returned is standardized. A smaller return value from
! LinkEstimator.getQuality(), LinkEstimator.getforwardQuality(),
! LinkEstimator.getReverseQuality() MUST imply that the link to the
  neighbor is estimated to be of a higher quality than the one that
  results in a larger return value. The range of value SHOULD be
! [0,255] and the variation in link quality in that range SHOULD be
  linear. Radio provided values such as LQI or RSI, beacon based link
  estimation to compute ETX, or their combination are some possible
! approaches to estimating link qualities. 
  
  LinkEstimatorP MAY have its own control messages to compute
! bi-directional link qualities. LinkEstimatorP provides calls
! (txAck(), txNoAck(), and clearDLQ()) to update the link estimates
! based on successful or unsuccessful data transmission to the
! neighbors. 
  
  The user of LinkEstimatorP can call insertNeighbor() to manually
--- 252,283 ----
  
  LinkEstimatorP estimates the quality of link to or from each
! neighbor. In this TEP, we briefly describe the reference
! implementation in ''tinyos-2.x/tos/lib/4bitle'' and refer the readers
! to [3]_ for detailed description of the estimator.
! 
! Link estimation is decoupled from the establishment of routes. There
! is a narrow interface -- LinkEstimator and CompareBit -- between the
! link estimator and the routing engine. The one requirement is that the
! quality returned is standardized. A smaller return value from
! LinkEstimator.getLinkQuality() MUST imply that the link to the
  neighbor is estimated to be of a higher quality than the one that
  results in a larger return value. The range of value SHOULD be
! [0,65535] and the variation in link quality in that range SHOULD be
  linear. Radio provided values such as LQI or RSI, beacon based link
  estimation to compute ETX, or their combination are some possible
! approaches to estimating link qualities. The routing engine instructs
! LinkEstimatorP to insert the neighbor, through which a high quality
! path to the root can be constructed, into the neighbor table by
! returning TRUE when LinkEstimatorP signals Comparebit.shouldInsert()
! for the newly discovered neighbor.
  
  LinkEstimatorP MAY have its own control messages to compute
! bi-directional link qualities. LinkEstimatorP provides calls (txAck(),
! txNoAck(), and clearDLQ()) to update the link estimates based on
! successful or unsuccessful data transmission to the
! neighbors. LinkEstimatorP uses the LinkPacketMetadata interface to
! determine if the channel was of high quality when a packet is received
! from a neighbor to consider the link to that neighbor for insertion
! into the neighbor table.
  
  The user of LinkEstimatorP can call insertNeighbor() to manually
***************
*** 287,298 ****
        interface Init;
        interface Packet;
!       interface LinkSrcPacket;
      }
    }
  
    interface LinkEstimator {
!     command uint8_t getLinkQuality(uint16_t neighbor);
!     command uint8_t getReverseQuality(uint16_t neighbor);
!     command uint8_t getForwardQuality(uint16_t neighbor);
      command error_t insertNeighbor(am_addr_t neighbor);
      command error_t pinNeighbor(am_addr_t neighbor);
--- 296,317 ----
        interface Init;
        interface Packet;
!       interface CompareBit;
!     }
!     uses {
!       interface AMSend;
!       interface AMPacket as SubAMPacket;
!       interface Packet as SubPacket;
!       interface Receive as SubReceive;
!       interface LinkPacketMetadata;
!       interface Random;
      }
    }
  
+   interface CompareBit {
+     event bool shouldInsert(message_t *msg, void* payload, uint8_t len, bool white_bit);
+   }
+ 
    interface LinkEstimator {
!     command uint16_t getLinkQuality(uint16_t neighbor);
      command error_t insertNeighbor(am_addr_t neighbor);
      command error_t pinNeighbor(am_addr_t neighbor);
***************
*** 339,343 ****
            interface LinkEstimator;
            interface AMPacket;
-           interface LinkSrcPacket;
            interface SplitControl as RadioControl;
            interface Timer<TMilli> as BeaconTimer;
--- 358,361 ----
***************
*** 346,349 ****
--- 364,368 ----
            interface CollectionDebug;
            interface CtpCongestion;
+           interface Comparebit;
        }
    }
***************
*** 475,478 ****
  
  .. [1] TEP 116: Packet Protocols
  .. [2] TEP 123: The Collection Tree Protocol (CTP) 
!  
--- 494,499 ----
  
  .. [1] TEP 116: Packet Protocols
+ 
  .. [2] TEP 123: The Collection Tree Protocol (CTP) 
! 
! .. [3] Rodrigo Fonseca, Omprakash Gnawali, Kyle Jamieson, and Philip Levis. "Four Bit Wireless Link Estimation." In Proceedings of the Sixth Workshop on Hot Topics in Networks (HotNets VI), November 2007