-
1.发明公开ADAPTATION PROTOCOLS FOR LOCAL PEER GROUP (LPG) NETWORKS IN DYNAMIC ROADWAY ENVIRONMENTS 有权适应协议本地对等群组（LPG）网络在动态环境ROAD
公开(公告)号：EP2507946A1
公开(公告)日：2012-10-10
申请号：EP10835020.8
申请日：2010-12-01
发明人： CHEN, Wai , KWON, Taek-jin , ONISHI, Ryokichi , VUYYURU, Rama
IPC分类号： H04L12/28
CPC分类号： H04L43/10 , H04L43/0864 , H04L45/26 , H04L45/54 , H04W40/32
摘要： A method and system for determining a size of a local peer group (LPG) network in a dynamic roadway (mobile) environment is provided. In one embodiment, the method comprises measuring a roundtrip time between a first node and a second node, and utilizing the measured roundtrip time to select the size of the local peer group network from a lookup table. In another embodiment, the method comprises determining when the roundtrip time exceeds a time interval of the heartbeat signal, and when the roundtrip time exceeds the time interval of the heartbeat signal adjusting the size of the local peer group network.
-
2.发明授权METHODS FOR EFFICIENT ORGANIZATION OF VEHICLE PEER GROUPS AND EFFICIENT V2R COMMUNICATIONS 有权有效组织车辆对等组和有效的V2R通信的方法
公开(公告)号：EP2283585B1
公开(公告)日：2017-07-12
申请号：EP09747264.1
申请日：2009-05-11
发明人： CHEN, Wai , KWON, Taek, Jin , LEE, John , ONISHI, Ryokichi , HIKITA, Toshiro
IPC分类号： H04W40/24 , H04L12/701 , H04W40/30 , H04L12/733 , H04L12/753
CPC分类号： H04W40/30 , H04L45/00 , H04L45/20 , H04L45/48 , H04W40/246
-
3.发明公开
公开(公告)号：EP2217936A1
公开(公告)日：2010-08-18
申请号：EP08851726.3
申请日：2008-11-18
IPC分类号： G01R31/08
CPC分类号： H04W72/0406 , H04W40/16 , H04W40/246 , H04W84/18
摘要： A method for determining a transmission channel for multi-hop transmission of a data packet from a plurality of data channels in an ad-hoc network. The network includes at least one local peer group. Each local peer group has a plurality of moving vehicles as nodes. The method comprises steps of determining available channels for data packet transmission at each node, transmitting a first list of available channels to at least one other node, receiving, from the at least one other node, a second list of available channel for the at least one other node, creating an available channel table including the first and second lists of available channels, selecting a transmitting channel for a data packet based upon information in the available channel table, and advertising the selected channel to the at least one other node.
-
公开(公告)号：EP2215780A1
公开(公告)日：2010-08-11
申请号：EP08849395.2
申请日：2008-11-12
发明人： 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.
摘要翻译： 一种用于将分组分发到多个移动节点的方法，包括：接收包含至少一个消息，发送者标识符，发送者的位置，中继节点的标识符以及距发送者和中继节点的距离的分组;确定是否 接收分组的节点是中继节点，并且如果接收节点是中继节点，则立即将分组分发到多个移动节点。 如果接收节点不是中继节点，则该方法进一步包括以下步骤：等待设定的时间段，在该时间段内确定是否从包含相同消息的不同发送方接收到分组并将分组分发给多个 如果在一段时间内没有接收到包含相同消息的分组，则移动节点。 分布式分组包括用于连续中继节点的标识符。
-
5.发明公开
公开(公告)号：EP2076846A1
公开(公告)日：2009-07-08
申请号：EP07749368.2
申请日：2007-01-26
发明人： 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.
-
6.发明授权Method for determining transmission channels for a vehicle communication network 有权确定用于车辆通信网络的传输信道的方法
公开(公告)号：EP2217936B1
公开(公告)日：2015-04-22
申请号：EP08851726.3
申请日：2008-11-18
CPC分类号： H04W72/0406 , H04W40/16 , H04W40/246 , H04W84/18
-
公开(公告)号：EP2281368A1
公开(公告)日：2011-02-09
申请号：EP09747263.3
申请日：2009-05-11
发明人： CHEN, Wai , PANG, Marcus , KWON, Taek, Jin , ONISHI, Ryokichi , HIKITA, Toshiro
IPC分类号： H04L12/56
摘要： 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.
-
公开(公告)号：EP2183930A1
公开(公告)日：2010-05-12
申请号：EP08782255.7
申请日：2008-07-23
发明人： CHEN, Wai , LEE, John , GUHA, Ratul, K. , ONISHI, Ryokichi , VUYYURU, Rama
IPC分类号： H04W4/00
摘要： The present invention offers systems and methods for effective multiple-hop routing, multicasting and media access control for vehicle group communications that employ directional wireless radio technology. Multi-beam optic-wireless media and streamlined operations provide low-overhead communications among vehicles. Systems and methods are provided to maintain a quasi-stationary group of neighboring vehicles, enable high-throughput on-demand switching among multiple vehicles, enable group coding in the vehicle group to achieve higher throughput, and enable dynamic adjustment of link to maintain desirable vehicle group. The proposed solution builds upon the conception of a MAC-free wireless operation and quasi-stationary vehicular switched network to achieve ultra-low-overhead and high-throughput vehicle communications.
-
9.发明公开METHODS FOR OPTIMAL MULTI-CHANNEL ASSIGNMENTS IN VEHICULAR AD-HOC NETWORKS 审中-公开的程序对车辆Ad hoc网络最好的多通道分配
公开(公告)号：EP2156614A1
公开(公告)日：2010-02-24
申请号：EP07853117.5
申请日：2007-11-13
发明人： 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.
-
10.发明公开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
发明人： 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.
-
-
-
-
-
-
-
-
-
搜索结果
16 条记录 (耗时 0.015 秒)
