• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on ITS(Intelligent Transport Systems Standardization) Telecommunications Proceedings(ITST2006); 20060621-23; Chengdu(CN) >Performance of Wireless Mesh Networks with Centralized Multihop Scheduling for Intelligent Transportation Systems
【24h】

Performance of Wireless Mesh Networks with Centralized Multihop Scheduling for Intelligent Transportation Systems

机译：集中式多跳调度的智能交通系统无线网状网络性能

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

摘要

We consider the problem of centralized multihop scheduling in wireless mesh networks for solutions to realize intelligent transportation systems. A scheduling tree construction strategy is investigated, which could use any predetermined selection metrics, while avoiding primary and secondary interferences to a great extent Two centralized multihop scheduling algorithms are presented to schedule nodes on the constructed scheduling tree. In contrast with FIFO algorithm, the Fair algorithm has the property that it guarantees fairness among downlink relay queues of each relay node, while making an efficient utilization of free mini-slots. The feasibility of scheduling tree construction strategy with both minimal hop count and maximal signal strength metrics for a mesh cell is studied through experiment. Simulation results of network throughput and average active link number show that the Fair algorithm utilizes network resources more efficiently than the FIFO algorithm.
机译：我们考虑无线网状网络中的集中式多跳调度问题，以实现智能交通系统。研究了一种调度树的构建策略，该策略可以使用任何预定的选择指标，同时最大程度地避免了主要干扰和次要干扰。提出了两种集中式多跳调度算法，用于在构造的调度树上调度节点。与FIFO算法相比，Fair算法具有以下特性：它可以保证每个中继节点的下行链路中继队列之间的公平性，同时可以有效利用空闲小时隙。通过实验研究了同时具有最小跳数和最大信号强度指标的调度树构建策略的可行性。网络吞吐量和平均活动链接数的仿真结果表明，Fair算法比FIFO算法更有效地利用网络资源。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号