公开(公告)号：US06754188B1

公开(公告)日：2004-06-22

申请号：US09964692

申请日：2001-09-28

Applicant: Masood Garahi ,  Peter J. Stanforth

Inventor： Masood Garahi ,  Peter J. Stanforth

IPC: H04L1256

CPC classification number: H04W40/02 ,  H04L45/306 ,  H04W40/248 ,  H04W40/28 ,  H04W80/00 ,  H04W84/18 ,  H04W88/02

Abstract: A system and method for enabling a node, such as a mobile user terminal, in a wireless communications network to route data packets to other nodes in the network based on the information contained in the data packets. The system and method employs a node, adapted for use in a wireless communications network, which comprises a controller that is adapted to examine a content of a data packet addressed to a destination node, that can have an Internet protocol (IP) address to which the data packet is addressed. Based on the content of the data packet, the controller selects a routing path including at least one of a plurality of other nodes in the network via which the data packet is to be routed to the destination node. The controller can compare the content of the data packet to routing information stored in a memory, and select the routing path based on the comparison. Depending on the whether the content is voice, video, file transfer protocol or bulk file transfer type data, to name a few, the controller can select as the routing path a routing path via which the data packet is deliverable from the node to the destination node with low latency, low bit error rate, or in a best effort manner.

Abstract translation: 一种用于使无线通信网络中诸如移动用户终端的节点能够基于包含在数据分组中的信息将数据分组路由到网络中的其他节点的系统和方法。 该系统和方法采用适于在无线通信网络中使用的节点，该节点包括适于检查寻址到目的地节点的数据分组的内容的控制器，其可以具有到其的IP地址 数据包被寻址。 基于数据分组的内容，控制器选择包括网络中的多个其他节点中的至少一个的路由路径，数据分组将经由该路由路由到目的地节点。 控制器可以将数据包的内容与存储在存储器中的路由信息​​进行比较，并根据比较选择路由路径。 根据内容是否是语音，视频，文件传输协议或批量文件传输类型数据，控制器可以选择路由路径，路由路径，数据包可以从节点到目的地传递 节点具有低延迟，低误码率或以尽力而为的方式。

公开(公告)号：US08037159B2

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

申请号：US11192560

申请日：2005-07-29

Applicant: Peter J. Stanforth

Inventor： Peter J. Stanforth

IPC: G06F15/177 ,  G06F17/30 ,  H04B1/38

CPC classification number: H04L63/08 ,  H04W12/06

Abstract: A system and method for allowing network users to securely administer and deploy network nodes (102). These networks (100) may comprise wired and/or wireless connections. Examples would include wired networks (104) with shared infrastructure in an office building, as well as ad-hoc multi-hopping peer-to-peer network applications for the home. The system and method provides a key (130) that allows new nodes (102) and thus new devices (124, 126, 132) to gain access to a network (100) via an existing node (122) of that network (100).

Abstract translation: 一种用于允许网络用户安全地管理和部署网络节点（102）的系统和方法。 这些网络（100）可以包括有线和/或无线连接。 示例将包括在办公楼中具有共享基础设施的有线网络（104）以及用于家庭的自组织多跳对等网络应用。 该系统和方法提供了一种允许新节点（102）以及因此新设备（124,126,132）经由该网络（100）的现有节点（122）访问网络（100）的密钥（130） 。

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

公开(公告)号：US07280555B2

公开(公告)日：2007-10-09

申请号：US10253422

申请日：2002-09-25

Applicant: Peter J. Stanforth ,  Larry W. Koos ,  Eric A. Whitehill

Inventor： Peter J. Stanforth ,  Larry W. Koos ,  Eric A. Whitehill

IPC: H04L12/413

CPC classification number: H04L1/1887 ,  H04W28/06 ,  H04W28/26 ,  H04W74/0816 ,  H04W84/18

Abstract: A system and method for achieving enhanced CSMA/CA which improves channel availability and quality of service (QoS) in a wireless communications network. The system and method establish channels to enable communication between nodes in a communication network, based on the relationship between the average time length of message data packets and the time lengths of the request to send and clear to send messages. A node of the communication network places a data packet at a location in a queue for retransmission based on a type of information contained in the data packet if the destination node for which the data packet is intended is unable to receive the data packet. The location in the queue is indicative of a duration of time that the node will delay before attempting to resend the data packet to the destination node.

Abstract translation: 用于实现增强的CSMA / CA的系统和方法，其提高无线通信网络中的信道可用性和服务质量（QoS）。 该系统和方法基于消息数据分组的平均时间长度与要发送和清除发送消息的请求的时间长度之间的关系建立通信，以实现通信网络中节点之间的通信。 如果数据分组所针对的目的地节点不能接收数据分组，则通信网络的节点将基于包含在数据分组中的信息的类型的数据分组放置在队列中的位置进行重传。 队列中的位置指示在尝试将数据分组重新发送到目的地节点之前节点将延迟的持续时间。

公开(公告)号：US07142524B2

公开(公告)日：2006-11-28

申请号：US10135437

申请日：2002-05-01

Applicant: Peter J. Stanforth ,  Eric A. Whitehill ,  Eric D. White

Inventor： Peter J. Stanforth ,  Eric A. Whitehill ,  Eric D. White

IPC: H04Q7/00

CPC classification number: H04W40/248 ,  H04L45/028 ,  H04W40/04 ,  H04W40/10 ,  H04W40/246 ,  H04W40/30 ,  H04W84/18

Abstract: A system and method for detecting communication requirements in a network and placing nodes in various stages of activity where conditions allow. The system and method provides an algorithm to detect changes in node activity levels and alter operations, such as update transmissions and route selections, based upon changes detected. In particular, the algorithm determines activity level at a node at each routing update interval based on factors such as a number of new destinations the node can reach, a number of route modifications that the node can implement, a number of routes from the node whose lengths have changed and a number of destinations the node can no longer reach. The node can then increase or decrease the rate that it exchanges its routing information with neighboring nodes based on an increase or decrease in this activity level.

Abstract translation: 一种用于检测网络中的通信需求并使节点处于条件允许的各种活动阶段的系统和方法。 该系统和方法提供了一种基于检测到的变化来检测节点活动级别的变化和改变操作（例如更新传输和路由选择）的算法。 特别地，该算法基于诸如节点可以达到的新目的地的数量，节点可以实现的多个路由修改等因素来确定每个路由更新间隔处的节点处的活动级别，从节点可以实现的多个路由 长度已经改变，并且节点的多个目的地不能再达到。 然后，该节点可以基于该活动级别的增加或减少来增加或减少其与相邻节点交换其路由信息的速率。