首页> 外文会议>Computational Science - ICCS 2007 pt.4; Lecture Notes in Computer Science; 4490 >Channel Time Allocation and Routing Algorithm for Multi-hop Communications in IEEE 802.15.3 High-Rate WPAN Mesh Networks
【24h】

Channel Time Allocation and Routing Algorithm for Multi-hop Communications in IEEE 802.15.3 High-Rate WPAN Mesh Networks

机译:IEEE 802.15.3高速WPAN网状网络中多跳通信的信道时间分配和路由算法

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

摘要

IEEE 802.15.3 High-rate Wireless Personal Area Networks (WPANs) have been developed to communicate with devices within 10m at high speed. A mesh network made up of a parent piconet and several child piconets can support multi-hop communications. In this paper, we propose an efficient Channel Time Allocation (CTA) method and routing algorithm for multi-hop communications in IEEE 802.15.3 high-rate WPAN mesh networks. The proposed CTA allocation method allows sufficient CTA allocation for the relay PNCs. The proposed routing algorithm is tree-based, and the routing tables of parent PNCs and child PNCs are created by efficient device discovery process to find the shortest paths via parent PNCs or subordinate child PNCs. We evaluate the performance of the proposed algorithms via simulations. The proposed algorithms are shown to extend the communication range by multi-hop exchange of packets and to provide sufficient Channel Time Allocations (CTAs) for parent and child PNCs.
机译:IEEE 802.15.3高速无线个人局域网(WPAN)已被开发为与10m以内的设备进行高速通信。由父微微网和几个子微微网组成的网状网络可以支持多跳通信。在本文中,我们提出了一种高效的信道时间分配(CTA)方法和路由算法,用于IEEE 802.15.3高速率WPAN网状网络中的多跳通信。所提出的CTA分配方法允许对中继PNC进行足够的CTA分配。所提出的路由算法是基于树的,并且通过有效的设备发现过程来创建父PNC和子PNC的路由表,以通过父PNC或从属子PNC查找最短路径。我们通过仿真评估了所提出算法的性能。所示算法通过多跳交换数据包扩展了通信范围,并为父PNC和子PNC提供了足够的信道时间分配(CTA)。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号