首页> 外国专利> Adaptive tree-based contention resolution media access control protocol

Adaptive tree-based contention resolution media access control protocol

机译:基于自适应树的竞争解决媒体访问控制协议

摘要

An adaptive tree-based contention resolution media access control protocol for a local area network using orthogonal frequency division multiplexing. The invention uses constant tones in frequency bins to resolve contention between multiple transmitting nodes. All nodes are synchronized to transmit “contention tones” in a “contention frame.” Each node is assigned a unique identification (ID) number, and this ID number is mapped to frequency bins by transmitting a tone in each bin corresponding to each 1-bit in the binary representation of the node's ID number. The result of multiple nodes each transmitting its unique ID during a contention frame is a complex frequency signal which each participating node decodes. The nodes then participate in a “resolution frame” in which all nodes again transmit tones in frequency bins. The resolution frame tones correspond only to tones in which the result of the contention frame indicated the presence of a tone where such node had 0-valued ID bits. All nodes receive the results of the resolution frame and record the results (“resolution bits”) in a reasonably-balanced binary tree. If the resolution frame contained no tones in any frequency bin, only one node is contending and can transmit. Otherwise, the contending nodes utilize the resolution bits to continue with another cycle of contention and resolution frames. Each node follows a tree-traversal algorithm to determine the order of transmission among all contending nodes. The contention process continues until all contending nodes have transmitted their frames.
机译:一种使用正交频分复用的局域网自适应基于树的竞争解决媒体访问控制协议。本发明使用频点中的恒定音调来解决多个发射节点之间的竞争。所有节点均被同步以传输“竞争音”。在“争用框架”中。每个节点都分配有一个唯一的标识(ID)编号,此ID号通过在与节点ID号的二进制表示形式中的每个1位相对应的每个频段中传输一个音调而映射到频率频段。多个节点各自在争用帧期间发送其唯一ID的结果是每个参与节点解码的复数频率信号。然后,节点参与“解析框架”。其中所有节点再次在频点中传输音频。分辨率帧音调仅对应于其中竞争帧的结果指示存在音调的音调,其中该节点具有0值的ID位。所有节点均接收分辨率帧的结果,并将结果(“分辨率位”)记录在合理平衡的二叉树中。如果分辨率帧在任何频率仓中都不包含音调,则仅一个节点在竞争并且可以发送。否则,竞争节点将利用解析位继续竞争和解析帧的另一个周期。每个节点都遵循树遍历算法,以确定所有竞争节点之间的传输顺序。竞争过程将继续进行,直到所有竞争节点都发送了自己的帧。

著录项

  • 公开/公告号US6222851B1

    专利类型

  • 公开/公告日2001-04-24

    原文格式PDF

  • 申请/专利权人 3COM CORPORATION;

    申请/专利号US19980087624

  • 发明设计人 BRIAN DAVID PETRY;

    申请日1998-05-29

  • 分类号H04L124/13;

  • 国家 US

  • 入库时间 2022-08-22 01:04:28

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号