利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

13 条记录 (耗时 0.014 秒)

    METHOD OF BROADCASTING PACKETS IN AD-HOC NETWORK
    3.
    发明公开
    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.

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

    AN INTER-LOCAL PEER GROUP (LPG) ROUTING METHOD
    6.
    发明公开
    AN INTER-LOCAL PEER GROUP (LPG) ROUTING METHOD 审中-公开
    路由进程之间的本地同级组（LPG）

    公开(公告)号：EP2281368A1

    公开(公告)日：2011-02-09

    申请号：EP09747263.3

    申请日：2009-05-11

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

    发明人： CHEN, Wai ,  PANG, Marcus ,  KWON, Taek, Jin ,  ONISHI, Ryokichi ,  HIKITA, Toshiro

    IPC分类号： H04L12/56

    CPC分类号： H04W40/28 ,  H04L45/04 ,  H04L45/46 ,  H04W40/32 ,  H04W84/005 ,  H04W88/04

    摘要： An on-demand method of routing data between a plurality of local peer groups (LPG). Each LPG includes a plurality of moving nodes. The method comprises transmitting a route request message from a source node, relaying the route request message to a native boundary node; forwarding the route request message to a foreign boundary node, determining if the destination node is within an LPG for the foreign boundary node; relaying the route request message to another boundary node if the destination node is not within the LPG, relaying the route request message to the destination node if the destination node is within the LPG, receiving the routing request message at the destination node, transmitting a routing response to the source node, relaying the routing response to the source node through a path discovered by the route request, receiving the routing response at the source node, and transmitting the data.

    ARCHITECTURE, METHOD, AND PROGRAM FOR GENERATING REALISTIC VEHICULAR MOBILITY PATTERNS
    7.
    发明公开
    ARCHITECTURE, METHOD, AND PROGRAM FOR GENERATING REALISTIC VEHICULAR MOBILITY PATTERNS 审中-公开
    架构，方法和程序创建真实的车辆运动PATTERN

    公开(公告)号：EP2619709A1

    公开(公告)日：2013-07-31

    申请号：EP11827158.4

    申请日：2011-08-17

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

    发明人： PANG, Marcus ,  CHEN, Wai ,  CHENNIKARA-VARGHESE, Jasmine ,  GUHA, Ratul ,  LEE, John ,  VUYYURU, Rama ,  FUKUYAMA, Junichiro

    IPC分类号： G06G7/48

    CPC分类号： G09B9/02

    摘要： A method, simulator and program for simulating vehicular movement based upon user input parameters related to simulation topology and simulation vehicles including, but not limited to linear vehicular density. The simulator generates the simulation topology having a simulation area using the user input parameters, places a plurality of simulation vehicles within the simulation area at an initial placement using at least two input parameters related to simulation vehicle and the generated simulation topology; and determines movement of the plurality of simulation vehicles starting with the initial placement using a plurality of movement models. Each of the plurality of simulation vehicles has mobility characteristics generated using the plurality of movement models. When vehicle moves outside the simulation area, the vehicle re-emerges at a location within the simulation area. The vehicle re-emerges with new movement characteristics.

    DISTRIBUTED REUEST ROUTING
    9.
    发明公开
    DISTRIBUTED REUEST ROUTING 有权
    分布式REUEST路由

    公开(公告)号：EP1782231A2

    公开(公告)日：2007-05-09

    申请号：EP05729897.8

    申请日：2005-03-24

    申请人： Telcordia Technologies, Inc. ,  Toyota Infotechnology Center Co., Ltd.

    发明人： CHEN, Chung-Min ,  CHEN, Wai ,  LING, Yibei ,  PANG, Marcus ,  CAI, Shengwei

    IPC分类号： G06F15/16

    CPC分类号： H04L47/10 ,  H04L47/125

    摘要： A plurality of servers (802, 204, 202, 203) for processing client (210) requests (220, 222, 810) forward the requests (220, 222, 810) among themselves to achieve a balanced load. When a server (802, 204, 202, 203) initially receives a client request (220, 222, 810), it randomly selects another of the plurality of servers (802, 204, 202, 203), referred to as a first-chance server, and forwards the request (220, 222, 810) to this server. Upon receiving the request, the first-chance server determines if it is overloaded and if not, process the request. However, if overloaded, the first-chance server compares its load to the load of one or more predetermined next-neighbor servers. If the next-neighbor server(s) are more loaded than the first-chance server, the first-chance server processes the request. Otherwise, the first-chance server forwards the request to the least loaded next-neighbor server. The next-neighbor receiving the request either processes it directly, or alternatively, based on its current load and that of its next-neighbor server(s), forwards the reques to another next-neighbor server for processing.