237:
Each packet contains the ETX from the sender to the root. If a node receives a packet with ETX lower than its own this indicates an inconsistency in the tree. This triggers the transmission of a beacon frame. The goal is to have the sender of the packet receive the beacon frame and adjust its ETX
224:
Each node only keeps the smallest ETX (to the nearest tree root). The collection of ETX values is known as a gradient, and messages are only sent down the gradient from nodes with higher ETX to nodes with smaller ETX. This kind of forwarding is common to many algorithms and protocols in wireless
246:
The interval with which nodes broadcast beacons presents a tradeoff. If beacons were sent more frequently the routing information would be up to date more often and the network would respond to changes in topology faster. However, sending beacons more frequently leaves less bandwidth for
228:
Rapidly changing link qualities, for example in sensor networks with moving nodes, cause routing information to become outdated which can lead to routing loops. CTP attempts to address these issues through datapath validation and adaptive beaconing.
54:
Each node that wishes to collect data advertises itself as a tree root. Each node sends its data to the tree root to which it is nearest, that is, the tree root from which it is separated by the smallest ETX. A tree root always has an ETX of zero.
219:
106:
114:
51:. Routes with a lower metric are preferred. In a route that includes multiple hops, the metric is the sum of the ETX of the individual hops.
40:
278:
Gnawali, Omprakash; Fonseca, Rodrigo; Jamieson, Kyle; Moss, David; Levis, Philip (2009). "Collection tree protocol".
306:
28:
61:
251:
data and uses more energy. To get around this CTP uses adaptive beaconing. It sends beacons faster when it
283:
265:
Fonseca, Rodrigo; Gnawali, Omprakash; Jamieson, Kyle; Kim, Sukun; Levis, Philip; Woo, Alec (2006–2007).
288:
248:
24:
266:
31:. It is used for transferring data from one or more sensors to one or more root nodes.
44:
300:
255:. If it doesn't detect problems it exponentially decreases the beacon sending rate.
214:{\displaystyle \mathrm {ETX_{node}} =\mathrm {ETX_{parent}} +\mathrm {ETX_{link}} }
48:
39:
The number of expected transmissions needed to send data between two nodes,
117:
64:
213:
100:
47:. This assumes packets are retransmitted at the
16:Routing protocol for wireless sensor networks
8:
287:
195:
184:
159:
148:
129:
118:
116:
76:
65:
63:
252:
101:{\displaystyle \mathrm {ETX_{root}} =0}
7:
205:
202:
199:
196:
192:
188:
185:
175:
172:
169:
166:
163:
160:
156:
152:
149:
139:
136:
133:
130:
126:
122:
119:
86:
83:
80:
77:
73:
69:
66:
14:
1:
323:
29:wireless sensor networks
21:Collection Tree Protocol
215:
102:
216:
103:
115:
62:
233:Datapath validation
242:Adaptive beaconing
211:
98:
307:Routing protocols
249:application level
225:sensor networks.
43:, is used as the
314:
293:
291:
274:
253:detects problems
220:
218:
217:
212:
210:
209:
208:
180:
179:
178:
144:
143:
142:
107:
105:
104:
99:
91:
90:
89:
25:routing protocol
322:
321:
317:
316:
315:
313:
312:
311:
297:
296:
289:10.1.1.148.8534
277:
264:
261:
244:
235:
191:
155:
125:
113:
112:
72:
60:
59:
37:
17:
12:
11:
5:
320:
318:
310:
309:
299:
298:
295:
294:
275:
260:
257:
243:
240:
234:
231:
222:
221:
207:
204:
201:
198:
194:
190:
187:
183:
177:
174:
171:
168:
165:
162:
158:
154:
151:
147:
141:
138:
135:
132:
128:
124:
121:
109:
108:
97:
94:
88:
85:
82:
79:
75:
71:
68:
45:routing metric
36:
33:
15:
13:
10:
9:
6:
4:
3:
2:
319:
308:
305:
304:
302:
290:
285:
281:
276:
272:
268:
263:
262:
258:
256:
254:
250:
241:
239:
238:accordingly.
232:
230:
226:
181:
145:
111:
110:
95:
92:
58:
57:
56:
52:
50:
46:
42:
34:
32:
30:
26:
22:
279:
270:
245:
236:
227:
223:
53:
38:
20:
18:
23:(CTP) is a
259:References
49:link layer
284:CiteSeerX
35:Algorithm
301:Category
282:: 1–14.
271:tiny OS
286:
280:SenSys
267:"CTP"
27:for
19:The
41:ETX
303::
269:.
292:.
273:.
206:k
203:n
200:i
197:l
193:X
189:T
186:E
182:+
176:t
173:n
170:e
167:r
164:a
161:p
157:X
153:T
150:E
146:=
140:e
137:d
134:o
131:n
127:X
123:T
120:E
96:0
93:=
87:t
84:o
81:o
78:r
74:X
70:T
67:E
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.