Ley Line Routing (L2R)
| Small memory capacity is a fundamental constraint on networked embedded devices; limiting routing table size, buffer capacity, and all routing state. We are designing Ley Line Routing (L2R), a layer 3 any-to-any routing protocol for wireless meshes whose routing state is independent of the network size, network density, and number of destinations in the network. L2R provides guarantees on the worst case routing stretch, even with (a constant number of) minimal routing entries, and provides a tunable tradeoff between routing state and stretch. |  |
People
- Muneeb Ali (primary contact)
- Tom Parker (TU Delft, Netherlands)
- Adam Dunkels (SICS, Sweden)
- Koen Langendoen (TU Delft, Netherlands)
- Philip Levis (Stanford University, CA)
Publications
- M. Ali, A. Dunkels, T. Parker, K. Langendoen, and P. Levis,
"L2R: Routing in Low Power and Lossy Networks with Constant State",
Under submission.
Talks
- "Routing in Low Power & Lossy Networks", [not online yet]
by Muneeb Ali, at SING, Stanford University, CA. (August 16th 2007)
Resources
|  |
About Ley Lines
Ley lines are hypothetical alignments of a number of places of geographical interest, such as ancient monuments and megaliths. Ley lines have got nothing to do with the Ley Line Routing Protocol apart from inspiring it's name. Existence of the, "mystical" and "holy", ley lines was suggested in 1921 by the amateur archaeologist Alfred Watkins, whose book The Old Straight Track brought the alignments to the attention of the wider public. |  |