Virtual Surrounding Face Geocasting with Guaranteed Message面对虚拟周边地域有保障的消息.pptVIP

  • 0
  • 0
  • 约4.58千字
  • 约 26页
  • 2017-03-09 发布于上海
  • 举报

Virtual Surrounding Face Geocasting with Guaranteed Message面对虚拟周边地域有保障的消息.ppt

Virtual Surrounding Face Geocasting with Guaranteed Message面对虚拟周边地域有保障的消息

11/14/ 2006 ICNP 2006 Virtual Surrounding Face Geocasting with Guaranteed Message Delivery for Ad Hoc and Sensor Networks Jie Lian, Kshirasagar Naik University of Waterloo, ON, Canada Yunhao Liu, Lei Chen The Hong Kong University of Science and Technology, Hong Kong, China Sensor Networks Geocasting in Sensor Networks Existing Approaches: Restricted Flooding Existing Approaches Approaches with delivery guarantee DFFTT: Depth-First Face Tree Traversal RFIFT: Restricted Flooding with Intersected Face Traversal EZMG: Entrance Zone Multicasting-based Geocasting Drawbacks :Complex, longer delivery time, high message cost, potentially series contention. Virtual Surround Face (VSF) Example of VSF Geocasting Special Case 1 in VSFG Boundary of VSF connected via internal nodes z t Special Case 2 of VSFG VSF connected via external crossing edge yu Special Case 2 in RFIFT RFIFT has much longer delivery time Asymptotical bound of VSFG The message complexity of VSF traversal is bounded by 2n, where n is the number of nodes located on VSF boundary. The message complexity of face traversal in RFIFT is bounded by 3n. Simulation Setup Two types of simulated networks Random network: randomly deployed node in a 20 ? 20 square area. Void network: From random networks, a number of 1.5 ? 1.5 square voids are randomly generated and all nodes within voids are removed. Geocasting region: randomly generated rectangular regions Performance metric: number of messages required Simulation Results: Random Network Simulation Results: Void Network Conclusion Design of VSF Guaranteed message delivery Fast delivery due to concurrent double directional traversal Low transmission cost Low probability of collision occurrences Scalability Future Work Reducing face traversal cost by designing shortcut algorithm Designing localized dominating-set based flooding algorithm to replace restricted flooding in VSFG. Analyzing the impact of location errors on VSFG and providing respective solutions. Studyi

您可能关注的文档

文档评论(0)

1亿VIP精品文档

相关文档