会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 11. 发明申请
    • Distributed Method for Minimum Delay Multi-Hop Data Delivery in Vehicular Networks
    • 车载网络中最小延迟多跳数据传送的分布式方法
    • US20090238187A1
    • 2009-09-24
    • US12408221
    • 2009-03-20
    • Ratul K. GuhaWai ChenJasmine Chennikara-VargheseStephanie Demers
    • Ratul K. GuhaWai ChenJasmine Chennikara-VargheseStephanie Demers
    • H04L12/56
    • G08G1/161H04L2012/40273H04W40/20
    • An inventive method for data delivery in a multi-hop vehicular network with multiple vehicles and intersections is presented. The method comprises, at each source vehicle, initiating packet flow, labeling packets with destination coordinates and a current location, and forwarding the packet flow, and at each intersection, selecting a header vehicle, computing a backlog indicator and listening for broadcasts with a matrix and delay information, updating the matrix in accordance with the backlog indicator if the matrix is present, otherwise initializing the matrix, forwarding the packet flow, and broadcasting the matrix from the header vehicle. In one embodiment, selection of the header vehicle is performed based on random countdown and vehicle ID. The method converges to the optimal (lowest latency) state irrespective of the initial starting point of the network and continues to tend towards the optimal state even as the network conditions alter.
    • 提出了一种在多车辆和交叉路口的多跳车辆网络中进行数据传输的创新方法。 该方法包括:在每个源车辆处,发起分组流,标记具有目的地坐标和当前位置的分组,以及转发分组流,并且在每个交叉路口选择一个头部车辆,计算积压指示符并用矩阵收听广播 和延迟信息,如果矩阵存在,则根据积压指示符更新矩阵,否则初始化矩阵,转发分组流,以及从头部车辆广播矩阵。 在一个实施例中,基于随机倒计时和车辆ID执行头部车辆的选择。 该方法收敛到最优(最低等待时间)状态,而与网络的起始起始点无关,并且即使网络条件发生变化,也继续趋向于最佳状态。
    • 13. 发明授权
    • Method and system for providing satellite bandwidth on demand using multi-level queuing
    • 使用多级排队提供卫星带宽需求的方法和系统
    • US06985455B1
    • 2006-01-10
    • US09631269
    • 2000-08-02
    • Robert Jeff HeathRobert J. TorresSreenivas RamaswamyStephanie Demers
    • Robert Jeff HeathRobert J. TorresSreenivas RamaswamyStephanie Demers
    • H04B7/185
    • H04B7/1858
    • An approach for allocating bandwidth in a satellite communication system is disclosed. The system includes a set of global queues that store bandwidth requests, which are received from a number of satellite terminals. The received bandwidth request include a high priority rate request, a low priority rate request, a high priority volume request, and a low priority volume request. A bandwidth control processor determines bandwidth request type and priority of the received bandwidth requests and places the bandwidth requests in the appropriate global queues based upon the determined bandwidth request type and priority. Each of the global queues corresponds to a data rate associated with of each a plurality of channels. The system also utilizes a set of local queues that correspond to the channels. The BCP moves the bandwidth requests from the global queues to the local queues. The BCP then allocates the transmission slots in response to the bandwidth requests stored in the local queues.
    • 公开了一种在卫星通信系统中分配带宽的方法。 该系统包括存储从多个卫星终端接收的带宽请求的一组全局队列。 所接收的带宽请求包括高优先级速率请求,低优先级速率请求,高优先级卷请求和低优先级卷请求。 带宽控制处理器确定接收的带宽请求的带宽请求类型和优先级,并根据所确定的带宽请求类型和优先级将带宽请求放置在适当的全局队列中。 每个全局队列对应于与多个信道中的每一个相关联的数据速率。 该系统还利用一组对应于这些通道的本地队列。 BCP将带宽请求从全局队列移动到本地队列。 BCP然后响应于存储在本地队列中的带宽请求来分配传输时隙。
    • 14. 发明授权
    • Method of broadcasting packets in ad-hoc network
    • 在ad-hoc网络中广播分组的方法
    • US07889691B2
    • 2011-02-15
    • US11983829
    • 2007-11-13
    • Wai ChenStephanie DemersJohn LeeMarcus PangRyokichi OnishiToshiro Hikita
    • Wai ChenStephanie DemersJohn LeeMarcus PangRyokichi OnishiToshiro Hikita
    • H04J3/08H04L12/56
    • H04H20/08H04H20/57H04H60/50H04H60/53H04L12/1868H04L12/189H04L45/16H04W40/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.
    • 一种用于将分组分发到多个移动节点的方法,包括:接收包含至少一个消息的包,发送方标识符,发送者的位置,中继节点的标识符和距发件人和中继节点的距离,确定是否 如果接收节点是中继节点,则接收分组的节点是中继节点,并且立即将分组分发到多个移动节点。 如果接收节点不是中继节点,则该方法还包括在一段时间内等待设定的时间段,确定是否从包含相同消息的不同发送方接收到分组的步骤,并将分组分发到多个 如果在一段时间内没有收到包含相同消息的数据包,则移动节点。 分布式分组包括用于连续中继节点的标识符。
    • 15. 发明申请
    • Achieving High-Rate Multi-Hop Data Delivery in Vehicular Networks
    • 实现车载网络中的高速多跳数据传输
    • US20100074114A1
    • 2010-03-25
    • US12563420
    • 2009-09-21
    • Ratul K. GuhaWai ChenJasmine Chennikara-VargheseStephanie Demers
    • Ratul K. GuhaWai ChenJasmine Chennikara-VargheseStephanie Demers
    • H04L12/26H04W4/00
    • H04L45/00H04L45/02H04L45/125H04L45/44H04L67/12
    • A method for high rate data delivery in a multi-hop vehicular network comprises at each source vehicle, initiating a packet having a flow tag, assigning an identifier of the content and the current location to the flow tag, and forwarding the packet; at each destination vehicle, setting a flow request and broadcasting at the current intersection; further on movement, setting the flow request at the new intersection, and at each intersection, selecting a header vehicle at the intersection, computing backlog and congestion indicators and listening for broadcasts with a matrix and the flow requests at the header vehicle, determining if the matrix is present, updating the matrix in accordance with the backlog and congestion indicators if the matrix is present, initializing the matrix and estimating the delay on the outgoing road segments if the matrix is not present, forwarding the packet flow, and broadcasting the matrix from the header vehicle.
    • 一种多跳车辆网络中高速率数据传输的方法,包括在每个源车辆发起具有流标签的分组,向流标签分配内容的标识符和当前位置,以及转发分组; 在每个目的地车辆,在当前交叉点设置流量请求和广播; 进一步运动,在新路口设置流量请求,在每个交点处,在交点处选择一个头部车辆,计算积压和拥塞指示符,并用矩阵和头部车辆的流量请求监听广播,确定是否 矩阵存在,如果矩阵存在,则根据积压和拥塞指示更新矩阵,如果矩阵不存在则初始化矩阵并估计出站道路段上的延迟,转发分组流,并且从矩阵广播矩阵 头部车辆。
    • 18. 发明授权
    • Distributed method for minimum delay multi-hop data delivery in vehicular networks
    • 车载网络中最小延迟多跳数据传输的分布式方法
    • US08761175B2
    • 2014-06-24
    • US12408221
    • 2009-03-20
    • Ratul K. GuhaWai ChenStephanie DemersJasmine Chennikara-Varghese
    • Ratul K. GuhaWai ChenStephanie DemersJasmine Chennikara-Varghese
    • H04L12/28H04J3/16G06F15/173
    • G08G1/161H04L2012/40273H04W40/20
    • An inventive method for data delivery in a multi-hop vehicular network with multiple vehicles and intersections is presented. The method comprises, at each source vehicle, initiating packet flow, labeling packets with destination coordinates and a current location, and forwarding the packet flow, and at each intersection, selecting a header vehicle, computing a backlog indicator and listening for broadcasts with a matrix and delay information, updating the matrix in accordance with the backlog indicator if the matrix is present, otherwise initializing the matrix, forwarding the packet flow, and broadcasting the matrix from the header vehicle. In one embodiment, selection of the header vehicle is performed based on random countdown and vehicle ID. The method converges to the optimal (lowest latency) state irrespective of the initial starting point of the network and continues to tend towards the optimal state even as the network conditions alter.
    • 提出了一种在多车辆和交叉路口的多跳车辆网络中进行数据传输的创新方法。 该方法包括:在每个源车辆处,发起分组流,标记具有目的地坐标和当前位置的分组,以及转发分组流,并且在每个交点处,选择头部车辆,计算积压指示符并用矩阵收听广播 和延迟信息,如果矩阵存在,则根据积压指示符更新矩阵,否则初始化矩阵,转发分组流,以及从头部车辆广播矩阵。 在一个实施例中,基于随机倒计时和车辆ID执行头部车辆的选择。 该方法收敛到最优(最低等待时间)状态,而与网络的起始起始点无关,并且即使网络条件发生变化,也继续趋向于最佳状态。