O C T O P U S Scalable Routing Protocol For Wireless Ad Hoc Networks

1. O C T O P U SScalable Routing Protocol For Wireless Ad Hoc Networks - Lily Itkin - Evgeny Gurevich - Inna Vaisband - Lab Chief Engineer: Dr. Ilana David Instructor: Roie Melamed

2. 100 200 300 400 500 600 100 200 300 400 Octopus’ Grid • The space is divided to horizontal and vertical stripsThe division is related to a (0,0) point and not affected by the nodes’ locations • Each node knows its vertical and horizontal strips a b c d e j f g h i

3. 100 200 300 400 500 600 100 200 300 400 Core Module: The Neighbor List(proactive part) • Every timeout, each node broadcasts its ID and location. • Each node in a range of 250m receives this message and updates its one-hop neighbor list accordingly. updates the list updates the list updates the list a b c d e j f g h i updatesthe list updates the list

4. j,e,d,c,b j,e,d,c j,e,d j,e,d,c,b,a 100 200 300 400 500 600 100 200 300 400 Core Module: The Strips DB(proactive part) • End Node j initiates the update of its strip. • At the end, the east table of node a is {b, c, d, e, j}. a b c d e j f g h i

5. 100 200 300 400 500 600 100 200 300 400 FL Module: Locating the Target(reactive part) Example: Node b wants to transmit data to node h, whose location node b doesn’t know. The query reaches node g, who know the location of h from his strip DB and returns to b with updated information. source h! a b c d h? f h? h! e g h target access

6. Summary: Empirical Evaluation Found Replied Comprehensive empirical estimation on ns2 network simulator proved excellent success results of Octopus protocol