Changes between Version 23 and Version 24 of Letibee
- Timestamp:
- Nov 5, 2010, 12:40:12 PM (14 years ago)
Legend:
- Unmodified
- Added
- Removed
- Modified
-
Letibee
v23 v24 76 76 [[Image(frame_format.png, 60%, center)]] 77 77 78 Figure 3 : Frame format over the air on the different protocol layers78 Figure 3 : Frame format over the air on the different protocol layers 79 79 80 80 ==== Gateway frame format ==== … … 84 84 [[Image(frame_usb.png, 50%, center)]] 85 85 86 Figure 4 : Frame format over the USB port.87 88 * To sink from gateway, the source address is added at its beginning of the APDU.86 Figure 4 : Frame format over the USB port. 87 88 * To sink from gateway, the source address is added at its beginning of the APDU. 89 89 The rest of the frame being unchanged. 90 90 91 * To gateway from sink, ‘/0’ ascii characters is added at its ending of the APDU.91 * To gateway from sink, ‘/0’ ascii characters is added at its ending of the APDU. 92 92 93 93 ==== LOOKUP operation ==== … … 111 111 112 112 ===== Ping request ===== 113 The Ping Request frame is initiated by a sink to ping a node so has for instance to check it is still alive. It can also be initiated by a node. 113 The Ping Request frame is initiated by a sink to ping a node so has for instance to check it is still alive. 114 It can also be initiated by a node. 114 115 115 116 ===== Ping response ===== 116 The Ping Response frame is sent in response to a Ping request frame. It provides the number of hops to reach the node which initiated the ping request. 117 The Ping Response frame is sent in response to a Ping request frame. 118 It provides the number of hops to reach the node which initiated the ping request. 117 119 118 120 ==== DV-HOP operation ==== … … 122 124 * Waits for an Anchor Response Frame from the node (other responses are ignored) or the timeout 123 125 124 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: 126 The nodes, including the anchor nodes, do not embed a scheduler. 127 However, when they receive an Anchor Request Frame, they perform the following sequence of operations: 125 128 126 129 * If an Anchor Request Frame is received … … 130 133 131 134 ===== Anchor request ===== 132 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. 135 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. 136 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. 133 137 134 138 ===== Anchor response ===== 135 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. 139 The Anchor Response frame is initiated by a node in response to Anchor Request received from a sink. 140 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. 136 141 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. 137 142 138 143 ==== LOCALIZATION operation ==== 139 Each node also performs neighbour discovery in a nearly periodic manner by broadcasting advertisement frames. This operation is used to collect the RSSI information from the 1-hop neighbours. Note that 144 Each node also performs neighbour discovery in a nearly periodic manner by broadcasting advertisement frames. 145 This operation is used to collect the RSSI information from the 1-hop neighbours. 146 147 Note that: 140 148 141 149 * The advertisement frames are sent after a time comprised between 1 and 2 seconds in our setup and randomly chosen for each frame. … … 145 153 * The advertisement frames sent by the nodes do not trigger any response from the nodes which receives it. 146 154 147 The Gateway performs the start (or stop) operation. The sink will therefore poll each node in the network in a round robin manner to collect neighbours RSSI information from all the nodes. 155 The Gateway performs the start (or stop) operation. 156 The sink will therefore poll each node in the network in a round robin manner to collect neighbours RSSI information from all the nodes. 148 157 149 158 * While stop request is not received: … … 155 164 156 165 ===== Neighbor request ===== 166 157 167 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. 158 168 159 169 ===== Neighbor response ===== 160 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. 170 171 The Neighbor response frame is initiated by a node in response to a Neighbor request command frame received form a sink. 172 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. 173 The RSSI time field indicates in seconds the age of the RSSI and LQI entries. 161 174 162 175 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. 163 176 164 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”. 177 The header of the frame indicates whether the frame was fragmented, in case the original APDU size would have exceeded the maximal size supported by the PHY layer. 178 The total number of fragments is given by the field “nb_fragments” and the current fragment number by the field “fragment_num”. 165 179 166 180 The header also gives the number of hops from the node to the sink which sent the neighbour request command frame. … … 175 189 176 190 ===== Route request ===== 177 The Route Request frame is initiated by a sink to request a node to send its routing table made of the entries (destination address, next hop adress, route cost, route time). This frame shall not be confounded with the RREQ frames that are classically used in the networking layer of the protocol. 191 192 The Route Request frame is initiated by a sink to request a node to send its routing table made of the entries (destination address, next hop adress, route cost, route time). 193 This frame shall not be confounded with the RREQ frames that are classically used in the networking layer of the protocol. 178 194 179 195 ===== Route response ===== 180 The Route Request frame is initiated by a node in response to a Route request command frame received from a sink. It contains the entries of the routing table (destination address, next hop adress, route cost, route time). This frame shall not be confounded with the RREP frames that are classically used in the networking layer of the protocol. 196 The Route Request frame is initiated by a node in response to a Route request command frame received from a sink. 197 It contains the entries of the routing table (destination address, next hop adress, route cost, route time). 198 This frame shall not be confounded with the RREP frames that are classically used in the networking layer of the protocol. 181 199 The route cost contains a cost metric for the corresponding route, whereas the route time contains a value in seconds about the age of the route. 182 200 183 201 == Datamanager == 184 202 185 186 203 [[Image(datamanager.png, 60%, center)]] 187 188 204 189 205 The datamanager is a standalone software which have the following objectives:
