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

1. 发明授权

US08160078B2 Inter-local peer group (LPG) routing method 有权
标题翻译：本地对等体组（LPG）路由方法
公开(公告)号：US08160078B2
公开(公告)日：2012-04-17
申请号：US12120690
申请日：2008-05-15
申请人： 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/50
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, upon receipt of the routing response.
摘要翻译：一种在多个本地对等体组（LPG）之间路由数据的按需方法。每个LPG包括多个移动节点。该方法包括从源节点发送路由请求消息，将路由请求消息中继到本地边界节点; 将所述路由请求消息转发到外部边界节点，确定所述目的地节点是否在所述外部边界节点的LPG内; 如果目的地节点不在LPG内，则将路由请求消息中继到另一边界节点，如果目的地节点在LPG内，则将路由请求消息中继到目的节点，在目的地节点处接收路由请求消息，发送路由响应于源节点，通过路由请求发现的路径将路由响应中继到源节点，在源节点接收路由响应，并在接收到路由响应时发送数据。

2. 发明申请

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内，则将路由请求消息中继到目的节点，在目的地节点处接收路由请求消息，发送路由响应于源节点，通过路由请求发现的路径将路由响应中继到源节点，在源节点接收路由响应，并在接收到路由响应时发送数据。

3. 发明授权

US08995447B2 Inter-local peer group (LPG) routing method 有权
标题翻译：本地对等体组（LPG）路由方法
公开(公告)号：US08995447B2
公开(公告)日：2015-03-31
申请号：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 , H04W40/28 , H04L12/26 , H04L12/715 , H04W40/32 , H04W84/00 , H04W88/04
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内，则将路由请求消息中继到目的节点，在目的地节点处接收路由请求消息，发送路由响应于源节点，通过路由请求发现的路径将路由响应中继到源节点，在源节点接收路由响应，并在接收到路由响应时发送数据。

4. 发明申请

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

5. 发明申请

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）。

6. 发明授权

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）。

7. 发明申请

US20130145461A1 Security Method for Mobile Ad Hoc Networks with Efficient Flooding Mechanism Using Layer Independent Passive Clustering (LIPC) 有权
标题翻译：利用层间独立无源聚类（LIPC）的有效洪泛机制的移动Ad Hoc网络的安全方法
公开(公告)号：US20130145461A1
公开(公告)日：2013-06-06
申请号：US13312250
申请日：2011-12-06
申请人： Melbourne Barton , Taek Jin Kwon
发明人： Melbourne Barton , Taek Jin Kwon
IPC分类号： G06F21/00
CPC分类号： H04W12/12 , H04W40/32 , H04W84/18
摘要： A security method and system for Layer Independent Passive Clustering (LIPC) is presented. The inventive method and system maintains the states in the LIPC cluster formation protocol while adding a ‘Trusworthy’ event to each state and provides a methodology that depends on the state of the transmitting node to quantify Trustworthy and derive a Trust Confidence Value (TCV) to represent the level of confidence in quantifying ‘Trustworthy’. The invention dynamically computes a degree of trustworthiness for each participating network node and eliminates nodes from participating in the PC cluster formation protocol and packet forwarding if they do not meet established trust metrics. The security solution can also apply to PC-based Mobile Ad hoc Networks (MANETs). The novel system and method applies a multidimensional set of security algorithms to protect the LIPC cluster formation protocol from malicious attacks that compromise cluster formation and secure routing.
摘要翻译：提出了一种用于层自由被动聚类（LIPC）的安全方法和系统。本发明的方法和系统维护LIPC簇形成协议中的状态，同时向每个状态添加“可信任”事件，并提供依赖于发送节点的状态量化可信赖并导出信任置信度（TCV）的方法代表了量化“值得信赖”的信心水平。本发明动态地计算每个参与网络节点的可信度程度，并且如果它们不满足建立的信任度量，则消除节点参与PC簇形成协议和分组转发。安全解决方案也可以应用于基于PC的移动自组织网络（MANET）。新颖的系统和方法应用了多维安全算法集，以保护LIPC簇形成协议免受危及集群形成和安全路由的恶意攻击。

8. 发明授权

US08490175B2 Security method for mobile ad hoc networks with efficient flooding mechanism using layer independent passive clustering (LIPC) 有权
标题翻译：使用层次无源聚类（LIPC）的有效洪泛机制的移动自组织网络的安全方法
公开(公告)号：US08490175B2
公开(公告)日：2013-07-16
申请号：US13312250
申请日：2011-12-06
申请人： Melbourne Barton , Taek Jin Kwon
发明人： Melbourne Barton , Taek Jin Kwon
IPC分类号： H04L29/06 , G06F15/16
CPC分类号： H04W12/12 , H04W40/32 , H04W84/18
摘要： A security method and system for Layer Independent Passive Clustering (LIPC) is presented. The inventive method and system maintains the states in the LIPC cluster formation protocol while adding a ‘Trusworthy’ event to each state and provides a methodology that depends on the state of the transmitting node to quantify Trustworthy and derive a Trust Confidence Value (TCV) to represent the level of confidence in quantifying ‘Trustworthy’. The invention dynamically computes a degree of trustworthiness for each participating network node and eliminates nodes from participating in the PC cluster formation protocol and packet forwarding if they do not meet established trust metrics. The security solution can also apply to PC-based Mobile Ad hoc Networks (MANETs). The novel system and method applies a multidimensional set of security algorithms to protect the LIPC cluster formation protocol from malicious attacks that compromise cluster formation and secure routing.
摘要翻译：提出了一种用于层自由被动聚类（LIPC）的安全方法和系统。本发明的方法和系统维护LIPC簇形成协议中的状态，同时向每个状态添加“可信任”事件，并提供依赖于发送节点的状态量化可信赖并导出信任置信度（TCV）的方法代表了量化“值得信赖”的信心水平。本发明动态地计算每个参与网络节点的可信度程度，并且如果它们不满足建立的信任度量，则消除节点参与PC簇形成协议和分组转发。安全解决方案也可以应用于基于PC的移动自组织网络（MANET）。新颖的系统和方法应用了多维安全算法集，以保护LIPC簇形成协议免受危及集群形成和安全路由的恶意攻击。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式