公开(公告)号：US08036168B2

公开(公告)日：2011-10-11

申请号：US12021599

申请日：2008-01-29

Applicant: Guenael T. Strutt ,  Peter B. Deoge ,  Sebnem Zorlu Ozer

Inventor： Guenael T. Strutt ,  Peter B. Deoge ,  Sebnem Zorlu Ozer

IPC: H04W4/00

CPC classification number: H04L1/0019 ,  H04L1/0003 ,  H04L1/0009 ,  H04W52/225

Abstract: A method and apparatus for link adaptation is provided. A node stores a set of transmit parameters and corresponding selection probabilities for each of the transmit parameters. The node stochastically selects a particular transmit parameter based on the selection probabilities, and then transmits a packet according to the particular selected transmit parameter. From received transmission feedback information, the node derives performance statistics, and uses the performance statistics to specify an estimated performance function for the particular transmit parameter. The node updates a selection probability computation function (SPCF), and uses the SPCF to generate updated selection probabilities corresponding to each transmit parameter in the set of available transmit parameters.

Abstract translation: 提供了一种用于链路自适应的方法和装置。 节点存储针对每个发射参数的一组发射参数和相应的选择概率。 节点根据选择概率随机选择特定的发射参数，然后根据特定的选择的发送参数发送分组。 从接收到的传输反馈信息中，节点导出性能统计信息，并使用性能统计信息来指定特定传输参数的估计性能函数。 节点更新选择概率计算功能（SPCF），并且使用SPCF来生成与可用发射参数的集合中的每个发射参数相对应的更新的选择概率。

公开(公告)号：US07656901B2

公开(公告)日：2010-02-02

申请号：US11200658

申请日：2005-08-10

Applicant: Guenael T. Strutt ,  Charles R. Barker, Jr. ,  William Vann Hasty, Jr. ,  Avinash Joshi ,  Sebnem Z. Ozer

Inventor： Guenael T. Strutt ,  Charles R. Barker, Jr. ,  William Vann Hasty, Jr. ,  Avinash Joshi ,  Sebnem Z. Ozer

IPC: H04J3/16

CPC classification number: H04W40/12 ,  H04L45/123 ,  H04W28/06 ,  H04W28/22 ,  H04W40/02 ,  H04W80/02 ,  H04W84/18 ,  H04W92/18

Abstract: A system and method that creates an abstraction of the physical layer of a wireless communication network (100), in particular, a wireless ad-hoc peer-to-peer communication network (100), and that normalizes the feedback from the physical layer to enable multiple types of nodes (102, 106, 107) in the wireless network to operate using a common wireless routing protocol. This routing protocol uses a link quality metric to determine the best route regardless of how it actually chooses the route or disseminates such link quality information. The generalized routing metric can be derived for any node (102, 106, 107), regardless of its relative performance or its media access control (MAC) technology. The system and method also create a transaction summary that can be used for link adaptation and link quality estimation to determine, for example, future data rates, link quality/routing metrics, and transmit powers.

Abstract translation: 一种创建无线通信网络（100），特别是无线自组织对等通信网络（100）的物理层的抽象的系统和方法，并且将来自物理层的反馈归一化为 使无线网络中的多种类型的节点（102,106,107）能够使用公共无线路由协议进行操作。 该路由协议使用链路质量度量来确定最佳路由，而不管实际选择路由或传播此类链路质量信息。 可以为任何节点（102,106,107）导出广义路由度量，而不管其相对性能或其媒体访问控制（MAC）技术如何。 系统和方法还创建可用于链路自适应和链路质量估计的事务摘要，以确定例如将来的数据速率，链路质量/路由度量和发射功率。

公开(公告)号：US07512074B2

公开(公告)日：2009-03-31

申请号：US10986698

申请日：2004-11-12

Applicant: Guenael T. Strutt ,  Avinash Joshi

Inventor： Guenael T. Strutt ,  Avinash Joshi

IPC: H04L12/26

CPC classification number: H04L45/26 ,  H04L45/02 ,  H04W40/28

Abstract: The present invention provides a system and method for evaluating the performance of a potential route before it is actually established. In a wireless network, when a trigger is received by a source node that suggests the existence of a better route, the source node sends a scouting packet along the suggested route. The scouting packet collects statistics related to the suggested route, without establishing the route while the scouting packet traverses the route. The metric for the suggested route, which is derived from the statistics collected by the scouting packet, is compared to the metric for the current route. If the metric for the suggested route is preferable to that of the current route, the suggested route is established as a new route.

Abstract translation: 本发明提供一种用于在实际建立之前评估潜在路线的性能的系统和方法。 在无线网络中，当源节点接收到建议存在更好路由的触发器时，源节点沿建议的路由发送一个侦察包。 侦察包收集与建议路由相关的统计信息，而不会在侦测包穿越路由时建立路由。 将由侦察包收集的统计数据导出的建议路由的度量与当前路由的度量进行比较。 如果建议路由的度量优于当前路由的度量，则建议的路由建立为新路由。

公开(公告)号：US08184610B2

公开(公告)日：2012-05-22

申请号：US12327481

申请日：2008-12-03

Applicant: Guenael T. Strutt ,  Charles R. Barker ,  Keith J. Goldberg

Inventor： Guenael T. Strutt ,  Charles R. Barker ,  Keith J. Goldberg

IPC: H04B7/212

CPC classification number: H04W48/12

Abstract: A method of adaptive beaconing includes operating a node within an ad hoc wireless communication network to calculate a probability P for an interval of time I; transmit a beacon when a uniformly distributed random number is less than the probability P; and wait for the interval of time “I” and repeat the calculate, transmit, and waiting operations when the uniformly distributed random number is greater than the probability P.

Abstract translation: 自适应信标的方法包括操作自组织无线通信网络内的节点以计算时间间隔I的概率P; 当均匀分布的随机数小于概率P时，发送信标; 并且等待时间间隔“I”，并且当均匀分布的随机数大于概率P时，重复计算，发送和等待操作。

公开(公告)号：US07734809B2

公开(公告)日：2010-06-08

申请号：US10863453

申请日：2004-06-07

Applicant: Avinash Joshi ,  Surong Zeng ,  Guenael T. Strutt

Inventor： Avinash Joshi ,  Surong Zeng ,  Guenael T. Strutt

IPC: G06F15/16

CPC classification number: H04W4/14

Abstract: A system and method for data transmission using a multichannel medium access control (MAC) protocol to send small messages on the reservation channel directly without any RTS/CTS handshake or channel switching delays. The message is assigned a special type so that it can be distinguished from the RTS/CTS message. The message can also include information about congestion, activity, device type, mobility level, and so forth.

Abstract translation: 一种用于使用多通道介质访问控制（MAC）协议进行数据传输的系统和方法，用于在预留信道上直接发送小消息，而无需任何RTS / CTS握手或信道切换延迟。 该消息被分配一种特殊类型，以便可以将其与RTS / CTS消息进行区分。 该消息还可以包括关于拥塞，活动，设备类型，移动性等级的信息。

公开(公告)号：US20100056174A1

公开(公告)日：2010-03-04

申请号：US12202127

申请日：2008-08-29

Applicant: Keith J. Goldberg ,  Charles R. Barker ,  Peter B. Doege ,  Guenael T. Strutt

Inventor： Keith J. Goldberg ,  Charles R. Barker ,  Peter B. Doege ,  Guenael T. Strutt

IPC: H04Q7/20

CPC classification number: H04W64/003 ,  G01S5/0289 ,  G01S13/767 ,  H04W8/005

Abstract: A method for proximity detection in a wireless communication network. A node attempts to determine the proximity of the closest neighboring node by transmitting a ranging request. Other nodes respond, and the first node to receive and respond to the request will have the shortest response time and thus will be the closest node. Exact ranges can be determined by applying Time-Of-Arrival (TOA) techniques to node response times. To further avoid collisions, one or more frames of the response messages can be same, making the multiple responses appear as multi-path. The group of responders can be narrowed and individual groups probed in a search pattern until the single nearest node is known or range of the nearest node is known. The ranging node may then use ordinary unicast mechanisms to probe this node, or begin scanning the groups again, or interleave the two mechanisms as desired.

Abstract translation: 一种用于无线通信网络中的接近检测的方法。 节点尝试通过发送测距请求来确定最近邻近节点的邻近度。 其他节点响应，而接收和响应请求的第一个节点将具有最短的响应时间，因此将是最接近的节点。 可以通过将到达时间（TOA）技术应用于节点响应时间来确定精确范围。 为了进一步避免冲突，响应消息的一个或多个帧可以相同，使多个响应显示为多路径。 可以缩小响应者组，并且以搜索模式探索个体组，直到知道单个最近节点或者知道最近节点的范围。 然后，测距节点可以使用普通单播机制来探测该节点，或者再次开始扫描组，或者根据需要交织两个机制。

公开(公告)号：US20090154359A1

公开(公告)日：2009-06-18

申请号：US11954681

申请日：2007-12-12

Applicant: Guenael T. Strutt ,  Shyamal Ramachandran ,  Peter J. Stanforth

Inventor： Guenael T. Strutt ,  Shyamal Ramachandran ,  Peter J. Stanforth

IPC: G08C15/00 ,  H04L12/26 ,  H04L12/56

CPC classification number: H04L45/22 ,  H04L41/5025 ,  H04L43/045 ,  H04L43/0882 ,  H04L43/0894 ,  H04L45/00 ,  H04L45/12 ,  H04L45/42 ,  H04W40/02 ,  H04W84/22

Abstract: A method for calculating service redundancy of a wireless network is provided. The method comprises determining one or more of a plurality of routes through which a node can communicate to reach a destination. A routing metric is calculated for each of the plurality of routes. Using the calculated routing metrics a route having a best routing metric is identified as a best route to the destination. Service redundancy for each node within the wireless network is calculated using a sum of weighted ratios of the best routing metric to at least one alternate routing metric.

Abstract translation: 提供了一种用于计算无线网络的业务冗余的方法。 该方法包括确定节点可以通过哪些路由到达目的地的一个或多个路由。 为多个路由中的每个路由计算路由度量。 使用计算的路由度量，具有最佳路由度量的路由被标识为到达目的地的最佳路由。 使用最佳路由度量与至少一个替代路由度量的加权比的总和来计算无线网络内的每个节点的服务冗余。

公开(公告)号：US20080165692A1

公开(公告)日：2008-07-10

申请号：US11619827

申请日：2007-01-04

Applicant: Guenael T. Strutt ,  Shyamal Ramachandran ,  Sebnem Zorlu Ozer

Inventor： Guenael T. Strutt ,  Shyamal Ramachandran ,  Sebnem Zorlu Ozer

IPC: G08C15/00

CPC classification number: H04L67/06 ,  H04L67/04 ,  H04L67/1095 ,  H04W84/18

Abstract: A method is provided for communicating data items across one or more disjoined networks. The method comprises receiving a message including a data item information list having data item information associated with each of one or more data items stored in a node of the disjoined networks; ranking each of the data items based on each of the associated data item information; comparing each of the associated data item information of the ranked data items with a local data index information list to select one or more data items requiring updating; and sending a request for updating the selected data items.

Abstract translation: 提供一种用于在一个或多个分离网络上传送数据项的方法。 该方法包括：接收消息，该消息包括具有数据项信息的数据项信息列表，该数据项信息列表与存储在所述分离网络的节点中的一个或多个数据项中的每一个相关联; 基于每个相关联的数据项信息对每个数据项进行排序; 将排序数据项的相关联的数据项信息与本地数据索引信息列表进行比较，以选择需要更新的一个或多个数据项; 并发送更新所选数据项的请求。

公开(公告)号：US20080026770A1

公开(公告)日：2008-01-31

申请号：US11461178

申请日：2006-07-31

Applicant: Pavan K. Rudravaram ,  Keith J. Goldberg ,  Guenael T. Strutt

Inventor： Pavan K. Rudravaram ,  Keith J. Goldberg ,  Guenael T. Strutt

IPC: H04Q7/20

CPC classification number: H04W64/00 ,  G01S5/0289 ,  G01S5/14 ,  H04W4/029 ,  H04W4/043

Abstract: A method and apparatus for calculating a location of a device is provided. A likelihood of the device being located at a particular location point or a particular location floor is determined using a likelihood calculation at each of a plurality of locations. The location point or location floor is then identified as that location having an associated highest likelihood calculation. The likelihood calculation includes calculating a distance from the device to each of a plurality of reference routers including one or more virtual coplanar reference routers, wherein each of the one or more virtual coplanar reference routers comprise a projection of a non-coplanar reference router onto the floor.

Abstract translation: 提供了一种用于计算设备位置的方法和装置。 使用在多个位置的每个位置处的似然率计算来确定设备位于特定位置点或特定位置底层的可能性。 然后将位置点或位置楼层识别为具有相关联的最高似然率计算的位置。 可能性计算包括计算从设备到包括一个或多个虚拟共面参考路由器的多个参考路由器中的每一个的距离，其中一个或多个虚拟共面参考路由器中的每一个包括非共面参考路由器的投影到 地板。

公开(公告)号：US08068428B2

公开(公告)日：2011-11-29

申请号：US11269931

申请日：2005-11-09

Applicant: Guenael T. Strutt ,  Sebnem Z. Ozer ,  Shyamal Ramachandran

Inventor： Guenael T. Strutt ,  Sebnem Z. Ozer ,  Shyamal Ramachandran

IPC: H04J3/14 ,  H04J1/16 ,  H04Q7/24

CPC classification number: H04W52/286 ,  H04W52/24 ,  H04W52/267 ,  H04W52/46

Abstract: A system and method for performing topology control in a wireless network (100). The system and method operate to enable a node (102-1) to determine the link cost of a link between itself and another node (102-2), based on the number of nodes (102, 106, 107) that would be affected by message transmission by the node (102) and the other node (102-2), and the number of nodes (102, 106, 107) that would be affected by message reception by the node (102-1) and the other node (102-2). The number of nodes (102, 106, 107) affected by the message transmission and message reception at the node (102-1) and the other node (102-2) is affected by the transmit power of the control messages sent by the node (102-1) and the other node (102-2). The node (102-1) further bases routing decisions on the calculated link costs.

Abstract translation: 一种用于在无线网络（100）中执行拓扑控制的系统和方法。 该系统和方法操作以使得节点（102-1）能够基于将被影响的节点（102,106,107）的数量来确定其本身与另一节点（102-2）之间的链路的链路成本 通过由节点（102）和另一个节点（102-2）发送的消息以及将被节点（102-1）和另一个节点（102-1）的消息接收影响的节点数目（102,106,107） （102-2）。 由节点（102-1）和另一节点（102-2）处的消息传输和消息接收所影响的节点数（102,106,107）受节点发送的控制消息的发送功率的影响 （102-1）和另一个节点（102-2）。 节点（102-1）进一步基于所计算的链路成本的路由决定。