首页> 外文会议>5th international conference on mobile technology, applications and systems 2008 >Interference-aware Topology Control in Wireless Mesh Network
【24h】

Interference-aware Topology Control in Wireless Mesh Network

机译:无线网状网络中的干扰感知拓扑控制

获取原文
获取原文并翻译 | 示例

摘要

In wireless mesh networks, each node should help to relay packets of neighboring nodes toward gateway using multi-hop routing mechanism. Wireless mesh networks usually intensively deploy mesh nodes to cope with the problem of dead spot communication. However, the higher density of nodes deployed the higher radio interference occurred. And, this causes significant degradation of system performance.rnIn this paper, we first transform network problem into geometry problem in graph. We define line intersection in a graph to reflect radio interference problem. We use plan sweep algorithm to find intersection lines, if any, employ Voronoi diagram algorithm to delimit the regions among nodes, use Delaunay triangulation algorithm to reconstruct the graph in order to minimize the interference among nodes. Finally, we use standard deviation to prune off those longer links (higher interference links) to have a further refinement. This hybrid solution is able to significantly reduce interference in O(n log n) time complexity.
机译:在无线网状网络中,每个节点应使用多跳路由机制帮助将相邻节点的数据包中继到网关。无线网状网络通常密集地部署网状节点以应对盲点通信的问题。但是,部署的节点密度越高,发生的无线电干扰就越大。并且,这会导致系统性能的显着下降。在本文中,我们首先将网络问题转换为图形中的几何问题。我们在图中定义线相交以反映无线电干扰问题。我们使用计划扫描算法查找相交线(如果有),使用Voronoi图算法来划定节点之间的区域,使用Delaunay三角剖分算法来重构图形,以最大程度地减少节点之间的干扰。最后,我们使用标准差修剪掉那些较长的链接(干扰较大的链接)以进行进一步的改进。这种混合解决方案能够显着降低O(n log n)时间复杂度的干扰。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号