公开(公告)号：EP1705834A1

公开(公告)日：2006-09-27

申请号：EP06111617.4

申请日：2006-03-23

Applicant: MICROSOFT CORPORATION

Inventor： Padhye, Jitendra D. ,  Padmanabhan, Venkata N.

IPC: H04L12/26

CPC classification number: H04L43/12 ,  H04L43/0858 ,  H04L43/0882

Abstract: A new system and method of available bandwidth estimation applies even where the narrow link and tight link in a network path are in different locations. In embodiments of the invention, a unique packet probe series structure and processing is employed to estimate available bandwidth. In an embodiment of the invention, the spacing between probe packets is adjusted at the source to account for dilation caused by links leading to the tight link (311), so that the spacing is appropriate when the probes arrive at the tight link (311). Moreover, the multi-packet probe comprises a large packet (301) followed by two much smaller packets (303,305). The large packet (301) is then dropped once it has traversed the tight link (311). The two small packets (303,305), which are impacted little by subsequent narrow links, preserve the spacing set by the tight link (311), encoding the delay induced by the tight link (311), all the way to the destination.

Abstract translation: 即使在网络路径中的窄链路和紧密链路位于不同位置的情况下，也可以使用新的可用带宽估计的系统和方法。 在本发明的实施例中，使用独特的分组探测器序列结构和处理来估计可用带宽。 在本发明的一个实施例中，探测分组之间的间距在源处被调整以考虑由导致紧密连接（311）的链路引起的扩张，使得当探针到达紧密连接（311）时间隙是适当的 。 此外，多分组探测器包括大分组（301），后面是两个小得多的分组（303,305）。 一旦该数据包（301）已经穿过紧密链接（311），则丢弃该大包（301）。 由后续的窄链接影响很小的两个小包（303,305）保留由紧链接（311）设定的间隔，将由紧链接（311）引起的延迟编码到目的地。

公开(公告)号：EP1708437B1

公开(公告)日：2012-08-08

申请号：EP06111038.3

申请日：2006-03-13

Applicant: Microsoft Corporation

Inventor： Wolman, Alastair ,  Adya, Atul ,  Padhye, Jitendra D. ,  Bahl, Paramvir

IPC: H04L12/56 ,  H04L12/28

CPC classification number: H04W8/005 ,  H04W84/18

公开(公告)号：EP1357704B1

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

申请号：EP03007307.6

申请日：2003-03-31

Applicant: MICROSOFT CORPORATION

Inventor： Bahl, Paramvir ,  Adya, Atul ,  Padhye, Jitendra D.

IPC: H04L12/28 ,  H04L12/56 ,  H04Q7/38

CPC classification number: H04W52/0216 ,  H04W52/0219 ,  H04W52/0241 ,  H04W52/46 ,  H04W72/14 ,  H04W84/12 ,  H04W88/04 ,  H04W88/06 ,  Y02D70/1226 ,  Y02D70/142

Abstract: A method and system for optimizing channel access scheduling for multiple wireless computing devices over a wireless network improves channel access efficiency with respect to a primary channel. An access point, or host computer, includes a host transceiver for receiving control information from the wireless computing devices over a low power channel. Upon receiving the control information, the access point applies a scheduling algorithm to schedule channel access for the wireless computing devices to transmit data over the primary communication channel. The wireless computing devices include a low power radio for receiving scheduling information via the low power channel during idle periods. When the scheduling information is received, the wireless computing device activates its primary channel network interface components to communicate data through the primary channel. When the computing device is idle, the device is configured to power down all of its components with the exception of the circuitry required to power the low power channel. As such, the low power channel is maintained in an active state for receiving scheduling information, such as an access schedule, during both idle and non-idle periods.

公开(公告)号：EP1617608B1

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

申请号：EP05105309.8

申请日：2005-06-16

Applicant: MICROSOFT CORPORATION

Inventor： Zill, Brian D. ,  Padhye, Jitendra D. ,  Draves, Jr., Richard P.

IPC: H04L12/56

CPC classification number: H04L45/00 ,  H04L45/124 ,  H04W16/14 ,  H04W40/02 ,  H04W84/18

公开(公告)号：EP1357704A2

公开(公告)日：2003-10-29

申请号：EP03007307.6

申请日：2003-03-31

Applicant: MICROSOFT CORPORATION

Inventor： Bahl, Paramvir ,  Adya, Atul ,  Padhye, Jitendra D.

IPC: H04L12/28 ,  H04L12/56

CPC classification number: H04W52/0216 ,  H04W52/0219 ,  H04W52/0241 ,  H04W52/46 ,  H04W72/14 ,  H04W84/12 ,  H04W88/04 ,  H04W88/06 ,  Y02D70/1226 ,  Y02D70/142

Abstract: A method and system for optimizing channel access scheduling for multiple wireless computing devices over a wireless network improves channel access efficiency with respect to a primary channel. An access point, or host computer, includes a host transceiver for receiving control information from the wireless computing devices over a low power channel. Upon receiving the control information, the access point applies a scheduling algorithm to schedule channel access for the wireless computing devices to transmit data over the primary communication channel. The wireless computing devices include a low power radio for receiving scheduling information via the low power channel during idle periods. When the scheduling information is received, the wireless computing device activates its primary channel network interface components to communicate data through the primary channel. When the computing device is idle, the device is configured to power down all of its components with the exception of the circuitry required to power the low power channel. As such, the low power channel is maintained in an active state for receiving scheduling information, such as an access schedule, during both idle and non-idle periods.

Abstract translation: 用于通过无线网络优化多个无线计算设备的信道接入调度的方法和系统提高了相对于主信道的信道接入效率。 接入点或主机包括主机收发器，用于通过低功率信道从无线计算设备接收控制信息。 在接收到控制信息时，接入点应用调度算法来调度无线计算设备的信道接入以通过主通信信道发送数据。 无线计算设备包括用于在空闲时段期间经由低功率信道接收调度信息的低功率无线电。 当接收到调度信息时，无线计算设备激活其主要信道网络接口组件以通过主要信道传送数据。 当计算设备空闲时，除了为低功率通道供电所需的电路之外，该设备被配置为关闭其所有组件的电源。 因此，在空闲和非空闲时段期间，低功率信道被维持在活动状态以用于接收调度信息，例如访问调度。

公开(公告)号：EP1705834B1

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

申请号：EP06111617.4

申请日：2006-03-23

Applicant: MICROSOFT CORPORATION

Inventor： Padhye, Jitendra D. ,  Padmanabhan, Venkata N.

IPC: H04L12/26

CPC classification number: H04L43/12 ,  H04L43/0858 ,  H04L43/0882

公开(公告)号：EP1708437A1

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

申请号：EP06111038.3

申请日：2006-03-13

Applicant: Microsoft Corporation

Inventor： Wolman, Alastair ,  Adya, Atul ,  Padhye, Jitendra D. ,  Bahl, Paramvir

IPC: H04L12/56 ,  H04L12/28

CPC classification number: H04W8/005 ,  H04W84/18

Abstract: Disclosed is a Neighbor Location Discovery Protocol (NLDP) that determines the relative locations of the nodes in a mesh network. In one embodiment, NLDP can be implemented for an ad-hoc wireless network where the nodes are equipped with directional antennas and are not able to use GPS. While NLDP relies on nodes having at least two RF transceivers, it offers significant advantages over previously proposed protocols that employ only one RF transceiver. In NLDP antenna hardware is simple, easy to implement, and readily available. Further, NLDP exploits the host node's ability to operate simultaneously over non-overlapping channels to quickly converge on the neighbor's location. NLDP is limited by the range of the control channel, which operates in a omni-directional fashion. However, by choosing a low frequency band, high power, and low data rate, the range of the control channel can be increased to match the range on the data channel.

Abstract translation: 公开了一种确定网状网络中节点的相对位置的邻居位置发现协议（NLDP）。 在一个实施例中，可以为节点配备有定向天线并且不能使用GPS的自组织无线网络实现NLDP。 虽然NLDP依赖于具有至少两个RF收发器的节点，但它提供了比仅采用一个RF收发器的先前提出的协议的显着优点。 在NLDP天线硬件简单，易于实现，并且随时可用。 此外，NLDP利用主机​​节点在非重叠信道上同时操作的能力，以快速收敛在邻居的位置。 NLDP受限于以全方式运行的控制通道的范围。 然而，通过选择低频带，高功率和低数据速率，可以增加控制信道的范围以匹配数据信道上的范围。

公开(公告)号：EP1617608A1

公开(公告)日：2006-01-18

申请号：EP05105309.8

申请日：2005-06-16

Applicant: MICROSOFT CORPORATION

Inventor： Zill, Brian D. ,  Padhye, Jitendra D. ,  Draves, Jr., Richard P.

IPC: H04L12/56

CPC classification number: H04L45/00 ,  H04L45/124 ,  H04W16/14 ,  H04W40/02 ,  H04W84/18

Abstract: A system and method for link quality routing uses a weighted cumulative expected transmission time path metric. A system for routing in a multi-hop ad hoc network, and a method for measuring the link quality of a route in the network, include assignment of a weight to a link in accordance with an expected transmission time of a packet over the link, and a combining of individual link weights for a route into a path metric. The path metric accounts for interference among links that use a shared channel. In the calculation of the path metric, the expected transmission times of links that interfere with one another are added, while the expected transmission times for non-interfering links are considered separately.

Abstract translation: 一种用于链路质量路由系统和方法使用加权累计预期发送时间的路径度量。 一种用于在多跳ad hoc网络，和用于测量的路径的链路质量的网络中的方法的路由系统，包括权重分配给在雅舞蹈的链路上的分组的通过链路预期发送时间， 和用于为路径度量的路由单个链接的权重的组合。 对于链路间的干扰路径度量账户没有使用一个共享信道。 在路径量度的计算，链接的预期传输时间并彼此相加干涉，而对于非干扰链路的预期发送时间被分开考虑。

公开(公告)号：EP1357704A3

公开(公告)日：2005-10-05

申请号：EP03007307.6

申请日：2003-03-31

Applicant: MICROSOFT CORPORATION

Inventor： Bahl, Paramvir ,  Adya, Atul ,  Padhye, Jitendra D.

IPC: H04L12/28 ,  H04L12/56 ,  H04Q7/38

CPC classification number: H04W52/0216 ,  H04W52/0219 ,  H04W52/0241 ,  H04W52/46 ,  H04W72/14 ,  H04W84/12 ,  H04W88/04 ,  H04W88/06 ,  Y02D70/1226 ,  Y02D70/142

Abstract: A method and system for optimizing channel access scheduling for multiple wireless computing devices over a wireless network improves channel access efficiency with respect to a primary channel. An access point, or host computer, includes a host transceiver for receiving control information from the wireless computing devices over a low power channel. Upon receiving the control information, the access point applies a scheduling algorithm to schedule channel access for the wireless computing devices to transmit data over the primary communication channel. The wireless computing devices include a low power radio for receiving scheduling information via the low power channel during idle periods. When the scheduling information is received, the wireless computing device activates its primary channel network interface components to communicate data through the primary channel. When the computing device is idle, the device is configured to power down all of its components with the exception of the circuitry required to power the low power channel. As such, the low power channel is maintained in an active state for receiving scheduling information, such as an access schedule, during both idle and non-idle periods.