会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 12. 发明授权
    • System and method for collision-free transmission scheduling using neighborhood information and advertised transmission times
    • 使用邻域信息进行无碰撞传输调度的系统和方法,并通告传输时间
    • US06791997B2
    • 2004-09-14
    • US10228173
    • 2002-08-26
    • David BeyerJose J. Garcia-Luna-Aceves
    • David BeyerJose J. Garcia-Luna-Aceves
    • H04L12413
    • H04W72/1278H04L45/20H04W8/245H04W40/24H04W72/1257H04W80/02H04W84/18
    • The present invention provides a medium access control (MAC) protocol for the collision-free transmission of packets into a channel, such that nodes are assigned time slots for collision-free transmission based on the knowledge that they acquire regarding the constituency of their local neighborhoods and the advertisements of the time slots when nodes in local neighborhoods will attempt to transmit again. The scheduling procedure may utilize an age of the network together with the unique identifiers of nodes. The candidate transmission times for each node are determined using a list of the subsequent transmission times advertised by other nodes. The node discards the advertised transmission times from the list of potential transmission times, and computes its candidate transmission times using a function that provides a varying (pseudorandom) distribution of outputs for a varying sample of inputs. This function ay be a hash function, an encryption function, or a table lookup function. The computation of the candidate transmission times uses the identifiers of those nodes for which no advertised transmission time has been obtained.
    • 本发明提供了一种媒体接入控制(MAC)协议,用于将数据包无冲突地传输到信道中,使得节点被分配用于无碰撞传输的时隙,这是基于他们获取的关于其本地邻域的选区的知识 以及当地邻域中的节点将尝试再次发送的时隙的广告。调度过程可以利用网络的年龄以及节点的唯一标识符。 使用由其他节点发布的后续传输时间的列表来确定每个节点的候选传输时间。 节点从潜在传输时间列表中丢弃所通告的传输时间,并且使用为变化的输入样本提供输出的变化(伪随机数)分布的函数来计算其候选传输时间。 此函数可以是散列函数,加密函数或表查找函数。 候选传输时间的计算使用未获得通告的传输时间的那些节点的标识符。
    • 15. 发明授权
    • System and method for discovering information objects and information object repositories in computer networks
    • 用于在计算机网络中发现信息对象和信息对象库的系统和方法
    • US08572214B2
    • 2013-10-29
    • US11499182
    • 2006-08-03
    • Jose J. Garcia-Luna-Aceves
    • Jose J. Garcia-Luna-Aceves
    • G06F15/177
    • H04L45/12G06F12/1483G06F17/30902H04L12/18H04L29/12009H04L43/0805H04L43/0852H04L61/1582H04L67/1002H04L67/1006H04L67/1008H04L67/101H04L67/1014H04L67/1023H04L67/1038H04L67/2842
    • An address of an information object repository that should service a client request for an information object is returned in response to a request therefor. The address of the information object repository which is returned is selected according to specified performance metrics regardless of whether or not the information object repository maintains a local copy of the information object that is the client request. In some cases, the address of the information object repository is further selected according to an address of a client making the client request. Further, the address of the information object repository is selected from a number of addresses of information object repositories. The specified performance metrics may include one or more of an average delay from the information object repository to the client, average processing delays at the information object repository, reliability of a path from the information object repository to the client, available bandwidth in said path, and loads on the information object repository. In some cases, the information object repository may be instructed to obtain a copy of the information object after the address of the information object repository is returned in response to the request therefore.
    • 响应于该请求而返回应当为客户端请求信息对象提供服务的信息对象库的地址。 不管信息对象存储库是否维护作为客户机请求的信息对象的本地副本,都会根据指定的性能度量来选择返回的信息对象存储库的地址。 在某些情况下,根据客户端请求的客户端的地址进一步选择信息对象库的地址。 此外,从信息对象库的多个地址中选择信息对象库的地址。 指定的性能度量可以包括从信息对象库到客户机的平均延迟,信息对象库中的平均处理延迟,从信息对象库到客户机的路径的可靠性,所述路径中的可用带宽, 并加载到信息对象库中。 在某些情况下,可以指示信息对象存储库在响应于该请求返回信息对象库的地址之后获取信息对象的副本。
    • 19. 发明授权
    • Method and system for loop-free ad-hoc routing
    • 无循环自组织路由的方法和系统
    • US07567547B2
    • 2009-07-28
    • US11517203
    • 2006-09-07
    • Marc E. MoskoJose J. Garcia-Luna-Aceves
    • Marc E. MoskoJose J. Garcia-Luna-Aceves
    • H04L12/28
    • H04W40/28H04L45/18H04L45/20H04L45/32
    • One embodiment of the present invention provides a system that facilitates loop-free ad-hoc routing in a wireless network. During operation, the system advertises a local sequence number associated with a local node for a destination node, and receives a first route request at the local node, wherein the route request specifies a source node, the destination node, and a first sequence number. The system further selectively maintains a record, which indicates the source node, the destination node, the first sequence number, and a node from which the route request is received. The system also selectively forwards a second route request based on the received route request, wherein the second route request specifies the source node, the destination node, and a second sequence number which is less than the first sequence number and less than or equal to the advertised local sequence number.
    • 本发明的一个实施例提供了一种有助于无线网络中无环路自组织路由的系统。 在操作期间,系统通告与目的地节点的本地节点相关联的本地序列号,并在本地节点处接收第一路由请求,其中路由请求指定源节点,目的地节点和第一序列号。 该系统还选择性地维护指示源节点,目的地节点,第一序列号以及从其接收路由请求的节点的记录。 所述系统还基于所接收的路由请求选择性地转发第二路由请求,其中所述第二路由请求指定所述源节点,所述目的地节点和小于所述第一序列号并小于或等于所述目的节点的第二序列号 广告本地序列号。
    • 20. 发明申请
    • Method and system for loop-free ad-hoc routing
    • 无循环自组织路由的方法和系统
    • US20080062916A1
    • 2008-03-13
    • US11517203
    • 2006-09-07
    • Marc E. MoskoJose J. Garcia-Luna-Aceves
    • Marc E. MoskoJose J. Garcia-Luna-Aceves
    • H04Q7/00
    • H04W40/28H04L45/18H04L45/20H04L45/32
    • One embodiment of the present invention provides a system that facilitates loop-free ad-hoc routing in a wireless network. During operation, the system advertises a local sequence number associated with a local node for a destination node, and receives a first route request at the local node, wherein the route request specifies a source node, the destination node, and a first sequence number. The system further selectively maintains a record, which indicates the source node, the destination node, the first sequence number, and a node from which the route request is received. The system also selectively forwards a second route request based on the received route request, wherein the second route request specifies the source node, the destination node, and a second sequence number which is less than the first sequence number and less than or equal to the advertised local sequence number.
    • 本发明的一个实施例提供了一种有助于无线网络中无环路自组织路由的系统。 在操作期间,系统通告与目的地节点的本地节点相关联的本地序列号,并在本地节点处接收第一路由请求,其中路由请求指定源节点,目的地节点和第一序列号。 该系统还选择性地维护指示源节点,目的地节点,第一序列号以及从其接收路由请求的节点的记录。 所述系统还基于所接收的路由请求选择性地转发第二路由请求,其中所述第二路由请求指定所述源节点,所述目的地节点和小于所述第一序列号并小于或等于所述目的节点的第二序列号 广告本地序列号。