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

Octopus’ Grid The space is divided to horizontal and vertical strips The division is related to a (0,0) point and not affected by the nodes’ locations The space is divided to horizontal and vertical strips The division is related to a (0,0) point and not affected by the nodes’ locations Each node knows its vertical and horizontal strips Each node knows its vertical and horizontal strips a i f ec gh dbj

Core Module: The Neighbor List (proactive part) Each node in a range of 250m receives this message and updates its one-hop neighbor list accordingly. Each node in a range of 250m receives this message and updates its one-hop neighbor list accordingly. a i f ec gh dbj updates the list Every timeout, each node broadcasts its ID and location. Every timeout, each node broadcasts its ID and location.

Core Module: The Strips DB (proactive part) a i f ec gh dbj At the end, the east table of node a is {b, c, d, e, j}. At the end, the east table of node a is {b, c, d, e, j}. j,e,dj,e,d,cj,e,d,c,bj,e,d,c,b,a End Node j initiates the update of its strip. End Node j initiates the update of its strip.

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. f c gh abd h? source access target h? h! e

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