专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US07697458B2 Node for self localization, clustering method using the same, and localization method 失效
标题翻译：节点用于自定位，聚类方法使用相同，并定位方法
公开(公告)号：US07697458B2
公开(公告)日：2010-04-13
申请号：US11759450
申请日：2007-06-07
申请人： Jongjun Park , Jong Oh Lee , Sun Joong Kim , Cheol Sig Pyo , Jong Suk Chae
发明人： Jongjun Park , Jong Oh Lee , Sun Joong Kim , Cheol Sig Pyo , Jong Suk Chae
IPC分类号： H04L12/16
CPC分类号： H04W64/00 , H04W4/08 , H04W48/16 , H04W84/18
摘要： A node for self localization, a clustering method using the same, and a localization method are provided. The node, which is located in a specific space so as to constitute a sensor network, includes a location information messaging unit which receives one or more location information messages including information on spatial locations of one or more neighboring nodes in the sensor network from the neighboring nodes in the sensor network; a distance calculator which calculates a first distance to the neighboring node on the basis of the location information included in the received location information messages and calculates a second distance to one or more neighboring nodes on the basis of the received time or intensity of the message on the location information; and a clustering unit which forms clusters of the node and a plurality of neighboring nodes in which the difference between the first and second distances is less than a predetermined threshold.
摘要翻译：提供了一种用于自定位的节点，使用该节点的聚类方法和定位方法。位于特定空间中以构成传感器网络的节点包括位置信息消息单元，其接收一个或多个位置信息消息，其包括关于传感器网络中的一个或多个相邻节点的空间位置的信息传感器网络中的节点; 距离计算器，其基于包括在接收的位置信息消息中的位置信息计算到相邻节点的第一距离，并基于所接收的消息的时间或强度计算到一个或多个相邻节点的第二距离位置信息; 以及聚集单元，其形成所述节点的簇和多个相邻节点，其中所述第一和第二距离之间的差小于预定阈值。

2. 发明申请

US20080069008A1 NODE FOR SELF LOCALIZATION, CLUSTERING METHOD USING THE SAME, AND LOCALIZATION METHOD 失效
标题翻译：用于自定位的节点，使用它的聚类方法和本地化方法
公开(公告)号：US20080069008A1
公开(公告)日：2008-03-20
申请号：US11759450
申请日：2007-06-07
申请人： Jongjun PARK , Jong Oh LEE , Sun Joong KIM , Cheol Sig PYO , Jong Suk CHAE
发明人： Jongjun PARK , Jong Oh LEE , Sun Joong KIM , Cheol Sig PYO , Jong Suk CHAE
IPC分类号： H04L12/28
CPC分类号： H04W64/00 , H04W4/08 , H04W48/16 , H04W84/18
摘要： A node for self localization, a clustering method using the same, and a localization method are provided. The node, which is located in a specific space so as to constitute a sensor network, includes a location information messaging unit which receives one or more location information messages including information on spatial locations of one or more neighboring nodes in the sensor network from the neighboring nodes in the sensor network; a distance calculator which calculates a first distance to the neighboring node on the basis of the location information included in the received location information messages and calculates a second distance to one or more neighboring nodes on the basis of the received time or intensity of the message on the location information; and a clustering unit which forms clusters of the node and a plurality of neighboring nodes in which the difference between the first and second distances is less than a predetermined threshold.
摘要翻译：提供了一种用于自定位的节点，使用该节点的聚类方法和定位方法。位于特定空间中以构成传感器网络的节点包括位置信息消息单元，其接收一个或多个位置信息消息，其包括关于传感器网络中的一个或多个相邻节点的空间位置的信息传感器网络中的节点; 距离计算器，其基于包括在接收的位置信息消息中的位置信息计算到相邻节点的第一距离，并基于所接收的消息的时间或强度计算到一个或多个相邻节点的第二距离位置信息; 以及聚集单元，其形成所述节点的簇和多个相邻节点，其中所述第一和第二距离之间的差小于预定阈值。

3. 发明申请

US20110138026A1 OPERATING METHOD OF NETWORK NODE OF NETWORK WITH TREE STRUCTURE BASED ON DISTRIBUTED ADDRESS ASSIGNMENT, NETWORK FORMING METHOD AND SYSTEM INCLUDING NETWORK NODE 审中-公开
标题翻译：基于分布式地址分配的网络结构网络节点操作方法，网络形成方法和系统，包括网络节点
公开(公告)号：US20110138026A1
公开(公告)日：2011-06-09
申请号：US12821424
申请日：2010-06-23
申请人： Hoon Jeong , Jongjun Park , Seong-soon Joo , Jong-Suk Chae
发明人： Hoon Jeong , Jongjun Park , Seong-soon Joo , Jong-Suk Chae
IPC分类号： G06F15/177 , G06F15/173
CPC分类号： H04L29/12254 , H04L45/04 , H04L61/2038 , H04L67/12
摘要： Provided is a method for operating a network node of a tree-structured network based on distributed address assignment. Addresses are assigned. It is determined whether a routing depth of the network node corresponds to a reduced node depth. It is determined whether an authority for generating an inferior node exists using the assigned address when the routing depth of the network node corresponds to the reduced node depth. The inferior node is generated using a result of the determination.
摘要翻译：提供了一种基于分布式地址分配来操作树状结构化网络的网络节点的方法。地址被分配。确定网络节点的路由深度是否对应于减少的节点深度。当网络节点的路由深度对应于减少的节点深度时，确定使用分配的地址是否存在用于生成劣质节点的权限。使用确定的结果生成下级节点。

4. 发明申请

US20110145378A1 OPERATING METHOD OF NETWORK NODE OF NETWORK WITH TREE STRUCTURE BASED ON DISTRIBUTED ADDRESS ASSIGNMENT AND NETWORK FORMING METHOD 审中-公开
标题翻译：基于分布式地址分配和网络形成方法的具有树结构的网络网络节点的操作方法
公开(公告)号：US20110145378A1
公开(公告)日：2011-06-16
申请号：US12822295
申请日：2010-06-24
申请人： Jongjun PARK , Hoon Jeong , So-Young Hwang , Bong Soo Kim , Seong-Soon Joo , Jong-Suk Chae
发明人： Jongjun PARK , Hoon Jeong , So-Young Hwang , Bong Soo Kim , Seong-Soon Joo , Jong-Suk Chae
IPC分类号： G06F15/173 , G06F15/177
CPC分类号： G06F15/177
摘要： Provided is a method for operating a network node in a specific cluster of a tree-structured network based on distributed address assignment. In the method, a non-registered node is detected. A routing depth of the network node is determined. When the determined routing depth corresponds to a reference value, a sub cluster using a cluster address is generated, and the detected non-registered node is registered as a child node in the generated sub cluster using an internal address.
摘要翻译：提供了一种基于分布式地址分配来操作树结构化网络的特定集群中的网络节点的方法。在该方法中，检测到非注册节点。确定网络节点的路由深度。当确定的路由深度对应于参考值时，生成使用群集地址的子群集，并且使用内部地址将生成的子群集中的检测到的非注册节点注册为子节点。

5. 发明申请

US20100110888A1 METHOD OF PREVENTING DATA COLLOSIONS IN BEACON-ENABLED ZIGBEE SYSTEM HAVING TREE ROUTING SCHEME 审中-公开
标题翻译：在具有树路由方案的BEACON-EIBBLED ZIGBEE系统中防止数据聚合的方法
公开(公告)号：US20100110888A1
公开(公告)日：2010-05-06
申请号：US12532826
申请日：2007-10-24
申请人： Jongjun Park , Jong-Oh Lee , Hoon Jeong , Sun-Joong Kim , Cheol-Sig Pyo , Jong-Suk Chae
发明人： Jongjun Park , Jong-Oh Lee , Hoon Jeong , Sun-Joong Kim , Cheol-Sig Pyo , Jong-Suk Chae
IPC分类号： H04L1/00
CPC分类号： H04W74/0816 , H04W84/18
摘要： Provided is a method of preventing a data collision that occurs when two or more child nodes simultaneously transmit data to a parent node in a ZigBee network having a tree routing scheme and operating in a beacon mode. In the ZigBee system having the tree routing scheme and operating in the beacon mode, data communication to the parent node is performed in a beacon frame of the parent node. Here, when several child nodes exist under a single parent node, the child nodes transmit data to the parent node at the moment of receiving the beacon of the parent node, so that the data collision may occur when the child nodes simultaneously transmit the data to the parent node in the beacon frame of the parent node. In the method of preventing a data collision, each of the two or more child nodes is set to wait for its guard time (delay time) when transmitting data to the parent node to induce a normal slotted carrier sense multiple access with collision avoidance (CSMA-CA) operation. Therefore, the data collision can be prevented.
摘要翻译：提供了一种防止当两个或多个子节点同时向具有树路由方案并且以信标模式操作的ZigBee网络中的父节点发送数据时发生的数据冲突的方法。在具有树路由方案并在信标模式下操作的ZigBee系统中，在父节点的信标帧中执行到父节点的数据通信。这里，当在单个父节点下存在几个子节点时，子节点在接收到父节点的信标的时刻向父节点发送数据，使得当子节点同时发送数据时可能发生数据冲突父节点的信标帧中的父节点。在防止数据冲突的方法中，将两个或多个子节点中的每一个设置为在向父节点发送数据时等待其保护时间（延迟时间），以引起具有防冲突的正常时隙载波侦听多路访问（CSMA -CA）操作。因此，可以防止数据冲突。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式