首页> 外国专利> METHOD FOR TRANSMITTING DATA PACKETS IN A TIME-SLOT-BASED MANNER IN A WIRELESS MESHED NETWORK

METHOD FOR TRANSMITTING DATA PACKETS IN A TIME-SLOT-BASED MANNER IN A WIRELESS MESHED NETWORK

机译:无线网状网络中基于时隙方式传输数据分组的方法

摘要

The invention relates to a method for transmitting data packets in a time-slot-based manner in a wireless meshed network having a multiplicity of nodes (1, 2,..., 5). In the method according to the invention, one or more graphs (G, G´) with respective graph identities (GI, GI´) are formed, in a step a), for data packets to be transmitted in the network. In this case, the graphs (G, G´) specify possible transmission paths for data packets to a destination node via wireless data links (L1, L2,..., L7) between adjacent nodes, wherein each data packet contains a corresponding graph identity (GI, GI´) on the basis of the destination node for the packet. In a step b) of the method, one or more time slots are reserved in one or more radio channels in cyclically repeated time frames (F), each of which time slots has an associated node (1, 2,..., 5) with an associated data link (L1, L2,..., L7) between said node and another node. In a step c), when or before a time slot (S0, S1,..., S19) occurs, the node (1, 2,..., 5) associated with the time slot looks for a data packet which should be transmitted by said node and the graph identity (GI, GI´) of which corresponds to a graph (G, G´) comprising the data link (L1, L2,..., L7) associated with the node. In this case, the method is distinguished by the fact that the data links (L1, L2,..., L7) associated with nodes (1, 2,..., 5) at least partially each have one or more associated graph identities (GI, GI´) and data transmission takes place in the corresponding time slot only when a data packet found in step c) contains a graph identity corresponding to a graph identity (GI, GI´) of the associated data link (L1, L2,..., L7).
机译:本发明涉及一种用于在具有多个节点(1、2,...,5)的无线网状网络中以基于时隙的方式传输数据分组的方法。在根据本发明的方法中,在步骤a)中形成具有相应的图形标识(GI,GI’)的一个或多个图形(G,G’),用于在网络中传输的数据分组。在这种情况下,图(G,G´)指定数据包通过相邻节点之间的无线数据链路(L1,L2,...,L7)到目标节点的可能传输路径,其中每个数据包都包含一个对应的图标识(GI,GI´)基于数据包的目标节点。在该方法的步骤b)中,在循环重复的时间帧(F)中的一个或多个无线电信道中保留一个或多个时隙,每个时隙具有关联的节点(1、2,...,5) ),并在该节点和另一个节点之间建立关联的数据链路(L1,L2,...,L7)。在步骤c)中,当时隙(S0,S1,...,S19)出现时或之前,与该时隙相关的节点(1、2,...,5)寻找一个数据包,该数据包应由所述节点发送该消息,并且其图形标识(GI,GI’)对应于包括与该节点相关联的数据链路(L1,L2,...,L7)的图形(G,G’)。在这种情况下,该方法的特征在于,与节点(1、2,...,5)相关联的数据链路(L1,L2,...,L7)至少部分地具有一个或多个相关图只有在步骤c)中找到的数据包包含与关联数据链路的图形标识(GI,GI´)相对应的图形标识时,才在相应的时隙中进行标识(GI,GI´)和数据传输。 L2,...,L7)。

著录项

  • 公开/公告号WO2012019942A1

    专利类型

  • 公开/公告日2012-02-16

    原文格式PDF

  • 申请/专利权人 SIEMENS AKTIENGESELLSCHAFT;HEINRICH ANDREAS;

    申请/专利号WO2011EP63279

  • 发明设计人 HEINRICH ANDREAS;

    申请日2011-08-02

  • 分类号H04L12/24;H04L12/56;H04W84/18;

  • 国家 WO

  • 入库时间 2022-08-21 17:17:45

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号