2,521 research outputs found
Recommended from our members
A collision-tolerant based anti-collision algorithm for large scale RFID system
Tag identification is an important issue in RFID system. Most existing anti-collision algorithms solely focus on reducing collision probability while suffering from vast idle slots. This paper proposes a collision-tolerant dynamic framed slotted Aloha (CE-DFSA) algorithm which attempts to identify multiple tags in a slot to reduce the total identification time in the process of identification. In CE-DFSA, tags are allocated with orthogonal Walsh Sequence (WS) so that multiple tags can be identified in a time slot without spreading the spectrum. Simulation results show that the proposed algorithm considerably accelerates the tag identification process with improved efficiency compared with existing anti-collision algorithms
Design verification of stress and sag for 500Â kV transmission line
Transmission line stress directly affects the tower sag force structure and a safe distance from the safe operation of the transmission lines play a crucial role. Calculation method for the preparation of the design process were complied, simply enter transmission liner parameters can be automatically obtained stress and sag. According to a 500Â kV transmission line tests carried out stress sag design verification, checking ground found stress design errors and were corrected to ensure the safety of the project. Calculation program can be developed for different voltage levels for line stress on cables sag design verification
Idle-slots elimination based binary splitting anti-collision algorithm for RFID
Tag collision avoidance is critical to the success of data communications in radio frequency identification (RFID) system. This paper presents an efficient idle-slots elimination based binary splitting (ISE-BS) algorithm to improve the performance of RFID system. In ISE-BS, by introducing 1 bit random number Q and 16-bits random number serial identifier (SID)which are transmitted before data exchange, tag collisions can be informed and unnecessary data exchange between reader and tags can be further eliminated. Moreover, ISE-BS exploits Q to separate conflicting tags into ‘0-1’ subsets randomly. Specifically, the tags in subset ‘0’ will start to transmit in the next period, where the success flag signal reflects the immediate data transmission. The tags in subset ‘1’ will wait in the pipeline. In such a way, the idle slots introduced by conventional binary splitting anti-collision algorithms can be removed with schedule of ISEBS. Extensive simulation results show that ISE-BS outperforms the existing proposed algorithms
Recommended from our members
Fast splitting based tag identification algorithm for anti-collision in UHF RFID System
Efficient and effective objects identification using Radio Frequency Identification (RFID) is always a challenge in large scale industrial and commercial applications. Among existing solutions, the tree based splitting scheme has attracted increasing attention because of its high extendibility and feasibility. However, conventional tree splitting algorithms can only solve tag collision with counter value equals to zero and usually result in performance degradation when the number of tags is large. To overcome such drawbacks, we propose a novel tree-based method called Fast Splitting Algorithm based on Consecutive Slot Status detection (FSA-CSS), which includes a fast splitting (FS) mechanism and a shrink mechanism. Specifically, the FS mechanism is used to reduce collisions by increasing commands when the number of consecutive collision is above a threshold. Whereas the shrink mechanism is used to reduce extra idle slots introduced by FS. Simulation results supplemented by prototyping tests show that the proposed FSA-CSS achieves a system throughput of 0.41, outperforming the existing UHF RFID solutions
- …