SwePub
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "WFRF:(Perallos Asier) "

Sökning: WFRF:(Perallos Asier)

  • Resultat 1-3 av 3
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  • Hugo, Landaluce, et al. (författare)
  • A High Throughput Anticollision Protocol to Decrease the Energy Consumption in a Passive RFID System
  • 2017
  • Ingår i: Wireless Communications and Mobile Computing. - : Hindawi Limited. - 1530-8669 .- 1530-8677. ; 2017
  • Tidskriftsartikel (refereegranskat)abstract
    • One of the main existing problems in Radio Frequency Identification (RFID) technology is the tag collision problem. When several tags try to respond to the reader under the coverage of the same reader antenna their messages collide, degrading bandwidth and increasing the number of transmitted bits. An anticollision protocol, based on the classical Binary Tree (BT) protocol, with the ability to decrease the number of bits transmitted by the reader and the tags, is proposed here. Simulations results show that the proposed protocol increases the throughput with respect to other recent state-of-the-art protocols while keeping a low energy consumption of a passive RFID system.
  •  
2.
  • Hugo, Landaluce, et al. (författare)
  • An energy and identification time decreasing procedure for memoryless RFID Tag Anti-Collision Protocols
  • 2016
  • Ingår i: IEEE Transactions on Wireless Communications. - 1558-2248 .- 1536-1276. ; 15:6, s. 4234-4247
  • Tidskriftsartikel (refereegranskat)abstract
    • Up to date energy-aware Radio Frequency Identification (RFID) anti-collision protocols are mainly focused on RFID systems using active tags. The introduction of RFID in portable devices, and the increasing popularity of passive tags, demand slow energy-consumption anti-collision protocols in environments with passive tags. Memoryless protocols present the simplest tag hardware that is beneficial for a low energy consumption. However, the excessive collisions required by these protocols increases the energy consumption, wasting a large number of tag transmitting bits. In this paper, a window procedure is presented to manage the length of the tags’ bit-stream in order to limit the energy wastage in collisions. The bit window is applied to two memoryless anti-collision protocols, the query tree protocol (QT) and the collision tree protocol (CT), producing the query window tree protocol (QwT) and the collision window tree protocol(CwT). Simulations show that the use of this window yields significant reductions in energy consumption and identification time. In addition, QwT and CwT are compared to state of the art memoryless protocols to confirm that CwT is an outstanding candidate for reducing energy consumption. Also, the results obtained show how the bit window procedure increases energy savings as the length of the tag ID increases.
  •  
3.
  • Hugo, Landaluce, et al. (författare)
  • Simplified computation in memoryless anticollision RFID identification protocols
  • 2014
  • Ingår i: Electronics Letters. - : Institution of Engineering and Technology (IET). - 1350-911X .- 0013-5194. ; 50:17, s. 1250-1252
  • Tidskriftsartikel (refereegranskat)abstract
    • A memoryless-based Collision window Tree plus (CwT+ ) protocol for simplified computation in anti-collision radio frequency identification (RFID) is proposed and presented. The CwT+ makes effective use of a threshold to accurately enhance bit-tracking and in turn lowers the identification time of the communication response. The threshold limits the bitstream of responding tags in an accurate fashion for simplified computation in the interrogation procedure. Simulation results show the outperformance of the CwT+ compared with earlier protocols.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-3 av 3

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy