Electronics and Telecommunications Research Institute

Heyung-Sub Lee

Jong-Suk Chae

Sang-Woo Lee

Hyeong-Ho Lee

Seung-Il Myong

Kang-Bok Lee

Jongsub Cha

Sang-Hyun Mo

Hoe-Sung Yang

Dong-Beom Shin

Jae-Heum Lee

Hyung-Rae Park

Provided is an apparatus and method for transmitting packet data in a WSN. The apparatus for transmitting packet data in a WSN includes: a serial-to-parallel converter to parallel-convert information and output the converted information to two channel paths; a Walsh code pair generation unit to select an arbitrary Walsh code pair, mix the selected Walsh code pair with a pseudo noise (PN) code, and output one Walsh code to one channel path and the other Walsh code to the other channel path; a first mixer to mix the signals inputted to two channel paths, and generate a spread symbol for each path; a delay to delay the other channel path signal by a predetermined time; and a transmission unit to convert one channel path signal and the other channel path signal delayed by the delay into transmission frequency band signals, and transmit the converted signals as wireless signals.

Apparatus and method for transmitting packet data in wireless sensor network

Provided are a Radio Frequency Identification (RFID) tag and apparatus and method for locating a RFID tag without comparing arrival times of blink signals transmitted from the RFID tag in order to quickly trace a location of the RFID tag. The RFID tag includes a tag ID generator configured to generate a tag ID of the RFID tag, a blink generator configured to generate a plurality of sub-blink signals that form the blink signal, a sub-blink ID generator configured to generate sub-blink IDs for the generated sub-blink signals, a sub-blink ID inserter configured to insert the generated sub-blink IDs into the sub-blink signals, and a transmitter configured to transmit the blink signal having the tag ID and the sub-blink IDs.

Apparatus and method for locating RFID tag

A node structure of a multiway search tree can accelerates a search speed by making a key, a key pointer and a node pointer coincident with the size of a cache line through the use of only one pointer written on a node regardless of the number of keys used in the node and, thereafter, reduce the main memory capacity, a search method using the node structure and a computer readable recording medium in which a program implementing the search method is recorded. The method for generating nodes of a multiway search tree includes the steps of: a) assigning at least one key to each of the nodes; and b) assigning pointer information so that related information written on the node is accommodated in a cache line regardless a number of keys.

Method for generating nodes in multiway search tree and search method using the same

A dual ring communication method using a node system includes: with congestion occurring in a first node system, the first node system generating a congestion information packet and forwarding it to an upper node system positioned in a direction opposed to a direction of forwarding a data packet; a second node system determining whether it is the last node involved in the congestion; adding its congestion information to the congestion information packet and forwarding the congestion information packet to an upper node system when the second node system is not the last node; performing bandwidth allocation for the node systems in other case; and generating a bandwidth allocation packet and transmitting the bandwidth allocation packet to the node systems involved in the congestion.

Node system, dual ring communication system using node system, and communication method thereof

Growing community of inventors

Daejeon, South Korea

Heyung-Sub Lee