摘要:
Provided is a method for reading a tag in a mobile Radio Frequency Identification (RFID) environment. The tag reading method effectively identifies a tag by repeatedly transmitting a tag identification request in a predetermined time to prevent collision among RFID readers, when a plurality of RFID readers access to a tag. The method for reading a tag in a mobile RFID environment, which includes the steps of: a) transmitting a tag identification request signal to a tag; b) waiting for an acknowledgement signal to be transmitted from the tag; and c) when no acknowledgement signal is transmitted from the tag, retransmitting the tag identification request signal after a predetermined delay time passes.
摘要:
An apparatus for storing sensing data in a tag and a method thereof are provided. According to the present invention, data measured by the sensor is stored in volatile memory and important data from among the data stored in the volatile memory is stored in non-volatile memory according to a pre-set data loss prevention mechanism so that a battery and the tag including the battery have a longer life and stability of data can be secured.
摘要:
A passive tag including a volatile memory is provided. The passive tag includes: a sensing unit which senses or measures information about environmental surroundings of the tag; a volatile memory; a non-volatile memory; and a control unit which firstly stores resultant data sensed or measured by the sensing unit in the volatile memory and then moves the data stored in the volatile memory to the non-volatile memory according to pre-set conditions. Therefore, the life of the tag is prolonged and stability of important data can be secured.
摘要:
Provided is a Radio Frequency Identification (RFID) reader that can minimize collision among RFID readers in an environment where there are a plurality of RFID readers within a limited operating environment by making each RFID reader select a channel at different delay time based on a random value, and a method for controlling operation of the RFID reader. The RFID reader includes a random value generating unit; a reader control unit for adaptively deciding a counter value for generating the random value; an anti-collision unit for preventing collision among a plurality of tags; a reader transmitting unit for generating a reader command message determined by the anti-collision unit, encoding the reader command message, and modulating the reader command message; a reader receiving unit for demodulating and decoding a tag signal; and a channel operation control unit for selecting a channel to be used for the communication with the tag.
摘要:
An apparatus and method for detecting a wake-up burst of an active RFID tag are provided. The apparatus and method, for detecting the wake-up burst of the active RFID tag, are capable of reducing power consumption of the RFID tag by enabling the RFID tag when a RFID reader starts to communicate.
摘要:
The present invention relates to a sensor network having node architecture for performing trust management of neighboring sensor nodes, and to an adaptive method for performing trust management of neighboring sensor nodes for monitoring security in the sensor network. The sensor network includes a base station and a plurality of sensor nodes for reporting sensed information packets to the base station through radiofrequency signals relayed by other sensor nodes. A judge sensor node may have a trust estimator in its node architecture to evaluate trustworthiness of a neighboring suspect sensor node by determining a personal reference and receiving personal references from jury sensor nodes. Based on the trustworthiness of the suspect, the judge may modify a route for transmitting packets to the base station.
摘要:
There is provided to a method for avoiding indirect collision of beacon, including: collecting beacon information of neighboring nodes and allocating a time slot based on the collected beacon information; transmitting information on the allocated time slot to the neighboring nodes depending on time slots of the neighboring nodes; and checking whether the time slot overlaps based on a reply message from the neighboring nodes and reallocating a time slot upon occurrence of overlapping.