公开(公告)号：US20120155260A1

公开(公告)日：2012-06-21

申请号：US12971440

申请日：2010-12-17

Applicant: Jean-Philippe Vasseur ,  Shmuel Shaffer ,  Charles Okwudiafor ,  Sandeep Jay Shetty

Inventor： Jean-Philippe Vasseur ,  Shmuel Shaffer ,  Charles Okwudiafor ,  Sandeep Jay Shetty

IPC: H04L12/26

CPC classification number: H04L47/125 ,  H04L47/14

Abstract: In one embodiment, a receiving node in a computer network may detect congestion, and also identifies a set (e.g., subset) of its neighbor nodes. In response to the congestion, the receiving node may assign a transmission timeslot to each neighbor node of the set based on the congestion, where each neighbor is allowed to transmit (synchronously) only during its respective timeslot. The assigned timeslots may then be transmitted to the set of neighbor nodes. In another embodiment, a transmitting node (e.g., a neighbor node of the receiving node) may receive a scheduling packet from the receiving node. Accordingly, the transmitting node may determine its assigned transmission timeslot during which the transmitting node is allowed to transmit. As such, the transmitting node may then transmit packets only during the assigned timeslot (e.g., for a given time). In this manner, congestion at the receiving node may be reduced.

Abstract translation: 在一个实施例中，计算机网络中的接收节点可以检测拥塞，并且还识别其相邻节点的集合（例如子集）。 响应于拥塞，接收节点可以基于拥塞来向组中的每个相邻节点分配传输时隙，其中每个邻居仅在其相应时隙期间被允许传输（同步）。 然后可以将分配的时隙发送到相邻节点集合。 在另一个实施例中，发送节点（例如，接收节点的邻居节点）可以从接收节点接收调度分组。 因此，发送节点可以确定其发送节点被允许发送的其分配的传输时隙。 因此，发送节点可以仅在分配的时隙（例如，给定时间）期间发送分组。 以这种方式，可以减少接收节点处的拥塞。

公开(公告)号：US20120113986A1

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

申请号：US12942985

申请日：2010-11-09

Applicant: Shmuel SHAFFER ,  Jean-Philippe Vasseur ,  Sandeep Jay Shetty

Inventor： Shmuel SHAFFER ,  Jean-Philippe Vasseur ,  Sandeep Jay Shetty

IPC: H04L12/56

CPC classification number: H04L12/1868 ,  H04L1/1854 ,  H04L2001/0093

Abstract: A multicast message may be distributed by receiving, at a first node in a multicast network, a multicast message from a parent node of the first node. The multicast message is transmitted to child nodes of the first node in the multicast network. A population of the child nodes to which the multicast message was transmitted is accessed and acknowledgement messages which reveal child nodes that are among an acknowledging subset of less than all of the child nodes of the first node are received. Child nodes revealed by the received acknowledgement messages are compared with child nodes determined to be among the population of child nodes to which the multicast message is expected to be received. Based on results of the comparison, a compressed non-acknowledging subset is identified and transmitted to the parent node.

Abstract translation: 可以通过在多播网络中的第一节点处从第一节点的父节点接收多播消息来分发多播消息。 组播消息被发送到组播网络中第一个节点的子节点。 访问发送多播消息的子节点的群体，并且接收到揭示小于第一节点的所有子节点的确认子集之中的子节点的确认消息。 将接收到的确认消息所揭示的子节点与确定为预期要接收多播消息的子节点的群体中的子节点进行比较。 基于比较的结果，识别压缩的非确认子集并将其发送到父节点。

公开(公告)号：US20120113863A1

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

申请号：US12942962

申请日：2010-11-09

Applicant: Jean-Philippe Vasseur ,  Shmuel Shaffer ,  Sandeep Jay Shetty

Inventor： Jean-Philippe Vasseur ,  Shmuel Shaffer ,  Sandeep Jay Shetty

IPC: H04L12/28

CPC classification number: H04W84/18 ,  H04L12/12 ,  H04L29/06993 ,  H04L29/08027 ,  H04L29/08306 ,  H04L67/104 ,  H04W40/005 ,  H04W40/10 ,  H04W40/22 ,  Y02D70/142 ,  Y02D70/144 ,  Y02D70/22 ,  Y02D70/326 ,  Y02D70/39

Abstract: In one embodiment, a computer network may include nodes and at least one root node. A first subset of the nodes may be located along a designated path (a directed acyclic graph (DAG)) through the computer network to the root node, where the first subset of nodes is configured to operate according to a first wake-up timer. A second subset of the nodes that are not along the designated path are in communication to at least one node of the first subset of nodes along the designated path, and operate according to a second wake-up timer that is longer than the first wake-up timer. In this manner, second subset of nodes may be awake less often, e.g., conserving energy.

Abstract translation: 在一个实施例中，计算机网络可以包括节点和至少一个根节点。 节点的第一子集可以沿着指定路径（有向非循环图（DAG））通过计算机网络定位到根节点，其中第一子节点被配置为根据第一唤醒定时器来操作。 不沿着指定路径的节点的第二子集与沿着指定路径的第一节点子集的至少一个节点通信，并且根据比第一唤醒定时器长的第二唤醒定时器进行操作， up定时器。 以这种方式，节点的第二子集可以较少地唤醒，例如节约能量。

公开(公告)号：US07468951B2

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

申请号：US11049793

申请日：2005-02-02

Applicant: Lu Qian ,  Bretton Douglas ,  David Sheldon Stephenson ,  Sandeep Jay Shetty ,  Rajneesh Kumar ,  Wenfeng Huang

Inventor： Lu Qian ,  Bretton Douglas ,  David Sheldon Stephenson ,  Sandeep Jay Shetty ,  Rajneesh Kumar ,  Wenfeng Huang

IPC: H04L12/26 ,  H04L12/28 ,  H04L12/50 ,  H04Q7/00 ,  H04J3/16

CPC classification number: H04L47/283 ,  H04L47/14 ,  H04L47/15 ,  H04L47/70 ,  H04L47/801 ,  H04L47/822 ,  H04L47/824 ,  H04W24/00 ,  H04W28/10 ,  H04W48/06 ,  H04W74/004 ,  H04W76/10

Abstract: A method for evaluating number of additional admissible calls for use in call admission control includes tracking a percentage of channel busy time and transmission time of downlink and uplink voice packets, receiving a call admission request, and calculating the number of admissible calls. The number of admissible calls is calculated based on a channel bandwidth requirement determined from the percentage of channel busy time and a voice packet queuing requirement determined from the transmission time of downlink and uplink voice packets. The call admission request is approved if the number of admissible calls is greater than one and rejected if the number of admissible calls is less than one.

Abstract translation: 一种用于评估在呼叫接纳控制中使用的附加允许呼叫的数量的方法包括：跟踪下行链路和上行语音分组的频道繁忙时间和传输时间的百分比，接收呼叫许可请求，以及计算可接受呼叫的数量。 根据从通道占线时间的百分比确定的信道带宽要求和根据下行链路和上行语音数据包的发送时间确定的语音数据包排队要求，计算允许呼叫的数量。 如果可接受电话的数量大于1，通话准入请求将被批准，如果允许的呼叫数少于1，则拒绝通话。

公开(公告)号：US08842630B2

公开(公告)日：2014-09-23

申请号：US12971205

申请日：2010-12-17

Applicant: Shmuel Shaffer ,  Sandeep Jay Shetty ,  Jean-Philippe Vasseur ,  Jonathan W. Hui

Inventor： Shmuel Shaffer ,  Sandeep Jay Shetty ,  Jean-Philippe Vasseur ,  Jonathan W. Hui

IPC: H04W4/00 ,  H04W72/04 ,  H04W84/18 ,  H04W28/06 ,  H04W72/00 ,  H04B1/713

CPC classification number: H04W72/0446 ,  H04B1/713 ,  H04W28/06 ,  H04W72/00 ,  H04W84/18

Abstract: In one embodiment, a wireless transmitting node in a frequency hopping wireless network may determine whether a packet can be transmitted within a particular timeslot of a frequency hopping sequence based on a length of the packet. If unable to transmit the packet within the particular timeslot, the transmitting node extends the particular timeslot into a subsequent timeslot to allow transmission of the packet within the extended timeslot at a frequency associated with the particular timeslot. Once the extended timeslot ends, the transmitting node and receiving node hop frequencies into the subsequent timeslot to synchronize with the rest of the network that already hopped at the conventional rate. In another embodiment, a wireless receiving node may also extend the particular timeslot into a subsequent timeslot to allow reception of a packet that would extend beyond the particular timeslot, and may hop frequencies upon expiration of the extended timeslot.

Abstract translation: 在一个实施例中，跳频​​无线网络中的无线发射节点可以基于分组的长度来确定是否可以在跳频序列的特定时隙内发送分组。 如果不能在特定时隙内发送分组，则发送节点将特定时隙扩展到随后的时隙中，以允许以与特定时隙相关联的频率在扩展时隙内传输分组。 一旦扩展时隙结束，发射节点和接收节点将频率跳到随后的时隙中，以与以常规速率跳过的网络的其余部分同步。 在另一个实施例中，无线接收节点还可以将特定时隙扩展到随后的时隙中，以允许接收超出特定时隙的分组，并且可以在扩展时隙到期时跳频。

公开(公告)号：US20140006893A1

公开(公告)日：2014-01-02

申请号：US12971148

申请日：2010-12-17

Applicant: Sandeep Jay Shetty ,  Shmuel Shaffer ,  Jean-Philippe Vasseur

Inventor： Sandeep Jay Shetty ,  Shmuel Shaffer ,  Jean-Philippe Vasseur

IPC: G06F11/00

CPC classification number: H04L1/1867 ,  H04L2001/0097

Abstract: In one embodiment, a repeater node in a shared media network may intercept a shared media transmission from a first node to a second node. Once a shared media transmission is intercepted, the repeater node may determine whether the second node returns an acknowledgement (ACK) to the first node. If the second node does not return an ACK to the first node, the repeater node repeats the shared media transmission to the second node. Also, according to one or more additional embodiments of the disclosure, when receiving an ACK at the repeater node from the second node in response to the repeated shared media transmission, the repeater node may also forward the ACK from the second node to the first node.

Abstract translation: 在一个实施例中，共享媒体网络中的中继器节点可以拦截从第一节点到第二节点的共享媒体传输。 一旦共享媒体传输被拦截，则中继器节点可以确定第二节点是否向第一节点返回确认（ACK）。 如果第二节点不向第一节点返回ACK，则中继器节点重复向第二节点的共享媒体传输。 此外，根据本公开的一个或多个附加实施例，当响应于重复的共享媒体传输从第二节点在中继器节点处接收到ACK时，中继器节点还可以将ACK从第二节点转发到第一节点 。

公开(公告)号：US08447849B2

公开(公告)日：2013-05-21

申请号：US12942949

申请日：2010-11-09

Applicant: Shmuel Shaffer ,  Jean-Philippe Vasseur ,  Sandeep Jay Shetty

Inventor： Shmuel Shaffer ,  Jean-Philippe Vasseur ,  Sandeep Jay Shetty

IPC: G06F15/173

CPC classification number: H04L47/726

Abstract: In one embodiment, a node may request to join a parent node in a directed acyclic graph (DAG) in a computer network, and may notify the parent node of a load associated with the request, and whether the node has any other parent node options. The response received from the parent node may be either an acceptance or a denial (based on the load and other parent node options), where in the case of an acceptance, the node may join the parent node in the DAG. Alternatively, in response to a denial, in one embodiment, the node may perform load shedding to become acceptable to the parent node. In another embodiment, a node receiving a join request from a child node may determine an impact associated with allowing the child node (and its load) to join the receiving node in the DAG prior to returning an acceptance or denial, accordingly.

Abstract translation: 在一个实施例中，节点可以请求在计算机网络中的有向非循环图（DAG）中加入父节点，并且可以向父节点通知与该请求相关联的负载，以及节点是否具有任何其他父节点选项 。 从父节点接收的响应可以是接受或拒绝（基于负载和其他父节点选项），其中在接受的情况下，节点可以加入DAG中的父节点。 或者，响应于拒绝，在一个实施例中，节点可以执行负载切换以使得父节点变得可接受。 在另一个实施例中，从子节点接收加入请求的节点可以相应地确定与允许子节点（及其负载）在返回接受或拒绝之前在DAG中加入接收节点相关联的影响。

公开(公告)号：US20130035128A1

公开(公告)日：2013-02-07

申请号：US13195924

申请日：2011-08-02

Applicant: Douglas Chan ,  Suyog Deshpande ,  Sandeep Jay Shetty ,  David Kloper

Inventor： Douglas Chan ,  Suyog Deshpande ,  Sandeep Jay Shetty ,  David Kloper

IPC: H04W72/08 ,  H04W72/02

CPC classification number: H04W72/085

Abstract: Techniques are provided to improve the performance of wireless devices that serve wireless client devices in a wireless network in the presence of narrowband interference. The wireless device that serves wireless client devices in the wireless network receives energy in a plurality of channels of a frequency band. The received energy is analyzed for occurrence and type of interference in each channel. A quality metric is generated for each channel incorporating the occurrence and type of interference detected in the channel. For each channel, a bias value against selection of the channel is assigned based on whether narrowband interference is present in the channel. The bias value for each channel is applied to the quality metric for the channel to produce an adjusted quality metric for each channel. A channel is selected based on the adjusted quality metric for each of the plurality of channels.

Abstract translation: 提供技术来改善在存在窄带干扰的情况下为无线网络中的无线客户端设备提供服务的无线设备的性能。 为无线网络中的无线客户端设备提供的无线设备在频带的多个信道中接收能量。 分析每个通道的接收能量的发生和干扰类型。 为每个通道产生质量度量，其中包含在通道中检测到的干扰的发生和类型。 对于每个信道，基于信道中是否存在窄带干扰来分配针对信道选择的偏置值。 每个通道的偏置值被应用于通道的质量度量，以产生每个通道的调整质量度量。 基于针对多个信道中的每一个的经调整的质量度量来选择频道。

公开(公告)号：US20120155511A1

公开(公告)日：2012-06-21

申请号：US12971284

申请日：2010-12-17

Applicant: Shmuel Shaffer ,  Sandeep Jay Shetty ,  Charles Okwudiafor ,  Jean-Philippe Vasseur

Inventor： Shmuel Shaffer ,  Sandeep Jay Shetty ,  Charles Okwudiafor ,  Jean-Philippe Vasseur

IPC: H04B1/713

CPC classification number: H04B1/7156 ,  H04B1/713 ,  H04B1/7143 ,  H04B2001/71563 ,  H04W72/0453

Abstract: In one embodiment, a management device determines a topology of nodes in a network. Based on the topology, frequency hopping sequences are assigned (and notified) to the nodes such that each particular node of a certain set of the nodes is assigned a frequency hopping sequence on which to transmit that is different than frequency hopping sequences of neighbors and hidden neighbors of that particular node. In another embodiment, a transmitting node first transmits a transmission indication signal on its particular frequency band based on its frequency hopping sequence, and then transmits a message on the particular frequency band. In a further embodiment, a receiving node listening to a plurality of frequency bands may detect the transmission indication signal on the particular frequency band. In response, the receiving node filters out all frequency bands other than the particular frequency band, and receives the following transmission on that particular frequency band.

Abstract translation: 在一个实施例中，管理设备确定网络中的节点的拓扑。 基于拓扑结构，向节点分配（并通知）跳频序列，使得特定节点集合的每个特定节点被分配与其相邻的跳频序列不同的发射跳频序列，并且被隐藏 该特定节点的邻居。 在另一个实施例中，发送节点首先基于其跳频序列在其特定频带上发送传输指示信号，然后在特定频带上发送消息。 在另一个实施例中，收听多个频带的接收节点可以检测特定频带上的传输指示信号。 作为响应，接收节点滤除除了特定频带之外的所有频带，并在该特定频带上接收以下传输。

公开(公告)号：US20100177710A1

公开(公告)日：2010-07-15

申请号：US12352684

申请日：2009-01-13

Applicant: Igal GUTKIN ,  Saurabh Bhasin ,  Neil Robert Diener ,  Sandeep Jay Shetty

Inventor： Igal GUTKIN ,  Saurabh Bhasin ,  Neil Robert Diener ,  Sandeep Jay Shetty

IPC: H04W4/00

CPC classification number: H04W72/082

Abstract: In an example embodiment, an apparatus selects radio channels based on persistent interference device information. The apparatus comprises a wireless transceiver operable to communicate over a plurality of channels and channel selection logic in communication with the wireless transceiver and operable to select a channel for the wireless transceiver. The channel selection logic is operable to acquire data representative of intensity, duration and rate of occurrence for at least one persistent interference device detected by the wireless transceiver operating on at least one of the plurality of channels. The channel selection logic is operable to select a channel for the wireless transceiver based on the data representative of intensity, duration and rate of occurrence for the at least one persistent interference device.

Abstract translation: 在示例实施例中，设备基于持久干扰设备信息选择无线电信道。 该装置包括可操作以通过多个信道进行通信的无线收发机和与无线收发器通信的信道选择逻辑，并可操作以选择无线收发信机的信道。 信道选择逻辑可操作以获取表示由在多个信道中的至少一个信道上操作的无线收发器检测到的至少一个持久性干扰设备的强度，持续时间和出现率的数据。 信道选择逻辑可操作以基于表示至少一个持久干扰设备的强度，持续时间和发生速率的数据来选择无线收发信机的信道。