公开(公告)号：US20070174465A1

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

申请号：US11275670

申请日：2006-01-24

申请人： Jian Huang ,  Wayne Chiou ,  Qicai Shi

发明人： Jian Huang ,  Wayne Chiou ,  Qicai Shi

IPC分类号： G06F15/16

CPC分类号： H04W52/0261 ,  H04W84/18 ,  Y02D70/144 ,  Y02D70/162 ,  Y02D70/22

摘要： A method and apparatus for determining a node's proper duty cycle is provided herein. All nodes (500) within a network (100) will interactively switch duty-cycles based on a number of hops a device is from a personal area network coordinator PNC. Changing duty cycles based on a number of hops from a PNC assures that spatial patterns of duty-cycles form in a network to maximize data throughput and minimize network wide power consumptions.

摘要翻译： 本文提供了一种用于确定节点的适当占空比的方法和装置。 网络（100）内的所有节点（500）将基于设备来自个人区域网络协调器PNC的跳数来交互地切换占空比。 基于来自PNC的跳数来改变占空比确保在网络中形成占空比的空间模式以最大化数据吞吐量并最大限度地减少网络功耗。

公开(公告)号：US07715352B2

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

申请号：US11275670

申请日：2006-01-24

申请人： Jian Huang ,  Wayne Chiou ,  Qicai Shi

发明人： Jian Huang ,  Wayne Chiou ,  Qicai Shi

IPC分类号： H04W4/00

CPC分类号： H04W52/0261 ,  H04W84/18 ,  Y02D70/144 ,  Y02D70/162 ,  Y02D70/22

摘要： A method and apparatus for determining a node's proper duty cycle is provided herein. All nodes (500) within a network (100) will interactively switch duty-cycles based on a number of hops a device is from a personal area network coordinator PNC. Changing duty cycles based on a number of hops from a PNC assures that spatial patterns of duty-cycles form in a network to maximize data throughput and minimize network wide power consumptions.

摘要翻译： 本文提供了一种用于确定节点的适当占空比的方法和装置。 网络（100）内的所有节点（500）将基于设备来自个人区域网络协调器PNC的跳数来交互地切换占空比。 基于来自PNC的跳数来改变占空比确保在网络中形成占空比的空间模式以最大化数据吞吐量并最大限度地减少网络功耗。

公开(公告)号：US20060023689A1

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

申请号：US10901580

申请日：2004-07-29

申请人： Vernon Allen ,  Wayne Chiou ,  Ralph D'Souza ,  Robert O'Dea ,  Minh Pham ,  Saritha Sivapuram

发明人： Vernon Allen ,  Wayne Chiou ,  Ralph D'Souza ,  Robert O'Dea ,  Minh Pham ,  Saritha Sivapuram

IPC分类号： H04B7/216

CPC分类号： H04W40/02 ,  H04W84/042 ,  H04W84/18

摘要： In order to set up efficient routes between two closely-located nodes an optimized route for two nodes within a hybrid-cellular network (HCN) is achieved by converting an HCN route to an ad-hoc route. Thus, a node within the communication system may originally be communicating with another node via an HCN route and then instructed to switch to a more efficient ad-hoc route for communication with the node.

摘要翻译： 为了在两个紧密定位的节点之间建立有效的路由，通过将HCN路由转换为自组织路由，实现混合蜂窝网络（HCN）内的两个节点的优化路由。 因此，通信系统内的节点最初可以经由HCN路由与另一节点进行通信，然后被指示切换到用于与节点通信的更有效的自组织路由。

公开(公告)号：US20070066308A1

公开(公告)日：2007-03-22

申请号：US11219929

申请日：2005-09-06

申请人： Oleg Andric ,  Vernon Allen ,  Wayne Chiou ,  Ralph D'Souza ,  Yan Huang ,  Minh Pham

发明人： Oleg Andric ,  Vernon Allen ,  Wayne Chiou ,  Ralph D'Souza ,  Yan Huang ,  Minh Pham

IPC分类号： H04Q7/20

CPC分类号： H04W40/32 ,  H04L45/28 ,  H04L45/46 ,  H04L45/48 ,  H04W8/005 ,  H04W84/18

摘要： A method and apparatus for removing phantom children in an ad-hoc network is described herein. During operation messaging between the parent and child nodes allows the parent node to detect when a node has become a phantom node, and take action to correct it. In particular a maintenance message is periodically transmitted by every node in the network to its parent. The maintenance message is designed to inform the parent of at least a unique identifier of the child. The parent can then compare this unique identifier of the child to others associated with the parent to determine if the child is the real child or a phantom child. Corrective action is taken when a phantom node is detected.

摘要翻译： 这里描述了一种用于去除自组织网络中的虚拟儿童的方法和装置。 在父节点和子节点之间的操作消息传递期间，允许父节点检测节点何时成为虚拟节点，并采取措施进行纠正。 特别地，维护消息由网络中的每个节点周期性地发送到其父节点。 维护消息旨在通知父母至少一个孩子的唯一标识符。 父母然后可以将该独特的孩子标识符与与父母相关的其他标识符进行比较，以确定孩子是真正的孩子还是幻影小孩。 当检测到虚拟节点时，采取纠正措施。

公开(公告)号：US20060205409A1

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

申请号：US11074910

申请日：2005-03-08

申请人： Wayne Chiou ,  Vernon Allen ,  Oleg Andric ,  Ralph D'Souza ,  Minh Pham

发明人： Wayne Chiou ,  Vernon Allen ,  Oleg Andric ,  Ralph D'Souza ,  Minh Pham

IPC分类号： H04Q7/20

CPC分类号： H04W40/246 ,  H04W76/10 ,  H04W84/18

摘要： When a requesting node (402) has routing capabilities and attempts to join a network and there are no association slots available, the requesting node (402) will send an association message to a potential root node (401). If the root node (401) has reached the maximum number of links, and has a non-routing capable node (403) associated with it, the root node (401) will send a message to the non-routing capable node (403), instructing it to disassociate and attempt to re-associate at a later time. A message is then sent to the requesting node (402) for it to associate with the root node (401).