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

21. 发明授权

US08855115B2 Methods for reliable multicasting in local peer group (LPG) based vehicle ad hoc networks 有权
标题翻译：基于局部对等群（LPG）的车辆自组织网络中可靠组播的方法
公开(公告)号：US08855115B2
公开(公告)日：2014-10-07
申请号：US13278316
申请日：2011-10-21
申请人： Wai Chen , John Lee , Ryokichi Onishi , Toshiro Hikito
发明人： Wai Chen , John Lee , Ryokichi Onishi , Toshiro Hikito
IPC分类号： H04L12/28 , H04L12/761 , H04L12/701 , H04L12/18 , H04W40/02
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.
摘要翻译：一种用于路由多播消息的方法，包括以下步骤：接收包括至少消息，源标识符，序列号，生存时间值和多播组目的地的多播消息，确定所述多播组目的地是否在组播转发表，确定是否先前已经接收到消息，如果确定多播消息尚未被接收到，则将多播消息添加到组播转发表中，确定接收到多播消息的节点是否是转发节点 ; 随机设置转发多播消息的等待时间; 并在等待时间到期时转发组播消息。

22. 发明申请

US20080095163A1 Method and communication device for routing unicast and multicast messages in an ad-hoc wireless network 有权
标题翻译：用于在自组织无线网络中路由单播和多播消息的方法和通信设备
公开(公告)号：US20080095163A1
公开(公告)日：2008-04-24
申请号：US11585047
申请日：2006-10-23
申请人： Wai Chen , Taek-Jin Kwon , Toshiro Hikita , Ryokichi Onishi , John Lee
发明人： Wai Chen , Taek-Jin Kwon , Toshiro Hikita , Ryokichi Onishi , John Lee
IPC分类号： H04L12/56
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中。

23. 发明申请

US20090285197A1 METHODS FOR EFFICIENT ORGANIZATION OF VEHICLE PEER GROUPS AND EFFICIENT V2R COMMUNICATIONS 有权
标题翻译：有效组织车辆对等组合和有效的V2R通信的方法
公开(公告)号：US20090285197A1
公开(公告)日：2009-11-19
申请号：US12120330
申请日：2008-05-14
申请人： Wai Chen , Taek Jin Kwon , John Lee , Ryokichi Onishi , Toshiro Hikita
发明人： Wai Chen , Taek Jin Kwon , John Lee , Ryokichi Onishi , Toshiro Hikita
IPC分类号： H04L12/28
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）。

24. 发明申请

US20090201928A1 Methods for reliable multicasting in local peer group (LPG) based vehicle ad hoc networks 有权
标题翻译：基于局部对等群（LPG）的车辆自组织网络中可靠组播的方法
公开(公告)号：US20090201928A1
公开(公告)日：2009-08-13
申请号：US12069815
申请日：2008-02-13
申请人： Wai Chen , John Lee , Ryokichi Onishi , Toshiro Hikin
发明人： Wai Chen , John Lee , Ryokichi Onishi , Toshiro Hikin
IPC分类号： H04L12/56
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.
摘要翻译：一种用于路由多播消息的方法，包括以下步骤：接收包括至少消息，源标识符，序列号，生存时间值和多播组目的地的多播消息，确定所述多播组目的地是否在组播转发表，确定是否先前已经接收到消息，如果确定多播消息尚未被接收到，则将多播消息添加到组播转发表中，确定接收到多播消息的节点是否是转发节点 ; 随机设置转发多播消息的等待时间; 并在等待时间到期时转发组播消息。

25. 发明授权

US08520673B2 Method and communication device for routing unicast and multicast messages in an ad-hoc wireless network 有权
标题翻译：用于在自组织无线网络中路由单播和多播消息的方法和通信设备
公开(公告)号：US08520673B2
公开(公告)日：2013-08-27
申请号：US11585047
申请日：2006-10-23
申请人： Wai Chen , Taek-Jin Kwon , Toshiro Hikita , Ryokichi Onishi , John Lee
发明人： Wai Chen , Taek-Jin Kwon , Toshiro Hikita , Ryokichi Onishi , John Lee
IPC分类号： H04L12/28
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中。

26. 发明申请

US20120201167A1 Inter-Local Peer Group (LPG) Routing Method 有权
标题翻译：本地对等组（LPG）路由方法
公开(公告)号：US20120201167A1
公开(公告)日：2012-08-09
申请号：US13418530
申请日：2012-03-13
申请人： Wai Chen , Marcus Pang , Taek Jin Kwon , Ryokichi Onishi , Toshiro Hikita
发明人： Wai Chen , Marcus Pang , Taek Jin Kwon , Ryokichi Onishi , Toshiro Hikita
IPC分类号： H04L12/28 , 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) of plural moving nodes 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, upon receipt of the routing response.
摘要翻译：在多个移动节点的多个本地对等体组（LPG）之间路由数据的按需方法包括从源节点发送路由请求消息，将路由请求消息中继到本地边界节点; 将所述路由请求消息转发到外部边界节点，确定所述目的地节点是否在所述外部边界节点的LPG内; 如果目的地节点不在LPG内，则将路由请求消息中继到另一边界节点，如果目的地节点在LPG内，则将路由请求消息中继到目的节点，在目的地节点处接收路由请求消息，发送路由响应于源节点，通过路由请求发现的路径将路由响应中继到源节点，在源节点接收路由响应，并在接收到路由响应时发送数据。

27. 发明授权

US07889691B2 Method of broadcasting packets in ad-hoc network 有权
标题翻译：在ad-hoc网络中广播分组的方法
公开(公告)号：US07889691B2
公开(公告)日：2011-02-15
申请号：US11983829
申请日：2007-11-13
申请人： Wai Chen , Stephanie Demers , John Lee , Marcus Pang , Ryokichi Onishi , Toshiro Hikita
发明人： Wai Chen , Stephanie Demers , John Lee , Marcus Pang , Ryokichi Onishi , Toshiro Hikita
IPC分类号： H04J3/08 , H04L12/56
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.
摘要翻译：一种用于将分组分发到多个移动节点的方法，包括：接收包含至少一个消息的包，发送方标识符，发送者的位置，中继节点的标识符和距发件人和中继节点的距离，确定是否如果接收节点是中继节点，则接收分组的节点是中继节点，并且立即将分组分发到多个移动节点。如果接收节点不是中继节点，则该方法还包括在一段时间内等待设定的时间段，确定是否从包含相同消息的不同发送方接收到分组的步骤，并将分组分发到多个如果在一段时间内没有收到包含相同消息的数据包，则移动节点。分布式分组包括用于连续中继节点的标识符。

28. 发明申请

US20090122738A1 Method of broadcasting packets in ad-hoc network 有权
标题翻译：在ad-hoc网络中广播分组的方法
公开(公告)号：US20090122738A1
公开(公告)日：2009-05-14
申请号：US11983829
申请日：2007-11-13
申请人： Wai Chen , Stephanie Demers , John Lee , Marcus Pang , Ryokichi Onishi , Toshiro Hikita
发明人： Wai Chen , Stephanie Demers , John Lee , Marcus Pang , Ryokichi Onishi , Toshiro Hikita
IPC分类号： H04H20/71
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.
摘要翻译：一种用于将分组分发到多个移动节点的方法，包括：接收包含至少一个消息的包，发送方标识符，发送者的位置，中继节点的标识符和距发件人和中继节点的距离，确定是否如果接收节点是中继节点，则接收分组的节点是中继节点，并且立即将分组分发到多个移动节点。如果接收节点不是中继节点，则该方法还包括在一段时间内等待设定的时间段，确定是否从包含相同消息的不同发送方接收到分组的步骤，并将分组分发到多个如果在一段时间内没有收到包含相同消息的数据包，则移动节点。分布式分组包括用于连续中继节点的标识符。

29. 发明申请

US20080279141A1 Methods for optimal multi-channel assignments in vehicular ad-hoc networks 有权
标题翻译：车载ad-hoc网络中最优多频道分配的方法
公开(公告)号：US20080279141A1
公开(公告)日：2008-11-13
申请号：US11800849
申请日：2007-05-08
申请人： Hanan Luss , Wai Chen , Toshiro Hikita , Ryokichi Onishi
发明人： Hanan Luss , Wai Chen , Toshiro Hikita , Ryokichi Onishi
IPC分类号： H04Q7/00
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.
摘要翻译：在运动节点的有序序列之间建立通信路径，代表车辆。可用的通道可能因一个节点而不同于下一个节点，并且节点不能对接收和发送信息使用相同的信道。描述了提供节点之间的信道分配的最佳序列的三种方法。如果信道分配的序列建立了从序列中的第一个节点到序列中的最后一个节点的通信路径，或者如果这样的路径不存在，则从第一个节点到最远的节点序列。第一种方法使用从序列中的第一个节点开始的深度优先搜索。第二种方法在深度优先搜索方法中使用“前瞻”方案。第三种方法只需要通过节点序列中的最佳信道分配，而不需要回溯，就可以顺利通过节点序列。

30. 发明授权

US08351417B2 Methods for efficient organization of vehicle peer groups and efficient V2R communications 有权
标题翻译：有效组织车辆对等组和高效V2R通信的方法
公开(公告)号：US08351417B2
公开(公告)日：2013-01-08
申请号：US12120330
申请日：2008-05-14
申请人： Wai Chen , Taek Jin Kwon , John Lee , Ryokichi Onishi , Toshiro Hikita
发明人： Wai Chen , Taek Jin Kwon , John Lee , Ryokichi Onishi , Toshiro Hikita
IPC分类号： H04L12/28
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）。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式