公开(公告)号：US20090022136A1

公开(公告)日：2009-01-22

申请号：US11781015

申请日：2007-07-20

申请人： Avinash Joshi ,  Manish Shukla

发明人： Avinash Joshi ,  Manish Shukla

IPC分类号： H04B7/212

CPC分类号： H04B7/2123

摘要： When a source node (SN) seeks to transmit a first communication stream (FCS) to a destination node (DN), a method is provided for allowing the SN to preempt a lower priority communication stream (LPCS). User priorities are supported during slot scheduling based on stream-identifiers (IDs) and stream priority values exchanged by each of the nodes. A scout request message (SRM), which includes a stream ID and a user priority value of the SN, is transmitted to a next-hop node along a route towards the DN. A node along the route determines if free time slots are available along the route to meet QoS requirements of the FCS, and if not, the node determines whether there is a LPCS in the neighborhood, and if so, the node frees the particular time slots currently being used by the LPCS, and allocates the particular time slots for the FCS.

摘要翻译： 当源节点（SN）寻求将第一通信流（FCS）发送到目的地节点（DN）时，提供一种允许SN抢占较低优先级的通信流（LPCS）的方法。 基于流标识符（ID）和每个节点交换的流优先级值，在时隙调度期间支持用户优先级。 包括流ID和SN的用户优先级值的侦察请求消息（SRM）沿着朝向DN的路由发送到下一跳节点。 沿着该路线的一个节点确定空闲时隙是否可用于路由以满足FCS的QoS要求，如果不是，该节点确定邻域中是否存在LPCS，如果是，则节点释放特定的时隙 当前由LPCS使用，并为FCS分配特定的时隙。

公开(公告)号：US20080316966A1

公开(公告)日：2008-12-25

申请号：US11767171

申请日：2007-06-22

申请人： Avinash Joshi ,  Manish Shukla

发明人： Avinash Joshi ,  Manish Shukla

IPC分类号： H04Q7/00

CPC分类号： H04W74/02 ,  H04W28/06 ,  H04W74/0808 ,  H04W84/18

摘要： A hybrid TDMA-CSMA MAC protocol is provided for allocating time slots within a frame having a structure in which transmission time is divided into a first number of actual TDMA time slots and a second number of “virtual” CSMA time slots. Each time a given node receives a Hello message, it can calculate variables based on an HSN field. A ratio of the first number to the second number can be dynamically adjusted depending upon the traffic conditions. When TDMA time slots within the frame are freed (e.g., no longer being used), slot position optimization techniques are provided for moving these freed TDMA time slots back into the CSMA portion of the frame and reallocating or moving other TDMA time slots into the portion of the frame that was previously occupied by the freed TDMA time slots to thereby maximize resource utilization.

摘要翻译： 提供了一种混合TDMA-CSMA MAC协议，用于在具有传输时间被划分为第一数量的实际TDMA时隙和第二数量的“虚拟”CSMA时隙的结构的帧内分配时隙。 每次给定节点接收到一个Hello消息时，它可以根据HSN字段计算变量。 可以根据交通状况来动态地调整第一数量与第二数量的比率。 当帧内的TDMA时隙被释放（例如，不再被使用）时，提供时隙位置优化技术，用于将这些释放的TDMA时隙移回到帧的CSMA部分，并将其他TDMA时隙重新分配或移动到该部分中 先前被释放的TDMA时隙占据的帧，从而最大化资源利用率。

公开(公告)号：US20080112371A1

公开(公告)日：2008-05-15

申请号：US11560113

申请日：2006-11-15

申请人： Avinash Joshi ,  Manish Shukla

发明人： Avinash Joshi ,  Manish Shukla

IPC分类号： H04J3/00 ,  H04L12/413

CPC分类号： H04L12/66 ,  H04W72/0446 ,  H04W74/02 ,  H04W84/18

摘要： A hybrid TDMA-CSMA MAC protocol is provided for allocating time slots within a frame having a structure in which transmission time is divided into a first number of actual TDMA time slots and a second number of “virtual” CSMA time slots. Each of the nodes in a multi-hop network can transmit a Highest Slot Number (HSN) field. Each time one of the Hello messages is received from a neighbor node, a given node can calculate variables based on the HSN field. The given node can use these variables to calculate a ratio of the first number to the second number. This ratio can be dynamically adjusted depending upon the traffic conditions observed by nodes within the multi-hop ad hoc network at any particular time to thereby change the relative percentages of the frame which are allocated for a TDMA portion and a CSMA portion of the frame.

摘要翻译： 提供了一种混合TDMA-CSMA MAC协议，用于在具有传输时间被划分为第一数量的实际TDMA时隙和第二数量的“虚拟”CSMA时隙的结构的帧内分配时隙。 多跳网络中的每个节点可以发送最高时隙号（HSN）字段。 每当从邻居节点接收到一个Hello消息时，给定节点可以基于HSN字段计算变量。 给定节点可以使用这些变量来计算第一个数字与第二个数字的比率。 该比率可以根据在任何特定时间的多跳自组织网络内的节点观察到的业务条件来动态地调整，从而改变为TDMA部分分配的帧和帧的CSMA部分的相对百分比。

公开(公告)号：US07251238B2

公开(公告)日：2007-07-31

申请号：US11221135

申请日：2005-09-07

申请人： Avinash Joshi ,  Surong Zeng ,  William Vann Hasty, Jr. ,  Charles R. Barker, Jr. ,  Robin U. Roberts ,  Keith J. Goldberg

发明人： Avinash Joshi ,  Surong Zeng ,  William Vann Hasty, Jr. ,  Charles R. Barker, Jr. ,  Robin U. Roberts ,  Keith J. Goldberg

IPC分类号： H04Q7/24 ,  H04L12/28

CPC分类号： H04W40/36 ,  H04L45/02 ,  H04W40/22 ,  H04W40/24 ,  H04W40/28 ,  H04W40/30 ,  H04W84/18 ,  H04W84/22 ,  H04W88/08 ,  H04W88/182

摘要： A method and system for routing data in a wireless network (400) that enables all nodes (106, 402, 404, 406, 408) to find routes to each other even if the nodes are incapable of operating as a router to route packets received from other nodes (106, 402, 404, 406, 408). The meshed nodes (106, 402) which are capable of performing packet routing act as proxy nodes for their associated non-meshed nodes (STA 13-STA 15) to route packets from their associated non-meshed nodes (STA 13-STA 15) to destination nodes. Some of the meshed nodes further operate as intelligent access points (106) to provide the non-meshed nodes and other meshed nodes with access to other networks, such as the Internet (402).

摘要翻译： 一种用于在无线网络（400）中路由数据的方法和系统，其使得所有节点（106,402,404,406,408）能够找到彼此的路由，即使节点不能作为路由器操作以路由分组 来自其他节点（106,402,404,406,408）。 能够执行分组路由的网状节点（106,402）作为其相关联的非网格节点（STA 13 -STA 15）的代理节点，用于路由来自其相关联的非网格节点（STA 13 -STA 15）的分组， 到目标节点。 一些网状节点进一步作为智能接入点（106）来操作，以向非网状节点和其他网状节点提供对诸如因特网（402）的其他网络的访问。

公开(公告)号：US20070160009A1

公开(公告)日：2007-07-12

申请号：US11329239

申请日：2006-01-10

申请人： Avinash Joshi

发明人： Avinash Joshi

IPC分类号： H04Q7/00

CPC分类号： H04W40/14 ,  H04W40/24

摘要： Techniques are provided for determining mobility of a first node in an ad hoc network. A particular node generates a fixed neighbor node table comprising second nodes in the area of the particular node which are not mobile. The particular node can monitor changes between the first node and the second nodes, and then determine if the first node is mobile based on the changes.

摘要翻译： 提供了用于确定自组织网络中的第一节点的移动性的技术。 特定节点生成固定的邻居节点表，该表包括特定节点的不是移动的区域中的第二节点。 特定节点可以监视第一节点和第二节点之间的变化，然后基于变化确定第一节点是否是移动的。

公开(公告)号：US20060098608A1

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

申请号：US10982837

申请日：2004-11-08

申请人： Avinash Joshi

发明人： Avinash Joshi

IPC分类号： G08C15/00

CPC分类号： H04L45/123 ,  H04L45/124 ,  H04L45/26 ,  H04W40/02 ,  H04W40/12 ,  H04W40/14 ,  H04W40/24 ,  H04W40/28

摘要： A system and method for decreasing the route convergence time in a wireless communication network, such as a wireless ad-hoc peer-to-peer network, by finding an alternate route if the nodes anticipate weakening or breakage of a route currently in use. The system and method which enables reactive routing protocols to find optimal routes between nodes in these types of networks when those routes cannot otherwise be found in certain conditions. The system and method thus decrease the route convergence time, provide an effective and efficient way to find optimal routes, and improve overall performance of the network with regard to throughput, delay, packet completion rate and other factors.

摘要翻译： 一种用于在无线通信网络（诸如无线自组织对等网络）中减少路由收敛时间的系统和方法，通过在节点预期当前使用的路由减弱或破坏的情况下找到备用路由。 当在某些条件下不能找到这些路由时，使得反应路由协议能够在这些类型的网络中的节点之间找到最佳路由的系统和方法。 系统和方法因此减少了路由收敛时间，提供了一种有效而有效的方法来找到最优路由，并提高了吞吐量，延迟，数据包完成率等因素对网络的整体性能。

公开(公告)号：US20060098607A1

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

申请号：US10975587

申请日：2004-10-28

申请人： Surong Zeng ,  Avinash Joshi

发明人： Surong Zeng ,  Avinash Joshi

IPC分类号： H04Q7/24

CPC分类号： H04L45/16 ,  H04W4/08 ,  H04W40/00 ,  H04W40/26 ,  H04W84/18

摘要： Provided is a system and method for a multicast routing algorithm to work in infrastructure based mesh networks. It chooses access points, fixed infrastructure gateway nodes connected to each other and/or the global internet via a wired/wireless backbone, as a group of local multicast group leaders to form a multicast group leader cloud. Each local multicast group leader is elected on-demand according to the local multicast group member's request. Each local multicast group leader forms a local multicast tree rooted at this leader connecting all multicast group members associated with the AP. The processes of electing and maintaining local multicast trees rooted at APs enable efficient coordination with underlying unicast routing to exploit the advantages of fixed infrastructure nodes. Therefore, routing overhead and multicast tree convergence time are reduced. The method can support large networks with fast topology change due to fast convergence and reduced routing overhead.

公开(公告)号：US20060072530A1

公开(公告)日：2006-04-06

申请号：US11238573

申请日：2005-09-29

申请人： Guenael Strutt ,  Avinash Joshi

发明人： Guenael Strutt ,  Avinash Joshi

IPC分类号： H04Q7/24

CPC分类号： H04W99/00

摘要： A system and method for avoiding collisions between packets transmitted in a wireless network (100). A first node (102, 106 or 107) in the wireless network (100) can transmit a packet to a second node (102, 106 or 107) in the wireless network (100), such that packet includes a header that is transmitted with a higher processing gain than the data, therefore, may be received and processed by a third node (102, 106 or 107. This allows the third node (102, 106 or 107) to detect the transmission of a packet by the first node (102, 106 or 107), which can cause the third node (102, 106 or 107) to avoid transmission of a packet during the transmission by the first node (102, 106 or 107) to avoid collision between the packets. The system and method further enables the nodes (102, 106 or 107) to determine whether they can transmit to another node (102, 106 or 107) based on estimates of interference conditions that can be experienced due to the presence of other nodes (102, 106 or 107).

摘要翻译： 一种用于避免在无线网络（100）中发送的分组之间的冲突的系统和方法。 无线网络（100）中的第一节点（102,106或107）可以将分组发送到无线网络（100）中的第二节点（102,106或107），使得分组包括与第 因此，可以由第三节点（102,106或107）接收并处理比数据更高的处理增益。这允许第三节点（102,106或107）检测由第一节点发送的分组的传输（ 102,106或107），其可以导致第三节点（102,106或107）在第一节点（102,106或107）的传输期间避免分组的传输，以避免分组之间的冲突，系统和 基于由于存在其他节点（102,106或107）可能会经历的干扰条件的估计，节点（102,106或107）能够确定它们是否可以发送到另一节点（102,106或107） 107）。

公开(公告)号：US08995354B2

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

申请号：US12433688

申请日：2009-04-30

申请人： Hrishikesh Gossain ,  Charles R. Barker ,  Keith J. Goldberg ,  Avinash Joshi

发明人： Hrishikesh Gossain ,  Charles R. Barker ,  Keith J. Goldberg ,  Avinash Joshi

IPC分类号： H04W4/00 ,  H04W40/02 ,  H04L12/751 ,  H04W40/24 ,  H04W84/18

CPC分类号： H04W40/02 ,  H04L45/026 ,  H04W40/24 ,  H04W84/18

摘要： A method provides for selecting a communication interface towards an access point by a wireless communication device. The method includes receiving one or more HELLO messages from the access point; determining whether any of a plurality of communication links is being used to reach the access point by evaluating at least one field of each of the received HELLO messages; penalizing a link metric of a communication link when the communication link is being used; and selecting a communication interface towards the access point, wherein the selected communication interface is coupled to a best communication link having a best link metric.

摘要翻译： 一种方法提供用于通过无线通信设备选择朝向接入点的通信接口。 该方法包括从接入点接收一个或多个HELLO消息; 通过评估所接收的每个HELLO消息的至少一个字段来确定是否正在使用多个通信链路中的任何一个来到达所述接入点; 当使用通信链路时惩罚通信链路的链路度量; 以及向所述接入点选择通信接口，其中所选择的通信接口耦合到具有最佳链路度量的最佳通信链路。

公开(公告)号：US08798034B2

公开(公告)日：2014-08-05

申请号：US12415687

申请日：2009-03-31

申请人： Pankaj Aggarwal ,  Hrishikesh Gossain ,  Avinash Joshi ,  Manish Shukla

发明人： Pankaj Aggarwal ,  Hrishikesh Gossain ,  Avinash Joshi ,  Manish Shukla

IPC分类号： H04L12/26 ,  H04L12/28

CPC分类号： H04W40/02 ,  H04L45/123 ,  H04L45/124

摘要： Systems and methods are provided for determining a link metric for a communication link along a path between a source node to a destination node is provided. A node can generate a link metric (LM) for the communication link between the particular node and next-hop node towards the destination node in the path based on a plurality of variables. The node can determine the LM for the communication link based on a plurality of variables including: bandwidth on the communication link, a number of spatial streams used to transmit over the communication link, and a guard interval used used to transmit over the communication link.

摘要翻译： 提供了用于确定沿着源节点到目的地节点之间的路径的通信链路的链路度量的系统和方法。 基于多个变量，节点可以针对路径中的目的节点向特定节点和下一跳节点之间的通信链路生成链路量度（LM）。 节点可以基于多个变量来确定通信链路的LM，包括：通信链路上的带宽，用于通过通信链路传输的空间流的数量，以及用于通过通信链路传输的保护间隔。