Changes between Version 10 and Version 11 of Letibee
- Timestamp:
- Nov 5, 2010, 1:26:09 AM (14 years ago)
Legend:
- Unmodified
- Added
- Removed
- Modified
-
Letibee
v10 v11 14 14 * An estimated map of the measure done at each node side. 15 15 16 [[Image(cea_wsan.png, 60%, center)]]16 [[Image(cea_wsan.png, 70%, center)]] 17 17 18 18 Figure 1 : CEA WSAN + Gateway for Sensei … … 109 109 If the sink receives an Anchor Request from the Gateway: 110 110 * For each node 111 ** Send an Anchor Request Frame (with echoes if no response is received)112 ** Waits for an Anchor Response Frame from the node (other responses are ignored) or the timeout111 * Send an Anchor Request Frame (with echoes if no response is received) 112 * Waits for an Anchor Response Frame from the node (other responses are ignored) or the timeout 113 113 114 114 The nodes, including the anchor nodes, do not embed a scheduler. However, when they receive an Anchor Request Frame, they perform the following sequence of operations: 115 115 116 116 * If an Anchor Request Frame is received 117 ** For each anchor node (listed in the Anchor Request Frame)118 *** Send a Ping Request Frame119 *** Waits for a Ping Response Frame from the anchor node (other responses are ignored) or the timeout120 121 # Anchor request 117 * For each anchor node (listed in the Anchor Request Frame) 118 * Send a Ping Request Frame 119 * Waits for a Ping Response Frame from the anchor node (other responses are ignored) or the timeout 120 121 ===== Anchor request ===== 122 122 The Anchor Request frame is initiated by a sink to request a node to issue a ping request command frame towards a list of anchor nodes. This frame aims at being used by the DV-HOP location algorithm which requires the knowledge of the number of hops between any node in the network and any anchor in the network. 123 123 124 # Anchor response 124 ===== Anchor response ===== 125 125 The Anchor Response frame is initiated by a node in response to Anchor Request received from a sink. This frame aims at being used by the DV-HOP location algorithm which requires the knowledge of the number of hops between any node in the network and any anchor in the network. 126 126 The header contains the number of anchors seen by the node, and the payload contains for each seen anchor the (anchor address, number of hops) doublet. … … 139 139 * While stop request is not received: 140 140 141 ** Every second142 *** For each node143 **** Send a Neighbour Request Frame144 **** Waits for a Neighbour Response Frame from the node (other responses are ignored) or the timeout145 146 # Neighbor request 141 * Every second 142 * For each node 143 * Send a Neighbour Request Frame 144 * Waits for a Neighbour Response Frame from the node (other responses are ignored) or the timeout 145 146 ===== Neighbor request ===== 147 147 The Neighbor request frame is initiated by a sink to request a node to send its table made of the (neighbour address, RSSI time, RSSI value, LQI value) quadruplets. 148 148 149 # Neighbor response 149 ===== Neighbor response ===== 150 150 The Neighbor response frame is initiated by a node in response to a Neighbor request command frame received form a sink. It contains its table of neighbours and is made of the (neighbour address, RSSI time, RSSI value, LQI value) quadruplets as requires by the RSSI based location algorithm. The RSSI time field indicates in seconds the age of the RSSI and LQI entries. 151 151 152 Moreover the frame payload contains the values of the sensor readings of the node (8 bytes, fixed with 1 byte per sensor according to the bitmap field “active_sensors” of the header. 153 152 154 The header of the frame indicates whether the frame was fragmented1, in case the original APDU size would have exceeded the maximal size supported by the PHY layer. The total number of fragments is given by the field “nb_fragments” and the current fragment number by the field “fragment_num”. 155 153 156 The header also gives the number of hops from the node to the sink which sent the neighbour request command frame. 154 157