会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 6. 发明申请
    • METHOD FOR TREE-BASED SPATIAL TIME DIVISION MULTIPLE ACCESS (TDMA) SCHEDULING IN A MULTI-HOP WIRELESS NETWORK
    • 一种多跳无线网络中基于树的空间时分多址(TDMA)调度方法
    • WO2007070783A3
    • 2007-12-06
    • PCT/US2006061898
    • 2006-12-12
    • MOTOROLA INCZHENG HEYUNZENG SURONG
    • ZHENG HEYUNZENG SURONG
    • H04B7/212
    • H04W74/04H04W74/002H04W84/18
    • A method for tree based spatial TDMA scheduling in a multi-hop wireless network (100). A time slot is requested (101) for non-use by a requesting node to all neighboring nodes. Similarly, the requested time slot is next requested (103) for non-use from the requesting node to its parent nodes. If available, a time slot assignment is then requested (109) from the requesting node to its parent node where the time slot assignment is requested (111) from the parent node to the grandparent node of the requesting node. Finally, all neighboring nodes are then informed (117, 119, 121) if both the grandparent node and parent node grant the time slot request to the requesting node. The invention works to reduce packet collisions by providing link-slot formulation in combination with link direction to compensate for spatial reuse loss in a local optimization setting.
    • 一种用于多跳无线网络中的基于树的空间TDMA调度的方法(100)。 请求(101)时隙以供请求节点不用于所有相邻节点。 类似地,接下来从请求节点向其父节点请求(103)未请求的请求时隙。 如果可用,则从请求节点向其父节点请求(109)时隙分配,其中从父节点向请求节点的祖父节点请求(111)时隙分配。 最后,如果祖父节点和父节点都向请求节点授予时隙请求,则通知所有相邻节点(117,119,121)。 本发明通过结合链路方向提供链路时隙公式来减少分组冲突,以补偿局部优化设置中的空间重用损耗。
    • 7. 发明申请
    • METHOD AND DEVICE FOR TRANSMITTING GROUPCAST DATA IN A WIRELESS MESH COMMUNICATION NETWORK
    • 在无线网状通信网络中传输组数据的方法和装置
    • WO2009085717A2
    • 2009-07-09
    • PCT/US2008086909
    • 2008-12-16
    • MOTOROLA INCBARKER CHARLES RKORUS MICHAEL FSHATIL OHADZHENG HEYUN
    • BARKER CHARLES RKORUS MICHAEL FSHATIL OHADZHENG HEYUN
    • H04L29/06H04L12/22
    • H04L63/065H04W12/04H04W12/06
    • A method for transmitting groupcast data in a wireless mesh communication network as provided improves security of groupcast data. The method comprises processing, at a supplicant node, authentication handshake data received from an authenticator node, wherein the supplicant node is a next-hop neighbor of the authenticator node away from a root node. The supplicant node then stores a group transient key (GTK) received from the authenticator node. Next, the supplicant node processes authentication handshake data received from a third node, wherein the third node is a next-hop neighbor of the supplicant node away from the root node. The GTK is then transmitted from the supplicant node to the third node. Encrypted groupcast data are then generated at the supplicant node by using the GTK to encrypt groupcast data received from the authenticator node. Finally, the encrypted groupcast data are transmitted from the supplicant node to the third node.
    • 在所提供的无线网状通信网络中传输组播数据的方法提高了组播数据的安全性。 该方法包括在请求者节点处处理从认证器节点接收到的认证握手数据,其中该请求者节点是远离根节点的认证器节点的下一跳邻居。 请求方节点然后存储从认证方节点接收到的组临时密钥(GTK)。 接下来,请求者节点处理从第三节点接收的认证握手数据,其中第三节点是远离根节点的请求者节点的下一跳邻居。 GTK然后从请求方节点传输到第三个节点。 然后通过使用GTK来加密从认证器节点接收到的组播数据,在请求者节点处生成加密的组播数据。 最后,加密的组播数据从请求方节点传送到第三节点。
    • 8. 发明申请
    • A MULTICAST ARCHITECTURE FOR WIRELESS MESH NETWORKS
    • 无线网路的多媒体架构
    • WO2006074022A3
    • 2006-12-14
    • PCT/US2005047321
    • 2005-12-28
    • MESHNETWORKS INCZENG SURONGZHENG HEYUN
    • ZENG SURONGZHENG HEYUN
    • H04J3/24H04B7/216H04J1/00H04J3/00H04J3/26H04L12/28H04L12/56H04L12/66H04W4/06H04W40/02H04W60/00
    • H04W4/06H04L12/185H04L12/189H04L45/00H04L45/16H04W4/08H04W40/02H04W60/00
    • The proposed multicast architecture for multi-hop wireless mesh networks enables the mesh networks to join the global multicast group seamlessly, and extend the multicast support to any routable or non-routable devices in the wireless mesh networks. A communications network comprising a plurality of wireless devices (WRD), at least one Internet access point (LAP), and at least one Internet edge router. The Internet access point acts as a proxy device for wireless devices that are using the Internet access point to access a global Internet, wherein the Internet access point runs a group management protocol with a Internet edge router to register multicast groups for devices associated with the Internet access point (220), and wherein the Internet edge router runs a wired multicast routing protocol to join the Internet edge router to a global Internet multicast group (210).
    • 所提出的用于多跳无线网状网络的多播架构使得网状网络能够无缝地加入全局多播组,并且将组播支持扩展到无线网状网络中的任何可路由或不可路由的设备。 一种包括多个无线设备(WRD),至少一个因特网接入点(LAP)和至少一个因特网边缘路由器的通信网络。 互联网接入点充当用于使用因特网接入点访问全球互联网的无线设备的代理设备,其中因特网接入点与互联网边缘路由器一起运行组管理协议,以注册与因特网相关联的设备的多播组 接入点(220),并且其中所述因特网边缘路由器运行有线多播路由协议以将所述因特网边缘路由器加入到全球因特网组播组(210)。
    • 9. 发明申请
    • A METHOD TO SUPPORT MULTICAST ROUTING IN MULTI-HOP WIRELESS NETWORKS
    • 支持多路无线网络中的多播路由的方法
    • WO2006121630A3
    • 2007-12-13
    • PCT/US2006016049
    • 2006-04-27
    • MESHNETWORKS INCZENG SURONGZHENG HEYUN
    • ZENG SURONGZHENG HEYUN
    • H04H20/00
    • H04W40/28H04L12/189H04L45/16H04W84/18
    • A system and method for supporting multicast in highly dynamic wireless multi-hop networks, such as ad-hoc networks, with good scalability. The system and method provide a multicast routing algorithm to work in wireless ad-hoc networks without any fixed infrastructure nodes present. In doing so, the system and method provide a technique to build a multicast source specific tree on demand, while using a core source node to limit routing overhead. The system and method further provide a repair process to reduce the latency of discovery of topology change, employ a node sequence number mechanism to differentiate between upstream nodes and downstream nodes on the multicast tree in the repair process, and provide an active joining process to reduce the latency of discovery of membership change.
    • 一种用于在高度动态的无线多跳网络(如ad-hoc网络)中支持多播的系统和方法,具有良好的可扩展性。 该系统和方法提供了组播路由算法,在无任何固定的基础设施节点存在的无线自组织网络中工作。 在这样做时,系统和方法提供了一种根据需要构建组播源特定树的技术,同时使用核心源节点来限制路由开销。 该系统和方法进一步提供修复过程以减少发现拓扑变化的延迟,采用节点序列机制来区分维修过程中多播树上的上游节点和下游节点,并提供主动加入过程以减少 发现会员变更的延迟。
    • 10. 发明申请
    • METHOD FOR CHANNEL SELECTION IN A MULTI-HOP WIRELESS MESH NETWORK
    • 一种多跳无线Mesh网络中信道选择的方法
    • WO2010014318A2
    • 2010-02-04
    • PCT/US2009048561
    • 2009-06-25
    • MOTOROLA INCCHU YUECHUNZHENG HEYUN
    • CHU YUECHUNZHENG HEYUN
    • H04B7/14H04B15/00H04W84/00
    • H04W72/082H04W84/18
    • Disclosed are methods including a new optimization criterion, Maximum Mesh Coverage (MMC) for a channel selection process during the formation of ad hoc networks. By using MMC, the intelligent access point (IAP) will select a channel to connect as many mesh nodes as possible in addition to meeting the interference minimization requirement. During mesh formation, the channel interference information for a node is first scanned by the node and then broadcast in its available channels. An iteration procedure for meshing network formation allows the IAP to gradually obtain the global channel interference information and broadcast the same so that a maximum number of n-hop nodes communicate on the same frequency channel. If a channel change is required to accommodate the channel interference status of candidate nodes, a channel change message will be broadcast to better achieve the large coverage advantage of a multi-hop configuration.
    • 公开了包括新的优化准则,用于在ad hoc网络的形成期间的信道选择过程的最大网格覆盖(MMC)的方法。 通过使用MMC,除满足干扰最小化要求外,智能接入点(IAP)还将选择一个通道来连接尽可能多的网格节点。 在网格形成期间,节点的信道干扰信息首先被节点扫描,然后在其可用信道中广播。 用于网格形成的迭代过程允许IAP逐渐获得全局信道干扰信息并进行广播,以使最大数量的n跳节点在同一频率信道上通信。 如果需要改变信道以适应候选节点的信道干扰状态,则将广播信道改变消息以更好地实现多跳配置的大覆盖优势。