-
公开(公告)号:KR1020100073608A
公开(公告)日:2010-07-01
申请号:KR1020080132324
申请日:2008-12-23
Applicant: 한국전자통신연구원
CPC classification number: H04W40/026 , H04W40/248 , H04W84/18
Abstract: PURPOSE: Multi-hop radio communications method of the tree-based considering the node transition is provided to supply routing protocol applied to the network of high-mobility. CONSTITUTION: A general node has a communication state of alone of a plurality of general nodes(100). The general node sets communication establishment information based on a sink node(200) in which the general node generates a connection reply signal, the communication state and the communication level of the general node. The general node updates the communications establishment information based on the connection reply signal received from a parent node. The general node transmits data to the other general node or a server(300) based on an updated communication setting information.
Abstract translation: 目的:考虑节点转移的树型多跳无线电通信方式,提供应用于高移动性网络的路由协议。 构成:通用节点具有多个通用节点(100)中的单独的通信状态。 通用节点根据其中通用节点生成连接应答信号,通信状态和通用节点的通信级别的汇聚节点(200)来设置通信建立信息。 通用节点根据从父节点接收到的连接应答信号更新通信建立信息。 一般节点基于更新的通信设置信息向另一个通用节点或服务器(300)发送数据。
-
公开(公告)号:KR1020090060895A
公开(公告)日:2009-06-15
申请号:KR1020070127878
申请日:2007-12-10
Applicant: 한국전자통신연구원
IPC: H04L12/28
Abstract: A method for finding an adjacent node based on a request is provided to search neighboring node information only if necessary, thereby reducing a network load. A node produces and broadcasts a request packet(S200). The request packet requests an adjacent node to inform its presence. The adjacent node produces and transmits an advertisement packet informing its presence to the node(S210). The node produces and transmits a response packet to the adjacent node. The response packet informs confirming of the presence of the adjacent node.
Abstract translation: 提供了一种基于请求查找相邻节点的方法,用于仅在必要时搜索相邻节点信息,从而减少网络负载。 节点产生并广播请求分组(S200)。 请求包请求相邻节点通知其存在。 相邻节点产生并发送通知其存在于节点的广告分组(S210)。 节点产生并发送响应包到相邻节点。 响应分组通知确认相邻节点的存在。
-
公开(公告)号:KR1020170121623A
公开(公告)日:2017-11-02
申请号:KR1020160050357
申请日:2016-04-25
Applicant: 한국전자통신연구원
IPC: H04L12/931 , H04L29/08
Abstract: 본발명에따른통신서비스품질의연동방법은이종의미들웨어의통신서비스품질을추출하는단계, 상기이종의미들웨어의통신서비스품질과 DIS(Distributed Interactive Simulation) 모듈의대응관계를확인하는단계, 상기대응관계에기초하여 DIS 모듈의통신서비스품질을생성하는단계, 그리고상기 DIS 모듈의통신서비스품질에따라데이터를전송하는단계를포함하되, 상기대응관계는상기데이터의전송시간및 상기데이터의크기와관련된다.
Abstract translation: 根据本发明的服务质量的互通方法,包括以下步骤,以确定提取异构中间件服务的质量的步骤之间的对应关系,服务质量和异构中间件模块的(分布式交互仿真)DIS,该对应关系 产生DIS模块的服务的质量,并且包括:发送根据DIS模块的服务质量的数据的步骤的步骤的基础上,所述对应关系是有关的传输时间的大小和所述数据的数据 。
-
公开(公告)号:KR1020160087705A
公开(公告)日:2016-07-22
申请号:KR1020150007011
申请日:2015-01-14
Applicant: 한국전자통신연구원
IPC: H04L12/66
CPC classification number: H04L12/66
Abstract: 이종미들웨어연동을위한게이트웨이장치및 서비스품질변환방법이개시된다. 본발명의일 실시예에따른게이트웨이장치는하이레벨아키텍처(High Level Architecture: HLA, 이하 HLA이라칭함) 페더레이트모듈과, 데이터분산서비스(Data Distribution Service: DDS, 이하 DDS라칭함) 참가자모듈과, HLA 페더레이트모듈및 DDS 참가자모듈간에변환가능한서비스품질(Quality of Service: QoS, 이하 QoS라칭함) 속성값을관리하며 QoS 속성설정을위한 QoS 속성값을 DDS 참가자모듈에제공하는 QoS 관리부를포함한다.
Abstract translation: 公开了一种用于互连异构中间件和服务质量(QoS,以下称为QoS)转换方法的网关装置。 根据本发明实施例的网关装置包括:高级架构(HLA,以下称为HLA)联合模块; 数据分发服务(DDS,以下简称DDS)参与者模块; 以及QoS管理单元,用于管理可在HLA联合模块和DDS参与者模块之间转换的QoS属性值,并为DDS参与者模块提供用于设置QoS属性的QoS属性值。 根据本发明的实施例的网关装置可以应用于具有与其相互连接的DDS中间件和HLA中间件的结构的各种应用领域。
-
公开(公告)号:KR1020150113375A
公开(公告)日:2015-10-08
申请号:KR1020140036582
申请日:2014-03-28
Applicant: 한국전자통신연구원
IPC: G06F15/16
CPC classification number: G06F17/30864
Abstract: 본발명은다중네트워크도메인환경에서상이한데이터분산서비스개체들간의데이터통신이가능하도록개체탐색수단을제공하는컴퓨팅장치및 그것의동작방법을개시한다. 본발명에따른제 1 네트워크도메인및 제 2 네트워크도메인을포함하는데이터분산서비스(Data Distribution Service, DDS) 시스템에있어서데이터분산서비스를위한컴퓨팅장치의동작방법은, 제 1 네트워크도메인에포함된 DDS 개체들의탐색정보를수집하는단계, DDS 개체들중 적어도하나의 DDS 개체를제 1 네트워크도메인의대표자개체로결정하는단계및 제 1 네트워크도메인의대표자개체를통해 DDS 개체들의탐색정보를제 2 네트워크도메인의대표자개체에게제공하는단계를포함한다.
Abstract translation: 公开了一种计算装置,其提供用于在多网域的情况下的数据分发服务(DDS)的不同个体之间的通信的个体搜索装置及其操作方法。 在包括第一网域和第二网域的DDS系统中,所述计算装置的操作方法可以包括以下步骤:收集包含在所述第一网域中的DDS个人的搜索信息; 将DDS个体中的至少一个DDS个体确定为第一网络域的代表性个体; 以及通过第一网域的代表性个体向第二网域的代表个人提供DDS个人的搜索信息。
-
公开(公告)号:KR101374519B1
公开(公告)日:2014-03-14
申请号:KR1020100131983
申请日:2010-12-21
Applicant: 한국전자통신연구원
Inventor: 차우석
Abstract: 무선 애드 혹 네트워크의 이웃 노드 발견 방법이 개시된다. 먼저, 소정의 수신 노드가 헬로 패킷을 수신하고, 자신의 위치정보와 헬로 패킷을 방송한 송신 노드의 위치 정보를 비교하여 헬로 패킷의 분실 여부를 판단한 후, 헬로 패킷이 분실된 것으로 판단된 경우 송신 노드에게 헬로 패킷의 재전송을 요청한다. 따라서, 이웃 노드 발견의 신뢰성을 향상시킬 수 있다.
-
公开(公告)号:KR1020130022038A
公开(公告)日:2013-03-06
申请号:KR1020110084697
申请日:2011-08-24
Applicant: 한국전자통신연구원
CPC classification number: H04W74/085 , H04W74/0816
Abstract: PURPOSE: A collision avoidance method in a wireless network and an apparatus thereof are provided to reduce collision probability in an environment in which wireless data is periodically transmitted in a CSMA/CA(Carrier Sensing Multiple Access/Collision Avoidance) method. CONSTITUTION: A first node(201) receives data from a second node(202). The first node determines history receiving data from the second node. When the first node determines the receiving number of the data, the first node determines the data transmission period of the second node. The first node determines a data transmission period by using information such as an IFS(Inter Frame Spacing), preamble, and back-off slot time. [Reference numerals] (201) First node; (202) Second node; (203) Third node
Abstract translation: 目的:提供一种无线网络中的防撞方法及其装置,以减少在CSMA / CA(载波侦听多路访问/冲突避免)方法中周期性地发送无线数据的环境中的冲突概率。 构成:第一节点(201)从第二节点(202)接收数据。 第一节点确定从第二节点接收数据的历史。 当第一节点确定数据的接收号码时,第一节点确定第二节点的数据传输周期。 第一节点通过使用诸如IFS(帧间间隔),前导码和退避时隙时间的信息来确定数据传输周期。 (附图标记)(201)第一节点; (202)第二节点; (203)第三节点
-
公开(公告)号:KR1020110068543A
公开(公告)日:2011-06-22
申请号:KR1020090125541
申请日:2009-12-16
Applicant: 한국전자통신연구원
CPC classification number: H04W64/00 , G01S5/0252 , H04W4/02
Abstract: PURPOSE: A mobile node recognizing apparatus and method thereof are provided to calculate accurate location information of a mobile node in an indoor wireless environment. CONSTITUTION: If a positioning server receives signal strength information from three or more reference nodes, the positioning server starts the location calculation of an MN(Mobile Node)(S202). The positioning server selects the location of the mobile node(S203). The positioning server estimates the signal strength about each reference node(S204). The positioning server determines a location coordinate through comparing the estimated signal strength with real signal strength(S205).
Abstract translation: 目的:提供一种移动节点识别装置及其方法,用于计算室内无线环境中移动节点的准确位置信息。 规定:如果定位服务器从三个或更多个参考节点接收信号强度信息,则定位服务器启动MN(移动节点)的位置计算(S202)。 定位服务器选择移动节点的位置(S203)。 定位服务器估计关于每个参考节点的信号强度(S204)。 定位服务器通过将估计的信号强度与实际信号强度进行比较来确定位置坐标(S205)。
-
公开(公告)号:KR1020100104931A
公开(公告)日:2010-09-29
申请号:KR1020090023669
申请日:2009-03-19
Applicant: 한국전자통신연구원
Abstract: PURPOSE: An energy cognitive routing method considering mobility in a sensor network and a device thereof are provided to set a route in consideration of a remaining energy amount of a sensor node, thereby lengthening lifetime of a wireless sensor network. CONSTITUTION: A mobile node transmits a help message to adjacent nodes in consideration of an available remaining energy amount(S120). The mobile node checks a response for the help message(S122). When the mobile node does not receive a route setup message from the adjacent nodes, the mobile node notifies data transmission unavailability to a previous sensor node(S130). When a sensor node requesting data transmission to the mobile node is not a source node, the sensor node deletes route information for information for the mobile node(S132,S134).
Abstract translation: 目的:提供考虑传感器网络中的移动性的能量认知路由方法及其装置,以考虑传感器节点的剩余能量量来设置路由,从而延长无线传感器网络的寿命。 构成:考虑到可用的剩余能量量,移动节点向相邻节点发送帮助消息(S120)。 移动节点检查帮助消息的响应(S122)。 当移动节点没有从相邻节点接收到路由建立消息时,移动节点向前一传感器节点通知数据传输不可用(S130)。 当向移动节点请求数据传输的传感器节点不是源节点时,传感器节点删除用于移动节点的信息的路由信息(S132,S134)。
-
公开(公告)号:KR1020160114459A
公开(公告)日:2016-10-05
申请号:KR1020150040996
申请日:2015-03-24
Applicant: 한국전자통신연구원
CPC classification number: H04J3/0673 , H04L67/28 , H04L67/325
Abstract: 본발명은이종미들웨어연동을위한게이트웨이로, 하이레벨아키텍처(High Level Architecture: HLA, 이하 HLA이라칭함) 페더레이트와, 데이터분산서비스(Data Distribution Service: DDS, 이하 DDS라칭함) 참가자와, 월클럭(Wallclock)을제공하는클럭페더레이트(Clock Federate)와, 상기클럭페더레이트(Clock Federate)이제공하는월클럭으로상기 HLA 페더레이트및 상기 DDS 참가자의시간동기를맞추는시간관리부를포함한다.
-
-
-
-
-
-
-
-
-