-
公开(公告)号：KR1020140023840A
公开(公告)日：2014-02-27
申请号：KR1020120133917
申请日：2012-11-23
Applicant: 한국전자통신연구원
CPC classification number: H04W40/24 , H04W52/0203 , H04W84/18
Abstract: The present invention provides a device and a method for processing a passage management packet. The device for processing a passage management packet determines whether a router processing a received passage management packet is a storage node. If the router is the storage node, the present invention controls the passage management packet to be stored in a routing table. If the router is a non-storage node, the present invention controls the passage management packet to be transmitted to a next node without storing the passage management packet in the routing table. [Reference numerals] (110) Reception unit; (120) Determination unit; (130) Control unit; (140) Routing table; (150) Transmission unit
Abstract translation: 本发明提供一种处理通道管理分组的装置和方法。 用于处理通过管理分组的设备确定处理接收的通过管理分组的路由器是否是存储节点。 如果路由器是存储节点，则本发明控制要存储在路由表中的通道管理分组。 如果路由器是非存储节点，则本发明将通过管理包发送到下一个节点，而不将路由表存储在路由表中。 （附图标记）（110）接收单元; （120）确定单位; （130）控制单元; （140）路由表; （150）传输单元
-
42.发明授权
公开(公告)号：KR101310304B1
公开(公告)日：2013-09-23
申请号：KR1020090122459
申请日：2009-12-10
Applicant: 한국전자통신연구원
CPC classification number: G06F15/177
Abstract: 본 발명은 분산 주소 할당(distributed address assignment)에 기반한 트리(tree) 구조 네트워크의 클러스터의 네트워크 노드의 동작 방법에 관한 것이다. 본 발명의 동작 방법은 미등록 노드를 검출하는 단계, 네트워크 노드의 라우팅 깊이를 판별하는 단계, 그리고 판별된 라우팅 깊이가 기준값에 대응할 때, 클러스터 주소에 기반하여 서브 클러스터를 생성하고 그리고 내부 주소에 기반하여 상기 검출된 미등록 노드를 상기 생성된 서브 클러스터 내의 자식 노드로 등록하는 단계로 구성된다.
-
公开(公告)号：KR101084344B1
公开(公告)日：2011-11-16
申请号：KR1020090034315
申请日：2009-04-20
Applicant: 한국전자통신연구원 , 세종대학교산학협력단
CPC classification number: Y02D70/00
Abstract: 저전력 무선 통신 망에서의 주소 할당 방법에 관한 것으로, 분산 주소 할당 기법(DAAM)에 따라 주소를 할당하고, 분산 주소 할당 기법에 따라 추가 주소 할당이 불가능한 경우에 신규 노드로부터 추가 주소 할당 요청이 입력되면, 무작위 주소 할당 방식에 따라 추가 주소를 할당하는 주소 할당 방법에 의해 주소 할당의 효율성을 증대시킬 수 있다.
지그비, 주소할당, DAAM, 스토케스틱Abstract translation: 目的：提供低功耗无线通信网络中的地址分配方法和路由方法，以通过利用未使用的地址来提高地址分配的有效性。 构成：根据DAAM分配地址（S100）。 在根据DAAM不可能进行附加地址分配的情况下，如果从新节点输入附加地址分配请求，则根据RAAM分配附加地址（S130）。 分配了相加地址的节点从另一个新节点接收地址分配请求（S140）。 根据附加地址请求，另一个新节点由RAAM分配。
-
公开(公告)号：KR101056834B1
公开(公告)日：2011-08-16
申请号：KR1020090021691
申请日：2009-03-13
Applicant: 한국전자통신연구원
Abstract: 본 발명은 지그비 네트워크(ZigBee network)에 관한 것으로서, 이동성을 가진 엔드 디바이스(end-device)가 지그비 네트워크에 접속(join)하지 않고 이웃 라우터(ZigBee Router)들에게 제한적인 브로드캐스트(Broadcast)를 수행함으로써, 보다 빠르게, 보다 안정적으로 데이터 전송을 수행하는 방법이다. 본 발명에서는 이동성을 가진 엔드 디바이스의 경우 네트워크 접속 절차를 수행하지 않고 데이터를 전송하고자 하는 네트워크의 PAN ID만을 획득한 후 제한적인 브로드캐스트를 이용하여 메시지를 전송하여, 주위 라우터들이 목표 노드에게 대신 전송하게 함으로써 보다 빠르고 안정적인 메시지 전송이 이루어지도록 하는 방법을 제안한다.
지그비(ZigBee), 무선(Wireless), 대리노드.Abstract translation: 本发明执行与所涉及的紫蜂网络（ZigBee网络），与移动终端装置（终端装置），而不连接（加入）到紫蜂网络的邻居有限广播（广播）到（ZigBee路由器） 从而更快更稳定地执行数据传输。 到本发明中，后仅获取的PAN ID，它是为与移动的终端设备不执行网络接入过程使用有限的广播传输消息传输数据的情况下，网络的，路由器周围，而不是传送到目的地节点 该消息以更快和更稳定的方式传输。
-
45.发明公开
公开(公告)号：KR1020110065798A
公开(公告)日：2011-06-16
申请号：KR1020090122459
申请日：2009-12-10
Applicant: 한국전자통신연구원
CPC classification number: G06F15/177
Abstract: PURPOSE: An operating method of tree structure network node based on distributed address assignment is provided to offer an improved expandability to the tree structure network. CONSTITUTION: A maximum depth node detects an unregistered node(S125). The maximum depth node distinguishes the routing depth of a network node. If the determined routing depth is coping with the reference value, the maximum depth node creates a sub-cluster based on the cluster address(S160). The maximum depth node registers the detected unregistered node as a child node within the sub cluster based on the internal address.
Abstract translation: 目的：提供基于分布式地址分配的树型结构网络节点的操作方法，为树型结构网络提供改进的可扩展性。 规定：最大深度节点检测未注册节点（S125）。 最大深度节点区分网络节点的路由深度。 如果所确定的路由深度与参考值对应，则最大深度节点根据簇地址创建子群集（S160）。 最大深度节点根据内部地址将检测到的未注册节点注册为子集群内的子节点。
-
Patent Agency Ranking46.发明公开분산 주소 할당에 기반한 트리 구조의 네트워크의 네트워크 노드의 동작 방법, 네트워크의 형성 방법, 그리고 네트워크 노드를 포함하는 시스템 无效基于分布式地址分配的网络结构网络节点的运行方法，网络形成方法和系统，包括网络节点
公开(公告)号：KR1020110064136A
公开(公告)日：2011-06-15
申请号：KR1020090120601
申请日：2009-12-07
Applicant: 한국전자통신연구원
CPC classification number: H04L29/12254 , H04L45/04 , H04L61/2038 , H04L67/12
Abstract: PURPOSE: An operation method of a network node of tree structure network based on distribution address allocation, a forming method of a network, and system including a network node are provided to supply expandability which improved a network of a tree structure based on distribution address allocation. CONSTITUTION: A plurality of sensor nodes is connected from a coordinator node with a tree structure. The coordinator node and the plurality of sensor nodes receive address based on distributed address assignment. One part of nodes among nodes corresponding to a routing depth among the plurality of sensor nodes is prohibited from having a lower node.
Abstract translation: 目的：提供基于分配地址分配的树结构网络网络节点的操作方法，网络的形成方法和包括网络节点的系统，以提供基于分配地址分配改进树结构的网络的可扩展性 。 构成：多个传感器节点从具有树结构的协调节点连接。 协调器节点和多个传感器节点基于分布式地址分配接收地址。 与多个传感器节点之间的路由深度相对应的节点中的节点的一部分被禁止具有较低的节点。
-
公开(公告)号：KR1020100069312A
公开(公告)日：2010-06-24
申请号：KR1020080127965
申请日：2008-12-16
Applicant: 한국전자통신연구원
IPC: G01S5/02
CPC classification number: H04W64/003 , G01S5/0027 , G01S5/02
Abstract: PURPOSE: A sensor node and a method of calculating self position are provided to easily calculate the position of a sensor node without additional equipment by using 4 pieces of location information received from two mobile nodes. CONSTITUTION: A location information receiver(110) receives location information measured at different times from 2 mobile nodes. The location information comprises mobile node identification information and mobile node coordinate information. A self position calculating unit(120) calculates the position of a sensor node by using a link quality index of packet received with the help of the two mobile nodes and also the virtual center of gravity of a rectangle that is formed due to four locations which are included in the location information received from the two mobile nodes.
Abstract translation: 目的：提供一种传感器节点和计算自身位置的方法，通过使用从两个移动节点接收的4个位置信息，轻松计算传感器节点的位置，无需附加设备。 构成：位置信息接收器（110）从2个移动节点接收在不同时间测量的位置信息。 位置信息包括移动节点识别信息和移动节点坐标信息。 自身位置计算单元（120）通过使用在两个移动节点的帮助下接收到的分组的链路质量指数以及由四个位置形成的矩形的虚拟重心来计算传感器节点的位置， 被包括在从两个移动节点接收的位置信息中。
-
公开(公告)号：KR1020100068148A
公开(公告)日：2010-06-22
申请号：KR1020090021693
申请日：2009-03-13
Applicant: 한국전자통신연구원
CPC classification number: B62H2003/005 , G06Q50/30 , B62H5/005 , E05B71/00 , G06K7/10009 , G06K7/10297 , H04L61/6081
Abstract: PURPOSE: Even a bicycle holder is changed, a wireless communication terminal mounted in a bicycle for bicycle rental management and a method for managing bicycle rental information are provided to provide stabile communication environment in a bicycle rental system. CONSTITUTION: A wireless communication terminal comprises an information reader unit(200), a handling unit(210), a locking unit(220), a control unit(230), a communication unit(240), and a display unit(250). An information reader unit reads RF tag information of bicycle stand at local wireless communication method. The communication unit performs data communication with a management server of remote site. The control unit receives the read bicycle stand information. The control unit controls a lock of the locking unit based on a user identification information.
Abstract translation: 目的：即使改变自行车架，也可以设置安装在自行车用自行车租赁管理中的无线通信终端以及管理自行车租赁信息的方法，以在自行车租赁系统中提供稳定的通信环境。 构成：无线通信终端包括信息阅读器单元（200），处理单元（210），锁定单元（220），控制单元（230），通信单元（240）和显示单元（250） 。 信息阅读器单元以本地无线通信方式读取自行车站的RF标签信息。 通信单元与远程站点的管理服务器进行数据通信。 控制单元接收读取的自行车支架信息。 控制单元基于用户识别信息控制锁定单元的锁定。
-
公开(公告)号：KR1020100065019A
公开(公告)日：2010-06-15
申请号：KR1020090023656
申请日：2009-03-19
Applicant: 한국전자통신연구원
Abstract: PURPOSE: A location-based environment data request response and a data fusion method in the sensor network are provided to request environment data of desired point without existence of node in a target point and accurate location information of the mode, thereby receiving response about the request. CONSTITUTION: A sensor node checks a neighbor node near to target(S10,S12). If the neighbor node exists, the sensor node transmits the environment data request message to the neighbor node(S14). The neighbor node senses environment data(S16). The sensor node fuses one environment data of the neighbor nodes(S20). The sensor node transmits the response message by using the routing path of initial environment data request message(S22).
Abstract translation: 目的：提供传感器网络中的基于位置的环境数据请求响应和数据融合方法，以在目标点中存在节点并且存在模式的准确位置信息来请求所需点的环境数据，从而接收关于请求的响应 。 构成：传感器节点检查靠近目标的邻近节点（S10，S12）。 如果邻居节点存在，则传感器节点向邻居节点发送环境数据请求消息（S14）。 邻居节点感测环境数据（S16）。 传感器节点融合邻居节点的一个环境数据（S20）。 传感器节点通过使用初始环境数据请求消息的路由路径发送响应消息（S22）。
-
公开(公告)号：KR1020100065014A
公开(公告)日：2010-06-15
申请号：KR1020090021691
申请日：2009-03-13
Applicant: 한국전자통신연구원
Abstract: PURPOSE: A local wireless network and a method for transmitting a message in a network are provided to broadcast a message without network connecting process in a mobility end device and transmit the message to target node at a router relevant to proxy node, thereby performing more rapid data communication. CONSTITUTION: A local wireless network includes a mobility end devices and proxy nodes. The mobility end device broadcast a message without connection process with the local wireless network. Address information of a target node is inserted to the message. By receiving the broadcasted message, the proxy nodes spreads proxy nodes notification message. Proxy nodes unicast the broadcasted message within the broadcasted message to the target node.
Abstract translation: 目的：提供本地无线网络和在网络中发送消息的方法，以在移动终端设备中广播消息而无需网络连接过程，并将消息发送到与代理节点相关的路由器上的目标节点，从而执行更快速 数据通信。 规定：本地无线网络包括移动终端设备和代理节点。 移动终端设备在没有与本地无线网络的连接过程的情况下广播消息。 将目标节点的地址信息插入消息。 通过接收广播的消息，代理节点传播代理节点通知消息。 代理节点将广播消息内的广播消息单播到目标节点。
-
-
-
-
-
-
-
-
-
Search Results
52
records
(took 0.035 seconds)
