[Tinyos-2-commits] CVS: tinyos-2.x/doc/txt tep119.txt,1.13,1.14
Rodrigo Fonseca
rfonseca76 at users.sourceforge.net
Mon Aug 18 20:56:26 PDT 2008
Update of /cvsroot/tinyos/tinyos-2.x/doc/txt
In directory sc8-pr-cvs10.sourceforge.net:/tmp/cvs-serv2573
Modified Files:
tep119.txt
Log Message:
Updated tep119.txt to respond to most of the reviews.
Index: tep119.txt
===================================================================
RCS file: /cvsroot/tinyos/tinyos-2.x/doc/txt/tep119.txt,v
retrieving revision 1.13
retrieving revision 1.14
diff -C2 -d -r1.13 -r1.14
*** tep119.txt 15 Aug 2008 19:14:25 -0000 1.13
--- tep119.txt 19 Aug 2008 03:56:24 -0000 1.14
***************
*** 24,32 ****
The memo documents the interfaces, components, and semantics used by
! collection protocol in TinyOS 2.x. Collection provides a best-effort,
! multihop delivery of packets to the root of a tree. There may be
! multiple tree roots in a network, and in this case the semantics
! are *anycast* delivery to at least one of the roots. A node sending
! a packet does not specify which root the packet is destined to.
--- 24,36 ----
The memo documents the interfaces, components, and semantics used by
! collection protocol in TinyOS 2.x. Collection provides best-effort,
! multihop delivery of packets to one of a set of collection points.
! There may be multiple collection points in a network, and in this
! case the semantics are *anycast* delivery to at least one of the
! collection points. A node sending a packet does not specify which of
! the collection points the packet is destined to. The union of the
! paths from each node to one or more of the collection points forms a
! set of trees, and in this document assume that collection points are
! the roots of these trees.
***************
*** 43,56 ****
statistics, compute aggregates, or suppress redundant transmissions.
! Collection provides a best-effort, multihop delivery of packets to one
! of a network's tree roots: it is an *anycast* protocol. The semantics
! is that the protocol will make a reasonable effort to deliver the
! message to at least one of the roots in the network. By picking a
! parent node, a collection protocol inductively joins the tree its
! parent has joined. Delivery is best effort, and there can be
! duplicates delivered to one or more roots. Collection provides no
! ordering guarantees. Collection does not provide real-time guarantees,
! although specific implementations may extend the basic functionality
! to do so.
Given the limited state that nodes can store and a general need for
--- 47,60 ----
statistics, compute aggregates, or suppress redundant transmissions.
! Collection provides best-effort, multihop delivery of packets to one
! of a network's tree roots: it is an *anycast* protocol. The
! semantics are that the protocol will make a reasonable effort to
! deliver the message to at least one of the roots in the network. By
! picking a parent node, a node implementing the collection protocol
! inductively joins the tree its parent has joined. Delivery is best
! effort, and there can be duplicates delivered to one or more roots.
! Collection provides no ordering or real-time guarantees, although
! specific implementations may extend the basic functionality to do
! so.
Given the limited state that nodes can store and a general need for
***************
*** 64,69 ****
* Duplicate suppression, detecting and dealing with lost
! acknowledgments causing packets to replicate in the network,
! wasting capacity.
* Link estimation, evaluating the link quality to single-hop
--- 68,73 ----
* Duplicate suppression, detecting and dealing with lost
! acknowledgments that can cause packets to replicate in the
! network, wasting capacity.
* Link estimation, evaluating the link quality to single-hop
***************
*** 101,105 ****
to Receive during instantiation.
! The nodes can process a packet that are in transit. These in-network
*processors* use the Intercept interface to receive and update a
packet. The collection identifier is specified as a parameter to
--- 105,109 ----
to Receive during instantiation.
! The nodes can process a packet that is in transit. These in-network
*processors* use the Intercept interface to receive and update a
packet. The collection identifier is specified as a parameter to
***************
*** 142,151 ****
}
! Both commands MUST return SUCCESS if the node is now in the specified
! state, and FAIL otherwise. For example, if a node is already a root
! and an application calls RootControl.setRoot(), the call will
return SUCCESS. If setRoot() returns SUCCESS, then a subsequent call
! to isRoot() MUST return TRUE. If unsetRoot() returns SUCCESS, then
! a subsequent call to isRoot() MUST return FALSE.
3 Collection Services
--- 146,155 ----
}
! The first two commands MUST return SUCCESS if the node is now in the
! specified state, and FAIL otherwise. For example, if a node is already
! a root and an application calls RootControl.setRoot(), the call will
return SUCCESS. If setRoot() returns SUCCESS, then a subsequent call
! to isRoot() MUST return TRUE. If unsetRoot() returns SUCCESS, then a
! subsequent call to isRoot() MUST return FALSE.
3 Collection Services
More information about the Tinyos-2-commits
mailing list