利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

23 条记录 (耗时 0.018 秒)

    OPEN COMMUNICATION METHOD IN A HETEROGENEOUS NETWORK
    1.
    发明公开
    OPEN COMMUNICATION METHOD IN A HETEROGENEOUS NETWORK 有权
    在EINEM HETEROGENEN NETZWERK中的KOMMUNIKATIONSVERFAHREN

    公开(公告)号：EP2769308A1

    公开(公告)日：2014-08-27

    申请号：EP12842183.1

    申请日：2012-04-11

    申请人： Telcordia Technologies, Inc. ,  Toyota InfoTechnology Center U.S.A., Inc.

    发明人： CHEN, Wai ,  GUHA, Ratul ,  LEE, John ,  FUKUYAMA, Junichiro ,  VUYYURU, Rama

    IPC分类号： G06F15/16

    CPC分类号： H04W40/06 ,  H04L45/02 ,  H04L45/741 ,  H04L45/745 ,  H04L49/355 ,  H04L67/12 ,  H04L67/327 ,  H04L69/22 ,  H04W4/025 ,  H04W4/06 ,  H04W4/90 ,  H04W88/04

    摘要： An open communication method between at least two sub-networks of different routable network addressing schemes comprises receiving a packet for a specific application, the packet including an application identifier, determining if the packet is to be relayed to another of the at least two sub-network based upon the application identifier; determining if a node receiving the packet is a broker node, relaying the packet to a broker node if not a broker node, forwarding, by the broker node, the packet to at least one node in another of the at least two sub-networks, broadcasting a status packet from a broker node to each sub-network that the broker node is configured to communicate, receiving the status packet from the broker node, and updating a broker table using information from the status packet, wherein only a broker node updates the broker table.

    摘要翻译： 使用代理节点的至少两个子网络之间的开放通信方法。 每个子网络具有不同的可路由网络寻址方案。 该方法包括接收特定应用的分组，分组包括应用标识符，基于应用标识确定分组是否要被中继到至少两个子网络中的另一个，确定接收分组的节点是否是 代理节点，如果不是代理节点，则将分组中继到代理节点，并且由代理节点将分组转发到至少两个子网络中的另一个中的至少一个节点。 生成分组的节点使用所述至少两个子网中的第一个进行通信。 代理节点通过用于每个子网络的相应的可路由网络寻址方案，使用至少两个子网络中的至少两个进行通信。

    METHODS FOR OPTIMAL MULTI-CHANNEL ASSIGNMENTS IN VEHICULAR AD-HOC NETWORKS
    2.
    发明公开
    METHODS FOR OPTIMAL MULTI-CHANNEL ASSIGNMENTS IN VEHICULAR AD-HOC NETWORKS 审中-公开
    的程序对车辆Ad hoc网络最好的多通道分配

    公开(公告)号：EP2156614A1

    公开(公告)日：2010-02-24

    申请号：EP07853117.5

    申请日：2007-11-13

    申请人： Telcordia Technologies, Inc. ,  Toyota InfoTechnology Center, U.S.A. Inc.

    发明人： LUSS, Hanan ,  CHEN, Wai ,  HIKITA, Toshiro ,  ONISHI, Ryokichi

    IPC分类号： H04L12/28

    CPC分类号： H04W40/04 ,  H04L45/128 ,  H04W72/04 ,  H04W76/10 ,  H04W84/18

    摘要： A communications path is established among an ordered sequence of moving nodes, representing vehicles. Available channels may differ from one node to the next node and a node cannot use the same channel for both receiving and transmitting information. Three methods are described that provide an optimal sequence of channel assignments between the nodes. A sequence of channel assignments is called optimal if it establishes a communications path from the first node in the sequence to the last node in the sequence, or, if such a path does not exist, from the first node to the farthest node possible in the sequence. The first method uses a depth-first search starting from the first node in the sequence. The second method uses a “look ahead” scheme in the depth-first search method. The third method requires only a single pass through the sequence of nodes by identifying optimal channel assignments in subsequences of nodes without a need for backtracking.

    METHOD AND COMMUNICATION DEVICE FOR ROUTING UNICAST AND MULTICAST MESSAGES IN AN AD-HOC WIRELESS NETWORK
    3.
    发明公开
    METHOD AND COMMUNICATION DEVICE FOR ROUTING UNICAST AND MULTICAST MESSAGES IN AN AD-HOC WIRELESS NETWORK 审中-公开
    METHOD AND APPARATUS FOR单播和多播消息的通信路由作为无线自组织网络

    公开(公告)号：EP2077043A1

    公开(公告)日：2009-07-08

    申请号：EP07717042.1

    申请日：2007-01-26

    申请人： Telcordia Technologies, Inc. ,  Toyota Infotechnology Center U.S.A. Inc.

    发明人： LEE, John ,  KWON, Taek-Jin ,  ONISHI, Ryokichi ,  HIKITA, Toshiro ,  CHEN, Wai

    IPC分类号： H04Q7/24

    CPC分类号： H04W84/18 ,  H04L45/16 ,  H04W40/24 ,  H04W40/32 ,  H04W84/005

    摘要： A method and communication device for routing unicast and multicast messages. The method for routing a unicast message includes receiving a first control packet including routing parameters from a group header node, updating a routing table based upon the routing parameters, receiving a second control packet including additional routing parameters from a group node, updating the routing table based upon the additional routing parameters and generating a forwarding table from the routing table when both of the updated steps are completed. The unicast message is routed based upon the forwarding table. A method for routing a multicast message comprises receiving the multicast message, determining if a multicast group destination for the multicast message is in a multicast forwarding table (MFT), determining if the multicast message has been previously forwarded and forwarding the multicast message if the message was not previously forwarded and the multicast group destination is in the MFT.

    METHOD OF BROADCASTING PACKETS IN AD-HOC NETWORK
    9.
    发明公开
    METHOD OF BROADCASTING PACKETS IN AD-HOC NETWORK 有权
    在AD-HOC网络中广播分组的方法

    公开(公告)号：EP2215780A1

    公开(公告)日：2010-08-11

    申请号：EP08849395.2

    申请日：2008-11-12

    申请人： Telcordia Technologies, Inc. ,  Toyota InfoTechnology Center, U.S.A. Inc.

    发明人： CHEN, Wai ,  DEMERS, Stephanie ,  LEE, John ,  PANG, Marcus ,  ONISHI, Ryokichi ,  HIKITA, Toshiro

    IPC分类号： H04L12/28

    CPC分类号： H04H20/08 ,  H04H20/57 ,  H04H60/50 ,  H04H60/53 ,  H04L12/1868 ,  H04L12/189 ,  H04L45/16 ,  H04W40/20

    摘要： A method for distributing a packet to a plurality of moving nodes comprising receiving a packet containing at least a message, a sender identifier, a location of a sender, an identifier for a relay node and distance from the sender and the relay node, determining if a node receiving the packet is the relay node and immediately distributing the packet to a plurality of moving nodes if the receiving node is the relay node. If the receiving node is not the relay node, the method further comprises steps of waiting a set period of time, determining if a packet is received from a different sender containing the same message, within the period of time and distributing the packet to a plurality of moving nodes if a packet containing the same message is not received within the period of time. The distributed packet includes an identifier for a successive relay node.

    摘要翻译： 一种用于将分组分发到多个移动节点的方法，包括：接收包含至少一个消息，发送者标识符，发送者的位置，中继节点的标识符以及距发送者和中继节点的距离的分组;确定是否 接收分组的节点是中继节点，并且如果接收节点是中继节点，则立即将分组分发到多个移动节点。 如果接收节点不是中继节点，则该方法进一步包括以下步骤：等待设定的时间段，在该时间段内确定是否从包含相同消息的不同发送方接收到分组并将分组分发给多个 如果在一段时间内没有接收到包含相同消息的分组，则移动节点。 分布式分组包括用于连续中继节点的标识符。