• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Parallel and Distributed Systems >Geographical Cluster-Based Routing in Sensing-Covered Networks
【24h】

Geographical Cluster-Based Routing in Sensing-Covered Networks

机译：传感网络中基于地理集群的路由

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The relationship between coverage and connectivity in sensor networks has been investigated in recent research treating both network parameters in a unified framework. It is known that networks covering a convex area are connected if the communication range of each node is at least twice a unique sensing range used by each node. Furthermore, geographic greedy routing is a viable and effective approach providing guaranteed delivery for this special network class. In this work, we will show that the result about network connectivity does not suffer from generalizing the concept of sensing coverage to arbitrary network deployment regions. However, dropping the assumption that the monitored area is convex requires the application of greedy recovery strategies like traversing a locally extracted planar subgraph. This work investigates a recently proposed planar graph routing variant and introduces a slight but effective simplification. Both methods perform message forwarding along the edges of a virtual overlay graph instead of using wireless links for planar graph construction directly. In general, there exist connected network configurations where both routing variants may fail. However, we will prove three theoretical bounds which are a sufficient condition for guaranteed delivery of these routing strategies applied in specific classes of sensing covered networks. By simulation results, we show that geographical cluster-based routing outperforms existing related geographical routing variants based on one-hop neighbor information. Furthermore, simulations performed show that geographical cluster-based routing achieves a comparable performance compared to variants based on two-hop neighbor information, while maintaining the routing topology consumes a significantly reduced amount of communication resources.
机译：在最近的研究中，在统一框架中同时处理了两个网络参数，已经研究了传感器网络的覆盖范围和连通性之间的关系。已知如果每个节点的通信范围至少是每个节点使用的唯一感测范围的两倍，则连接覆盖凸面区域的网络。此外，地理贪婪路由是一种可行且有效的方法，可以为这种特殊的网络类别提供有保证的传递。在这项工作中，我们将显示关于网络连接性的结果不会受到将感知覆盖范围的概念推广到任意网络部署区域的困扰。但是，放弃监视区域是凸面的假设需要应用贪婪恢复策略，例如遍历本地提取的平面子图。这项工作调查了最近提出的平面图路由变体，并引入了一些细微但有效的简化方法。两种方法都沿着虚拟覆盖图的边缘执行消息转发，而不是直接使用无线链接来构建平面图。通常，存在连接的网络配置，其中两个路由变量都可能失败。但是，我们将证明三个理论界限，它们是保证在特定类别的感知覆盖网络中应用这些路由策略的保证条件。通过仿真结果，我们表明基于地理集群的路由优于基于一跳邻居信息的现有相关地理路由变体。此外，执行的仿真表明，与基于两跳邻居信息的变体相比，基于地理集群的路由可实现可比的性能，同时保持路由拓扑会消耗大量通信资源。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号