1 / 11

Context-aware Geographic Routing for Sensor Networks with Routing Holes

Context-aware Geographic Routing for Sensor Networks with Routing Holes. WCNC 2009 Jiaxi You, Dominik Lieckfeldt, Frank Reichenbach, and Dirk Timmermann University of Rostock, Germany. Reporter: 黃宥崴 2009/5/26. Outline. Introduction Related work Protocol design Simulation results

jenna-holloway
Download Presentation

Context-aware Geographic Routing for Sensor Networks with Routing Holes

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Context-aware Geographic Routingfor Sensor Networks with Routing Holes WCNC 2009 Jiaxi You, Dominik Lieckfeldt, Frank Reichenbach, and Dirk Timmermann University of Rostock, Germany Reporter: 黃宥崴 2009/5/26

  2. Outline • Introduction • Related work • Protocol design • Simulation results • Conclusions

  3. Introduction • Voids in deployment or node failure can cause routing holes in the network, which often cause traditional geographic routing algorithms to fail. • The reason is the local minimum phenomenon illustrated.

  4. Related work • Hole Avoiding In advance Routing protocol (HAIR) • A node recognizes itself as a local minimum, it asks its neighbors to mark itself as a hole node. • HAIR achieves shorter routing paths, and thus reduces energy consumption.

  5. Protocol design • HOle-BYpassing routing with Context-AwareNess (HobyCan). • construct multiple detour paths for a hole. • introduce a threshold of the remaining energy of detour nodes, call E_THR.

  6. with greedy forwarding and turns to the perimeter mode when approaching a hole. • a predefined number of detour paths around hole(s) are constructed.

  7. Simulation results

  8. Conclusions • The highlight of HobyCan is its ability to balance the routing load among nodes near routing holes. • Simulation results showed that the number of detour paths constructed in the early phase has a strong impact on the performance of HobyCan.

More Related