专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

WO2008136809A1 METHODS FOR OPTIMAL MULTI-CHANNEL ASSIGNMENTS IN VEHICULAR AD-HOC NETWORKS 审中-公开
标题翻译：车辆多通道网络中最佳多通道分配方法
公开(公告)号：WO2008136809A1
公开(公告)日：2008-11-13
申请号：PCT/US2007/023852
申请日：2007-11-13
申请人： TELCORDIA TECHNOLOGIES, INC. , TOYOTA INFOTECHNOLOGY CENTER, U.S.A., INC. , LUSS, Hanan , CHEN, Wai , HIKITA, Toshiro , ONISHI, Ryokichi
发明人： 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.
摘要翻译：在代表车辆的移动节点的有序序列之间建立通信路径。可用的信道可能因一个节点到下一个节点而不同，并且节点不能对接收和发送信息使用相同的信道。描述了提供节点之间的最佳信道分配顺序的三种方法。如果信道分配的序列建立了从序列中的第一个节点到序列中的最后一个节点的通信路径，或者如果这样的路径不存在，则从第一节点到最远节点可能的序列。第一种方法使用从序列中的第一个节点开始的深度优先搜索。第二种方法在深度优先搜索方法中使用“前瞻”方案。第三种方法只需要通过节点序列中的最佳信道分配，而不需要回溯，就可以顺利通过节点序列。

2. 发明申请

WO2008051263A1 METHOD AND COMMUNICATION DEVICE FOR ROUTING UNICAST AND MULTICAST MESSAGES IN AN AD-HOC WIRELESS NETWORK 审中-公开
标题翻译：用于在非线性无线网络中路由排队和多播消息的方法和通信设备
公开(公告)号：WO2008051263A1
公开(公告)日：2008-05-02
申请号：PCT/US2007/002125
申请日：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.
摘要翻译：一种用于路由单播和多播消息的方法和通信设备。用于路由单播消息的方法包括从组头节点接收包括路由参数的第一控制分组，基于路由参数更新路由表，从组节点接收包括附加路由参数的第二控制分组，更新路由表基于附加路由参数，并且当两个更新的步骤都完成时，从路由表生成转发表。基于转发表路由单播消息。一种用于路由多播消息的方法包括接收多播消息，确定多播消息的组播组目的地是否在组播转发表（MFT）中，确定多播消息是否已经被转发，并且如果消息以前没有转发，组播组目的地处于MFT中。

3. 发明申请

WO2008051264A1 A ROADSIDE NETWORK UNIT USING LOCAL PEER GROUPS AS NETWORK GROUPS 审中-公开
标题翻译：使用本地对等体组作为网络组的道路网络单元
公开(公告)号：WO2008051264A1
公开(公告)日：2008-05-02
申请号：PCT/US2007/002279
申请日：2007-01-26
申请人： TELCORDIA TECHNOLOGIES, INC. , TOYOTA INFOTECHNOLOGY CENTER, U.S.A., INC.
发明人： PANG, Marcus , CHENNIKARA-VARGHESE, Jasmine , LEE, John , HIKITA, Toshiro , CHEN, Wai , ONISHI, Ryokichi , KWON, Taek-Jin
IPC分类号： G06F15/173 , H04Q7/00
CPC分类号： H04B7/2606 , H04W40/32 , H04W84/22
摘要： An ad-hoc wireless network with a roadside network unit (RSU) and a local peer group (LPG). The LPG is formed from a plurality of moving vehicles. The LPG includes a group header node (GH) for managing the LPG. The GH is elected from one of the moving vehicles. The LPG further includes group nodes (GN) designated from the remaining moving vehicles in a given area. Each of the moving vehicles, whether the GH or the GN, communicates with other using routing paths created based upon a first control packet broadcast from the GH and a second control packet broadcast from each of the GN. Each moving vehicle communicates with the RSU using a routing paths created based upon a beacon broadcast by the RSU and a reply signal from each of the moving vehicles. The RSU can also be a member of the LPG and act as GN or GH.
摘要翻译：具有路边网络单元（RSU）和本地对等组（LPG）的自组织无线网络。 LPG由多个移动车辆形成。 LPG包括用于管理LPG的组头节点（GH）。 GH从其中一个移动车辆中选出。 LPG还包括从给定区域中的其余移动车辆指定的组节点（GN）。每个移动的车辆，无论是GH还是GN，都与基于从GH广播的第一控制分组创建的其他使用路由路径和从每个GN广播的第二控制分组进行通信。每个移动车辆使用基于由RSU广播的信标创建的路由路径和来自每个移动车辆的回复信号与RSU通信。 RSU也可以是液化石油气的成员，作为GN或GH。

4. 发明申请

WO2009140180A1 METHODS FOR EFFICIENT ORGANIZATION OF VEHICLE PEER GROUPS AND EFFICIENT V2R COMMUNICATIONS 审中-公开
标题翻译：有效组织机动车组和高效V2R通信的方法
公开(公告)号：WO2009140180A1
公开(公告)日：2009-11-19
申请号：PCT/US2009/043406
申请日：2009-05-11
申请人： TELCORDIA TECHNOLOGIES, INC. , TOYOTA INFOTECHNOLOGY CENTER, U.S.A., INC. , CHEN, Wai , KWON, Taek, Jin , LEE, John , ONISHI, Ryokichi , HIKITA, Toshiro
发明人： CHEN, Wai , KWON, Taek, Jin , LEE, John , ONISHI, Ryokichi , HIKITA, Toshiro
IPC分类号： H04B7/005
CPC分类号： H04W40/30 , H04L45/00 , H04L45/20 , H04L45/48 , H04W40/246
摘要： The present invention provides methods for efficient control message distribution in a VANET. Efficient flooding mechanisms are provided to fulfill the objective of flooding (delivering a message to every connected node) with a limited number of re-broadcasting by selected key nodes. A suppression-based efficient flooding mechanism utilizes a Light Suppression (LS) technique to reduce the number of flooding relays by giving up the broadcasting of a flooding message when a node observes downstream relay of the same flooding message. Additionally, a relay-node based efficient flooding mechanism selects Relay Nodes (RN) to form an efficient flooding tree for control message delivery. RNs are nodes that relay at least one control message, for instance a Membership Report (MR) to the upstream node in "k" previous control message cycles. The upstream node may be the group header (GH) for the LPG.
摘要翻译：本发明提供了用于在VANET中有效控制消息分发的方法。提供了有效的洪泛机制，以通过所选择的关键节点进行有限数量的重新播放来实现洪水（向每个连接的节点传递消息）的目标。基于抑制的有效洪泛机制利用光抑制（LS）技术通过在节点观察相同洪泛信息的下游中继时放弃广播消息来减少洪泛中继的数量。另外，基于中继节点的有效洪泛机制选择中继节点（RN）以形成用于控制消息传递的有效洪泛树。 RN是在“k”个先前的控制消息周期中至少一个控制消息（例如，成员资格报告（MR））到上游节点的节点。上游节点可以是LPG的组头（GH）。

5. 发明申请

WO2009102841A1 METHODS FOR RELIABLE MULTICASTING IN LOCAL PEER GROUP (LPG) BASED VEHICLE AD HOC NETWORKS 审中-公开
标题翻译：本地同业集团（LPG）基于汽车网络的可靠组合方法
公开(公告)号：WO2009102841A1
公开(公告)日：2009-08-20
申请号：PCT/US2009/033879
申请日：2009-02-12
申请人： TELCORDIA TECHNOLOGIES, INC. , TOYOTA INFOTECHNOLOGY CENTER, U.S.A., INC. , CHEN, Wai , LEE, John , ONISHI, Ryokichi , HIKITA, Toshiro
发明人： CHEN, Wai , LEE, John , ONISHI, Ryokichi , HIKITA, Toshiro
IPC分类号： G06F15/173
CPC分类号： H04L45/00 , H04L12/189 , H04L45/16 , H04W40/02
摘要： A method for routing a multicast message comprising the steps of receiving a multicast message including at least a message, a source identifier, a sequence number, a time-to- live value and a multicast group destination, determining if the multicast group destination is in a multicast forwarding table, determining if the message has been previously received, adding the multicast message to the multicast forwarding table if it is determined that the multicast message has not been previously received, determining if a node that received the multicast message is a forwarding node; randomly setting a wait time for forwarding the multicast message; and forwarding the multicast message at the expiration of the wait time.
摘要翻译：一种用于路由多播消息的方法，包括以下步骤：接收包括至少消息，源标识符，序列号，时间到达值和多播组目的地的多播消息，确定多播组目的地是否在组播转发表，确定是否先前已经接收到消息，如果确定多播消息未被先前接收到，则将多播消息添加到组播转发表中，确定接收到多播消息的节点是否是转发节点 ; 随机设置转发多播消息的等待时间; 并在等待时间到期时转发组播消息。

6. 发明申请

WO2009140179A1 AN INTER-LOCAL PEER GROUP (LPG) ROUTING METHOD 审中-公开
标题翻译：本地对等体组（LPG）路由方法
公开(公告)号：WO2009140179A1
公开(公告)日：2009-11-19
申请号：PCT/US2009/043403
申请日：2009-05-11
申请人： TELCORDIA TECHNOLOGIES, INC. , TOYOTA INFOTECHNOLOGY CENTER, U.S.A. INC. , CHEN, Wai , PANG, Marcus , KWON, Taek, Jin , ONISHI, Ryokichi , HIKITA, Toshiro
发明人： 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.
摘要翻译：在多个本地对等体组（LPG）之间路由数据的按需方法。每个LPG包括多个移动节点。该方法包括从源节点发送路由请求消息，将路由请求消息中继到本地边界节点; 将所述路由请求消息转发到外部边界节点，确定所述目的地节点是否在所述外部边界节点的LPG内; 如果目的地节点不在LPG内，则将路由请求消息中继到另一边界节点，如果目的地节点在LPG内，则将路由请求消息中继到目的节点，在目的地节点处接收路由请求消息，发送路由响应于源节点，通过路由请求发现的路径将路由响应中继到源节点，在源节点处接收路由响应，并发送数据。

7. 发明申请

WO2006076349A2 METHOD TO ESTABLISH AND ORGANIZE AN AD-HOC WIRELESS PEER TO PEER NETWORK 审中-公开
标题翻译：建立和组织无线对等体到对等网络的方法
公开(公告)号：WO2006076349A2
公开(公告)日：2006-07-20
申请号：PCT/US2006/000800
申请日：2006-01-11
申请人： TELCORDIA TECHNOLOGIES, INC. , TOYOTA INFOTECHNOLOGY CENTER CO., LTD. , CAI, Shengwei , CHEN, Wai , CHENNIKARA-VAGHESE, Jasmine , LEE, John , HIKITA, Toshiro , PANG, Marcus
发明人： CAI, Shengwei , CHEN, Wai , CHENNIKARA-VAGHESE, Jasmine , LEE, John , HIKITA, Toshiro , PANG, Marcus
IPC分类号： H04Q7/00
CPC分类号： H04W84/18 , G08G1/161 , H04L29/12009 , H04L29/12216 , H04L29/12801 , H04L61/2007 , H04L61/6004 , H04W4/08 , H04W8/26 , H04W64/00 , H04W92/18
摘要： A method for organizing and maintaining an ad-hoc network for communication between a plurality of moving devices is disclosed. The method comprises the steps of grouping the plurality of moving devices into at least one local peer group (LPG) , ordering the plurality of devices within each LPG based upon a relative position of each of the plurality of devices within each LPG and assigning a unique identifier for each of the plurality of moving devices, where the unique identifier is based, in part on the LPG that the corresponding moving device is located.
摘要翻译：公开了一种用于组织和维护用于多个移动设备之间的通信的自组织网络的方法。该方法包括以下步骤：将多个移动设备分组成至少一个本地对等体组（LPG），基于每个LPG内的多个设备中的每一个的相对位置对每个LPG内的多个设备进行排序，在唯一标识符所基于的多个移动设备中的每一个的标识符部分地在相应移动设备所在的LPG上。

8. 发明申请

WO2009064740A1 METHOD OF BROADCASTING PACKETS IN AD-HOC NETWORK 审中-公开
标题翻译：广播网络中广播包的方法
公开(公告)号：WO2009064740A1
公开(公告)日：2009-05-22
申请号：PCT/US2008/083150
申请日：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
发明人： 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.
摘要翻译：一种用于将分组分发到多个移动节点的方法，包括：接收包含至少一个消息的包，发送方标识符，发送者的位置，中继节点的标识符和距发件人和中继节点的距离，确定是否如果接收节点是中继节点，则接收分组的节点是中继节点，并且立即将分组分发到多个移动节点。如果接收节点不是中继节点，则该方法还包括在一段时间内等待设定的时间段，确定是否从包含相同消息的不同发送方接收到分组的步骤，并将分组分发到多个如果在一段时间内没有收到包含相同消息的数据包，则移动节点。分布式分组包括用于连续中继节点的标识符。

9. 发明申请

WO2007061577A2 LINKED EQUIVALENT CELL HEADER-BASED APPROACH AND PROTOCOL FOR ORGANIZING AN AD-HOC NETWORK 审中-公开
标题翻译：链接等效的基于头文件的方法和组织网络的协议
公开(公告)号：WO2007061577A2
公开(公告)日：2007-05-31
申请号：PCT/US2006/042239
申请日：2006-10-27
申请人： TELCORDIA TECHNOLOGIES, INC. , TOYOTA INFOTECHNOLOGY CENTER CO., LTD. , CHEN, Wai , LEE, John , PANG, Marcus , CAI, Shengwei , HIKITA, Toshiro
发明人： CHEN, Wai , LEE, John , PANG, Marcus , CAI, Shengwei , HIKITA, Toshiro
IPC分类号： H04Q7/24
CPC分类号： H04W84/18 , H04W4/02 , H04W8/005 , H04W8/08 , H04W92/02
摘要： Establishing and maintaining a moving ad-hoc network is provided. The ad-hoc network includes a plurality of equivalent cells communicationally linked together to form a linked equivalent cell network. An equivalent cell header manages each equivalent cell. Additionally, regular nodes, scattered throughout the equivalent cell network, may be provided. Regular nodes have restricted communication privileges compared to the equivalent cell headers. However, equivalent cell headers can be demoted to regular nodes and regular nodes can be promoted to equivalent cell headers as required by equivalent cell network.
摘要翻译：提供建立和维护移动自组织网络。自组织网络包括通信地链接在一起以形成链接的等效小区网络的多个等效小区。等效单元头管理每个等效单元。此外，可以提供散布在等效小区网络中的常规节点。与等效的单元格标头相比，常规节点具有受限的通信权限。然而，可以将等效的单元格标题降级到常规节点，并且可以根据等效单元网络的要求将常规节点提升到等效的单元格标题。

10. 发明申请

WO2007061573A2 GROUP-HEADER BASED METHOD TO ORGANIZE LOCAL PEER GROUP OF VEHICLES FOR INTER-VEHICLE COMMUNICATION 审中-公开
标题翻译：以组合为主的方法组织机动车通行局部对等车队
公开(公告)号：WO2007061573A2
公开(公告)日：2007-05-31
申请号：PCT/US2006/042136
申请日：2006-10-27
申请人： TELCORDIA TECHNOLOGIES, INC. , TOYOTA INFOTECHNOLOGY CENTER CO., LTD , CHEN, Wai , CHENNIKARA-VARGHESE, Jasmine , PANG, Marcus , CAI, Shengwei , HIKITA, Toshiro
发明人： CHEN, Wai , CHENNIKARA-VARGHESE, Jasmine , PANG, Marcus , CAI, Shengwei , HIKITA, Toshiro
IPC分类号： H04B7/14 , H04J3/08 , H04L12/28 , H04J1/10
CPC分类号： G08G1/163 , H04W4/08 , H04W8/186 , H04W48/10 , H04W84/18
摘要： A method for establishing and maintaining the network and a corresponding ad-hoc moving- device to moving-device network having a plurality of moving-devices grouped into a Local Peer Group (LPG) is disclosed. A group header node (GH) is selected from the plurality of moving wireless devices in the LPG. The GH controls and manages the LPG by broadcasting a plurality of control messages, including a heartbeat message at a fixed interval. The LPG also includes at least one group node (GN). The at least one GN can communicate with the GH via a network link created between the at least one GN and the GH. The GNs join the LPG via the GH. If there is more then one GH in an LPG, header resolution occurs to select only one GH.
摘要翻译：公开了一种用于建立和维护网络的方法以及具有分组为本地对等组（LPG）的多个移动设备的移动设备网络的相应的自组织移动设备。从LPG中的多个移动无线设备中选择组头节点（GH）。 GH通过以固定的间隔广播包括心跳消息的多个控制消息来控制和管理LPG。 LPG还包括至少一个组节点（GN）。至少一个GN可以通过在至少一个GN和GH之间创建的网络链路与GH通信。 GN通过GH加入LPG。如果LPG中存在多于一个GH，则会发生标题分辨率，以仅选择一个GH。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式