Abstract:
미들웨어 연동 장치 및 방법이 개시된다. 본 발명의 일실시예에 따른 미들웨어 연동 장치는 프로토콜 매핑 정보와 데이터 매핑 정보를 이용하여 온톨로지 모델을 생성하는 모델 생성부; 상기 온톨로지 모델을 이용하여 제1 미들웨어 장치와 제2 미들웨어 장치의 프로토콜 매핑과 데이터 매핑을 수행하는 온톨로지 연동부; 및 상기 온톨로지 모델을 이용하여 상기 제1 미들웨어 장치로부터 수신한 데이터를 변환하여 상기 제2 미들웨어 장치에 송신하는 미들웨어 관리부를 포함한다.
Abstract:
Provided is an apparatus for providing a group communication service. The apparatus for providing a group communication service comprises: a group communication management module for controlling and managing group communication of multiple user terminals connected to an internal network standing alone from an external network; and a video/voice management module for receiving voices and videos for the group communication from microphones and cameras of the user terminals and manages the voices and videos, wherein the group communication management module includes: a packet management unit for generating packets used for controlling the group communication; a terminal searching unit for transmitting a group communication connection packet among the generated packets to a plurality of surrounding user terminals connected to the internal network, and searching for user terminals those can participate in the group communication based on response packets from the surrounding user terminals; and a group communication control unit for generating a communication group by transmitting a communication group generating packet among the generated packets to the searched participating user terminals, modifying or changing the communication group by transmitting a group communication control packet among the generated packets to the searched participating user terminals, and controlling the group communication of user terminals belonging to the communication group. [Reference numerals] (130) Group communication management module; (140) Video and voice management module; (150) video and voice output module; (AA) Mobile operation system
Abstract:
본 발명은 메시지 전송 주기 결정 방법이 개시된다. 이를 위한 메시지 전송 주기 결정 방법은, 이웃 노드의 전송 영역 내에 임의의 노드가 위치할 제1 확률을 결정하는 단계, 상기 임의의 노드가 상기 이웃 노드의 전송 영역을 벗어날 제2 확률을 결정하는 단계, 상기 제1 확률과 상기 제2 확률을 기반으로, 상기 임의의 노드의 전송 영역에 위치한 노드가 상기 임의의 노드의 전송 영역을 벗어날 제3 확률을 결정하는 단계 및 상기 제3 확률에 따라 상기 임의의 노드의 메시지 전송 주기를 결정하는 단계를 포함한다. 따라서, 네트워크 전체의 Hello 메시지 전송 주기를 변경하는 것이 아니라 각 노드의 Hello 메시지 전송 주기를 분산적으로 결정함으로써 노드의 이동성에 대해 적응적으로 Hello 메시지 전송 주기를 결정할 수 있고 네트워크 오버헤드의 증가를 최소화 하면서 이웃 노드탐색의 정확도를 향상시킬 수 있다.
Abstract:
PURPOSE: A relay node selecting method in a wireless ad-hoc network is provided to improve the whole performance of a network by reducing channel competition and collision probability. CONSTITUTION: A predetermined node renews a neighbor node list based on a message which is received from one or more the other nodes (S203). The predetermined node selects a 1 hop neighbor node having the most relay node selectors among one or more 1 hop neighbor nodes which are included in the renewed neighbor node list as a relay node (S209). The predetermined node receives a Hello message which respectively includes relay node selector number information from one or more the other node. The predetermined node renews the neighbor node list according to the relay node selector number included in the one or more Hello message. [Reference numerals] (AA) Start; (BB) Yes; (CC) No; (DD) End; (S201) Receive a Hello message including MSC information from neighboring nodes; (S203) Renew a list of the neighboring nodes regarding the MSC information; (S205) Align first hop neighboring nodes according to MSC values; (S207) Align the first hop neighboring nodes with the highest MSC values regarding the number of second hop neighboring nodes; (S209) Select the node with the highest MSC value and the largest number of the second hop neighboring nodes as a MPR node; (S211) Is at least one second hop neighboring node included ?; (S213) Remove information about the first and second hop neighboring nodes corresponding to a selected MPR on the list of the neighboring nodes
Abstract:
PURPOSE: A data packet transmission method is provided to improve the stability of transmission by preventing the degradation of total bandwidths. CONSTITUTION: An access point receives a unicast packet transmitted from a predetermined terminal connected to a wireless network (S401). The access point determines a data packet transmission method including rapid transmission speed between the broadcast method or the unicast method based on the number of terminals connected to a wireless network and the access point (S402). The access point transmits broadcast packet converted into the unicast packet to the access point and each terminal connected to the wireless network when the transmission speed of the broadcast method is faster than the unicast method (S403-S404). [Reference numerals] (AA) Start; (BB) Finish; (S501) Receives packets; (S502) Convert into external network address; (S503) Transmit to external interface; (S504) Broadcasting transmission is faster.; (S505) Convert into each connected terminal unicast address; (S506) Transmits to access point interface; (S507) Convert into an original broadcast address
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:
PURPOSE: An inactivity / activity duty cycle method is provided to maximize the efficiency of a channel recycle by minimizing the size of a virtual cluster. CONSTITUTION: Each node dynamically searches a 1-hop distance neighbor node by a three step handshake of a Beacon/Approval/ACK frame on a free contention access period of a time frame. Each node selects an initial activation schedule. The activated node selects the next active schedule by the second handshake of the Beacon/Approval frame on the control period. The node activated on the corresponding time slot as an owner has an exclusive channel access right for the corresponding time slot. The node transmits data on the transmission time.
Abstract:
본 발명의 이동 노드 위치 인식장치 및 이를 이용한 이동 노드 위치 인식 장치는, 주기적으로 이동 노드로부터 패킷을 수신하여 신호세기정보를 출력하는 기준 노드; 및 기준 노드로부터 수신한 신호세기정보를 공간정보를 바탕으로 이동 노드의 위치를 계산하는 측위 서버를 구비한다. 이동 노드, 기준 노드, 측위 서버, 위치 추정
Abstract:
PURPOSE: A method for discovering the neighboring nodes of a mobile ad hoc network(MANET) is provided to verify the loss of HELLO packets by comparing a node received HELLO packet and a transmitting node broadcasting the HELLO packet. CONSTITUTION: A receiving node receives a HELLO packet(210). The receiving node compares self-position information with the position information of a transmitting node, which broadcasts the HELLO packet. Based on the comparison result, the loss of the HELLO packet is verified(230). If the loss of the HELLO packet is verified, the receiving node requests the transmitting node to re-transmit the HELLO packet(240).