公开(公告)号：US07656804B2

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

申请号：US10919139

申请日：2004-08-16

申请人： Qicai Shi ,  Jian Huang ,  Yan Huang

发明人： Qicai Shi ,  Jian Huang ,  Yan Huang

IPC分类号： H04L12/28

CPC分类号： H04L29/12009 ,  H04L29/12207 ,  H04L29/12801 ,  H04L61/20 ,  H04L61/6004 ,  H04W8/26 ,  H04W84/18

摘要： An ad-hoc communication system is established where each node within the system may have multiple children nodes and parent nodes. An address scheme is proposed where each node may comprise more than one address, each address being based upon one of the parent's address. Because each node may have more than one parent, a bridge, or shortcut may exist between network branches.

摘要翻译： 建立一个自组织通信系统，其中系统内的每个节点可以具有多个子节点和父节点。 提出了一种地址方案，其中每个节点可以包括多于一个地址，每个地址基于父母地址之一。 因为每个节点可能有多个父节点，所以网络分支之间可能存在网桥或快捷方式。

公开(公告)号：US20060034193A1

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

申请号：US10919139

申请日：2004-08-16

申请人： Qicai Shi ,  Jian Huang ,  Yan Huang

发明人： Qicai Shi ,  Jian Huang ,  Yan Huang

IPC分类号： H04L12/28

CPC分类号： H04L29/12009 ,  H04L29/12207 ,  H04L29/12801 ,  H04L61/20 ,  H04L61/6004 ,  H04W8/26 ,  H04W84/18

摘要： An ad-hoc communication system is established where each node within the system may have multiple children nodes and parent nodes. An address scheme is proposed where each node may comprise more than one address, each address being based upon one of the parent's address. Because each node may have more than one parent, a bridge, or shortcut may exist between network branches.

摘要翻译： 建立了自组织通信系统，其中系统内的每个节点可以具有多个子节点和父节点。 提出了一种地址方案，其中每个节点可以包括多于一个地址，每个地址基于父母地址之一。 因为每个节点可能有多个父节点，所以网络分支之间可能存在网桥或快捷方式。

公开(公告)号：US07362724B2

公开(公告)日：2008-04-22

申请号：US10616112

申请日：2003-07-09

申请人： Jian Huang ,  Lance E. Hester ,  Yan Huang ,  Spyros Kyperountas ,  Feng Niu ,  Qicai Shi

发明人： Jian Huang ,  Lance E. Hester ,  Yan Huang ,  Spyros Kyperountas ,  Feng Niu ,  Qicai Shi

IPC分类号： H04Q7/00

CPC分类号： H04W8/005 ,  G01S5/0289 ,  H04W84/18 ,  H04W84/20 ,  H04W92/02

摘要： A method for peer-to-peer ranging and discovery of a rigid body existing in a scatternet having piconets and nodes includes the steps of defining a node (12) in a piconet (10) to be a piconet controller (PNC) having controller functions, locating a rigid body seed including the node (12), and discovering a rigid body by sequentially downloading controller functions of the piconet controller (12) to at least one border node. Also provided is a communications node including a receiver for receiving communications from other communications nodes in a communications range (R), a transmitter for sending communications to other communications nodes in the communications range (R), a memory storing at least ranging information and a unique identification for describing the node, and a processor connected to the receiver, to the transmitter, and to the memory, the processor being programmed to carry out the method according to the present invention.

摘要翻译： 存在于具有微微网和节点的分散网络中的刚体的对等测距和发现的方法包括以下步骤：将微微网（10）中的节点（12）定义为具有控制器功能的微微网控制器（PNC） ，定位包括所述节点（12）的刚体，以及通过将微微网控制器（12）的控制器功能顺序地下载到至少一个边界节点来发现刚体。 还提供了一种通信节点，其包括用于从通信范围（R）中的其他通信节点接收通信的接收机，用于向通信范围（R）中的其他通信节点发送通信的发射机，至少存储测距信息的存储器和 用于描述节点的唯一标识，以及连接到接收器的处理器，发送器和存储器，处理器被编程以执行根据本发明的方法。

公开(公告)号：US20050007963A1

公开(公告)日：2005-01-13

申请号：US10616112

申请日：2003-07-09

申请人： Jian Huang ,  Lance Hester ,  Yan Huang ,  Spyros Kyperountas ,  Feng Niu ,  Qicai Shi

发明人： Jian Huang ,  Lance Hester ,  Yan Huang ,  Spyros Kyperountas ,  Feng Niu ,  Qicai Shi

IPC分类号： G01S19/05 ,  G01S5/02 ,  G01S19/51 ,  H04L12/28 ,  H04L12/56 ,  H04W8/00 ,  H04W84/18 ,  H04W84/20 ,  H04W92/02

CPC分类号： H04W8/005 ,  G01S5/0289 ,  H04W84/18 ,  H04W84/20 ,  H04W92/02

摘要： A method for peer-to-peer ranging and discovery of a rigid body existing in a scatternet having piconets and nodes includes the steps of defining a node (12) in a piconet (10) to be a piconet controller (PNC) having controller functions, locating a rigid body seed including the node (12), and discovering a rigid body by sequentially downloading controller functions of the piconet controller (12) to at least one border node. Also provided is a communications node including a receiver for receiving communications from other communications nodes in a communications range (R), a transmitter for sending communications to other communications nodes in the communications range (R), a memory storing at least ranging information and a unique identification for describing the node, and a processor connected to the receiver, to the transmitter, and to the memory, the processor being programmed to carry out the method according to the present invention.

摘要翻译： 存在于具有微微网和节点的分散网络中的刚体的对等测距和发现的方法包括以下步骤：将微微网（10）中的节点（12）定义为具有控制器功能的微微网控制器（PNC） ，定位包括所述节点（12）的刚体，以及通过将微微网控制器（12）的控制器功能顺序地下载到至少一个边界节点来发现刚体。 还提供了一种通信节点，其包括用于从通信范围（R）中的其他通信节点接收通信的接收机，用于向通信范围（R）中的其他通信节点发送通信的发射机，至少存储测距信息的存储器和 用于描述节点的唯一标识，以及连接到接收器的处理器，发送器和存储器，处理器被编程以执行根据本发明的方法。

公开(公告)号：US07171476B2

公开(公告)日：2007-01-30

申请号：US10125939

申请日：2002-04-19

申请人： Masahiro Maeda ,  Monique Bourgeois ,  Edgar H. Callaway, Jr. ,  Priscilla Chen ,  Jian Huang ,  Yan Huang ,  Qicai Shi

发明人： Masahiro Maeda ,  Monique Bourgeois ,  Edgar H. Callaway, Jr. ,  Priscilla Chen ,  Jian Huang ,  Yan Huang ,  Qicai Shi

IPC分类号： G06F15/16 ,  H04L12/28

CPC分类号： H04W84/20 ,  H04L1/1607 ,  H04L45/02 ,  H04L45/026 ,  H04L45/46 ,  H04W40/246 ,  H04W76/10 ,  H04W84/18

摘要： A cluster tree network formed by self-organization of a number of nodes. The method of self-organization includes processes for cluster formation, cluster network maintenance, intra-cluster communication. In the cluster formation process, each node discovers if any neighboring node is a cluster head or if any node is already a member of a cluster (thus making it a networked node), and if a cluster head or a networked node is discovered, each node establishes a communication link with the cluster head or the networked node. If no cluster head or networked node is discovered, the node itself becomes a cluster head. The network is maintained by each node periodically broadcasting a HELLO message to neighboring nodes, receiving responses to the HELLO message and updating a neighbor list in accordance with responses to the HELLO message. Multi-cluster networks are also provided using the processes of inter-cluster network formation, inter-cluster network maintenance, and inter-cluster communication. The resulting network has one or more clusters of nodes, each with a cluster head and a number of member nodes, each assigned a node identifier by the cluster head. In a multi-cluster network, a designated device assigns identifies to each cluster head in the network. Border nodes, which are members of at least two clusters, act as routers connecting the clusters and relaying information packets between the clusters.

摘要翻译： 通过多个节点的自组织形成的集群树网络。 自组织的方法包括集群形成，集群网络维护，集群内通信等过程。 在集群形成过程中，每个节点发现任何相邻节点是否为群集头，或者任何节点已经是群集的成员（从而使其成为网络节点），如果发现了群集头或网络节点， 节点与集群头或网络节点建立通信链路。 如果没有发现簇头或网络节点，节点本身就成为簇头。 网络由每个节点维护，周期性地向相邻节点广播HELLO消息，接收对HELLO消息的响应，并根据对HELLO消息的响应更新邻居列表。 群集间网络形成，集群间网络维护和群集间通信也提供了多集群网络。 所得到的网络具有一个或多个节点簇，每个节点具有簇头和多个成员节点，每个节点由簇头分配节点标识符。 在多集群网络中，指定的设备将标识分配给网络中的每个集群头。 作为至少两个集群的成员的边界节点充当连接集群并在集群之间中继信息包的路由器。

公开(公告)号：US07251222B2

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

申请号：US10022935

申请日：2001-12-18

申请人： Priscilla Chen ,  Masahiro Maeda ,  Edgar H. Callaway, Jr. ,  Monique Bourgeois ,  Yan Huang ,  Jiang Huang ,  Qicai Shi

发明人： Priscilla Chen ,  Masahiro Maeda ,  Edgar H. Callaway, Jr. ,  Monique Bourgeois ,  Yan Huang ,  Jiang Huang ,  Qicai Shi

IPC分类号： H04L12/28 ,  H04J3/16 ,  G06F15/16

CPC分类号： H04L61/2038 ,  H04J3/0638 ,  H04L29/12254 ,  H04L45/02 ,  H04L45/026 ,  H04L45/26

摘要： A process for merging and using the Mediation Device Protocol with a network layer protocol. Under the merged protocol, each device joining a network enters into two stages: the Set-Up Stage and the Normal Operational Stage. During the Set-Up Stage, the device identifies its neighbors, builds a neighborhood list, obtains a Logical ID, and picks a parent node in the network. After the Set-Up Stage is complete, the device enters the Normal Operational Stage where it will send/receive control and data messages, invite and help new nodes to join the network, recover from broken links or topology changes, and other normal network operations.

摘要翻译： 用于将中介设备协议与网络层协议合并和使用的过程。 在合并协议下，加入网络的每个设备分为两个阶段：安装阶段和正常运行阶段。 在设置阶段，设备识别其邻居，建立邻居列表，获取逻辑ID，并选择网络中的父节点。 设置阶段完成后，设备进入正常操作阶段，发送/接收控制和数据消息，邀请和帮助新节点加入网络，从断链或拓扑变化恢复，以及其他正常的网络操作 。

公开(公告)号：US06925064B2

公开(公告)日：2005-08-02

申请号：US10660393

申请日：2003-09-11

申请人： Lance E. Hester ,  Jian Huang ,  Yan Huang ,  Padmaja Ramadas ,  Matthew R. Perkins

发明人： Lance E. Hester ,  Jian Huang ,  Yan Huang ,  Padmaja Ramadas ,  Matthew R. Perkins

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

CPC分类号： H04W48/16 ,  H04W40/00 ,  H04W84/18

摘要： In order to discover neighboring nodes (203, 207, 208) within a particular piconet, a first node (206) determines a list of all nodes (205-207) within its piconet (201) and then transmits to each node within the piconet, a message requiring a response. Depending upon which nodes are heard from, a list is formulated by the first node comprising those nodes neighboring the first node. In order for neighboring nodes within other piconets to “discover” the first node, the first node will also scan its environment to determine piconet identifications for other piconets, and then broadcast a “discovery” message having a piconet identification of a neighboring piconet. In a similar manner, the first node will also scan its environment to determine discovery messages transmitted by other nodes, thus determining neighboring nodes outside its piconet.

摘要翻译： 为了发现特定微微网内的相邻节点（203,207,208），第一节点（206）确定其微微网（201）内的所有节点（205-207）的列表，然后发送到微微网内的每个节点 ，需要响应的消息。 根据哪些节点被听到，列表由包括与第一节点相邻的那些节点的第一节点来制定。 为了使其他微微网内的相邻节点“发现”第一节点，第一节点还将扫描其环境以确定其他微微网的微微网标识，然后广播具有相邻微微网的微微网识别的“发现”消息。 以类似的方式，第一节点还将扫描其环境以确定由其他节点发送的发现消息，从而确定其微微网之外的相邻节点。

公开(公告)号：US20050058084A1

公开(公告)日：2005-03-17

申请号：US10660393

申请日：2003-09-11

申请人： Lance Hester ,  Jian Huang ,  Yan Huang ,  Padmaja Ramadas ,  Matthew Perkins

发明人： Lance Hester ,  Jian Huang ,  Yan Huang ,  Padmaja Ramadas ,  Matthew Perkins

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

CPC分类号： H04W48/16 ,  H04W40/00 ,  H04W84/18

摘要： In order to discover neighboring nodes (203, 207, 208) within a particular piconet, a first node (206) determines a list of all nodes (205-207) within its piconet (201) and then transmits to each node within the piconet, a message requiring a response. Depending upon which nodes are heard from, a list is formulated by the first node comprising those nodes neighboring the first node. In order for neighboring nodes within other piconets to “discover” the first node, the first node will also scan its environment to determine piconet identifications for other piconets, and then broadcast a “discovery” message having a piconet identification of a neighboring piconet. In a similar manner, the first node will also scan its environment to determine discovery messages transmitted by other nodes, thus determining neighboring nodes outside its piconet.

摘要翻译： 为了发现特定微微网内的相邻节点（203,207,208），第一节点（206）确定其微微网（201）内的所有节点（205-207）的列表，然后发送到微微网内的每个节点 ，需要响应的消息。 根据哪些节点被听到，列表由包括与第一节点相邻的那些节点的第一节点来制定。 为了使其他微微网内的相邻节点“发现”第一节点，第一节点还将扫描其环境以确定其他微微网的微微网标识，然后广播具有相邻微微网的微微网识别的“发现”消息。 以类似的方式，第一节点还将扫描其环境以确定由其他节点发送的发现消息，从而确定其微微网之外的相邻节点。

公开(公告)号：US07355991B2

公开(公告)日：2008-04-08

申请号：US10304889

申请日：2002-11-26

申请人： Yan Huang ,  Jian Huang ,  Matthew R. Perkins

发明人： Yan Huang ,  Jian Huang ,  Matthew R. Perkins

IPC分类号： H04J15/00

CPC分类号： H04L45/00 ,  H04L45/32

摘要： A method and apparatus for message flooding is provided that takes advantage of the availability of node locations. The transmission of a flood message by a node is based on location information of neighboring nodes. In particular, each node within the communication system will delay retransmission of flood messages by a predetermined amount of time. If, during this delay, a node hears the flood message from a neighboring node (home flooding) or another node (neighborhood flooding), it then cancels transmission of the flood message.

摘要翻译： 提供了用于消息淹没的方法和装置，其利用节点位置的可用性。 节点发送洪泛消息是基于邻居节点的位置信息。 特别地，通信系统内的每个节点将延迟洪水消息的重传预定的时间量。 如果在这个延迟期间，节点听到来自相邻节点（家庭洪泛）或另一个节点（邻域洪泛）的洪泛消息，则它取消洪泛消息的传输。

公开(公告)号：US07269138B2

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

申请号：US10454192

申请日：2003-06-04

申请人： Jian Huang ,  Feng Niu ,  Yan Huang ,  Spyros Kyperountas

发明人： Jian Huang ,  Feng Niu ,  Yan Huang ,  Spyros Kyperountas

IPC分类号： G01R31/08

CPC分类号： H04W28/06 ,  H04L45/121 ,  H04L45/26 ,  H04W64/00 ,  H04W74/00 ,  H04W80/02 ,  H04W84/18 ,  H04W92/18

摘要： A method for reducing communications in a peer-to-peer wireless network having nodes includes sending an RTS-TOA ranging communication from a first node (N0) in a node group to another node (Nr, I) in the group, receiving the RTS-TOA communication with the second node (Nr, I) and sending a multi-cast CTS-TOA/RTS-TOA ranging communication from the second node (Nr, I) as a reply to the received RTS-TOA communication, and successively and sequentially repeating the multi-cast sending step for each of the nodes. A CTS-TOA message is a reply to the received RTS-TOA message and, simultaneously, is an RTS-TOA ranging communication to a new destination node (J). The method applies for a randomized communications approach when node identifications are not sequenced and to a sequential approach where nodes are sequenced, and also applies to completely connected and multi-hop networks. Also provided is a node for carrying out the method of the present invention.

摘要翻译： 一种用于减少具有节点的对等无线网络中的通信的方法包括：将节点组中的第一节点（N 0> 0）的RTS-TOA测距通信发送到另一个节点（Nr，I ），接收与第二节点（Nr，I）的RTS-TOA通信，并从第二节点（Nr，I）发送多播CTS-TOA / RTS-TOA测距通信作为对所接收的回复 RTS-TOA通信，并且连续且顺序地重复每个节点的多播发送步骤。 CTS-TOA消息是对所接收的RTS-TOA消息的答复，并且同时是到新的目的地节点（J）的RTS-TOA测距通信。 该方法适用于随机通信方法，当节点标识未被排序时，并适用于其中节点排序的顺序方法，并且也适用于完全连接和多跳网络。 还提供了用于实施本发明的方法的节点。