Дисертації з теми "Anti-collision protocol"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-18 дисертацій для дослідження на тему "Anti-collision protocol".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте дисертації для різних дисциплін та оформлюйте правильно вашу бібліографію.
Deegala, Kavindya. "Performance of slotted aloha anti-collision protocol for RFID systems under interfering environments." Thesis, Wichita State University, 2010. http://hdl.handle.net/10057/3476.
Повний текст джерелаThesis (M.S.)--Wichita State University, College of Engineering, Dept. of Electrical Engineering and Computer Science.
Bhogal, Varun. "Analysis of BFSA Based Anti-Collision Protocol in LF, HF, and UHF RFID Environments." UNF Digital Commons, 2014. http://digitalcommons.unf.edu/etd/511.
Повний текст джерелаDe, Silva M. H. Maheesha H. "An experimental study of EPCglobal class-1 generation-2 anti-collision protocol for RFID systems." Thesis, Wichita State University, 2010. http://hdl.handle.net/10057/3477.
Повний текст джерелаThesis (M.S.)--Wichita State University, College of Engineering, Dept. of Electrical Engineering and Computer Science.
ZHANG, LINCHAO. "Reliable Communication in Wireless Networks." Doctoral thesis, Politecnico di Torino, 2014. http://hdl.handle.net/11583/2537290.
Повний текст джерелаChemburkar, Kirti. "Performance of BFSA Based Anti-Collision Protocols for RFID Networks Supporting Identical Tags." UNF Digital Commons, 2011. http://digitalcommons.unf.edu/etd/124.
Повний текст джерелаKhanna, Nikita. "A Novel Update to Dynamic Q Algorithm and a Frequency-fold Analysis for Aloha-based RFID Anti-Collision Protocols." Scholar Commons, 2015. http://scholarcommons.usf.edu/etd/5844.
Повний текст джерелаBeaulier, François. "Transmission de données en temps réel en milieu perturbé, conception et réalisation d'un système anti-collision : réseau hertzien, bus de terrain, protocole, capteur." Paris 12, 1997. http://www.theses.fr/1997PA120023.
Повний текст джерелаShih, Yen-Chung, and 施彥仲. "Multi-Channel Anti-Collision Protocol for RFID." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/48101655322884582309.
Повний текст джерела國立宜蘭大學
多媒體網路通訊數位學習碩士在職專班
101
When multiple tags simultaneously transmit their IDs to Reader in the RFID system, the signals will collide. This collision will disturb the reader’s identification process. In this thesis, we based on Counter-based protocols, BT and ABS, it was mainly developed to reduce collision condition. Its protocol does not rely on tag IDs for the splitting, and it has the stable property that its performance is not affected by the ID distribution or the ID length. At the parallel transmission condition, this thesis develops multi-channel type protocol for BT and ABS to improve the performance of counter based protocols.
Ching-ChaoChang and 張景超. "Implementation of RFID Anti-Collision Algorithm for EPCglobal Gen2 Protocol." Thesis, 2012. http://ndltd.ncl.edu.tw/handle/91827476479538947879.
Повний текст джерела國立成功大學
電信管理研究所
100
In recent years, radio frequency identification (RFID) has become an important infrastructure technology. It is a fast, secure, and efficient identification procedure that influences many various applications, such as supply chain management, toll-payment, libraries, e-passports, and shopping. RFID technology works in a wireless environment in which a reader has to identify many tags at the same time. This usually leads to collisions and unidentified data in reading process. Therefore, one always strives to solve such an anti-collision problem. However, most research effort is usually limited to the stage of system simulation. Although the simulation is actually performed in accordance with the protocol, it is still not enough to explain the reliability in the real work. This research builds a RFID platform, including work of anti-collision algorithm, programs of compilation and burning, method of data collecting, and so on. We select a well-known algorithm (Schoute’s Method) to implement and compare with a base line algorithm (low bound method). The experiment results are quit consistent with that from other works of research. Thus, the experiment platform we built is reliable in actual work. Future research can focus on more efficient anti-collision algorithms, and use this experiment platform to verify the algorithms.
Wang, Bo-jyun, and 王柏鈞. "An Enhanced Anti-collision Algorithm in RFID Systems based on NEAA protocol." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/73630214985353293985.
Повний текст джерела國立臺灣科技大學
資訊工程系
97
RFID is an automatic identification technology in reader and tags communication by using RF wave. In the RFID system, due to there are usually more than one tags in the interrogation zone of reader, when multiple tags transmitted their data to the reader simultaneously, signal will be collided because the reader and tags communicate over a shared wireless channel, the reader may not recognize all tags due to the collisions. Therefore, how to reduce collisions is a significant issue for tag-identification in RFID system. New Enhance Anti-collision Algorithm (NEAA) is a novel anti-collision algorithm of tag ID identification in RFID system. Since the tag ID in RFID system is a unique binary number, NEAA use the characteristic of the tag ID is unique to identify multiple tags simultaneously. This paper proposes an anti-collision algorithm to improve the performance of NEAA by using TBCT (Two Bit Collision Timeslot) to increase the probability of M-readable. The proposed algorithm can also reduce the number of collisions and the identification latency.
WEI-TING, WONG, and 翁瑋廷. "Digital Anti-collision System Design for RFID EPC Class-1 Generation-2 Protocol." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/27786719758929261580.
Повний текст джерела中華大學
電機工程學系碩士班
94
In this paper, a digital anti-collision system circuit design for Radio Frequency Identification (RFID) tag is presented completely. This system implements the “Slotted Random Aloha” anti-collision algorithm. Hence, there are two functions commended to tags. One is using random number system to do time-division multiplexing (TDM) ; the other is data linking frequencies can choose by readers. The proposed anti-collision system circuit not only enhances functions to tags, but also speeds up the identification. Meanwhile, it reduces the error detection and the power consumption. We implemented the design on FPGA board ALTERA APEX20KE EP20K1500EBC652-1X with ALTERA QuartusⅡ tools for the waveform simulation. At last, the simulation results and measurement results were test and verified, compatible with the EPC Class-1 Generation-2 UHF RFID Protocol [1] successfully.
Lin, Chia-Chun, and 林鉫浚. "A Tree-based Anti-collision Protocol for RFID Tag Identification in Supply Chain Network." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/73687791021077499951.
Повний текст джерела國立臺灣科技大學
資訊管理系
98
Radio Frequency Identification (RFID) is a contactless automatic identification technology which communications between readers and tags via a shared wireless channel. With the ability of contactless identification, RFID has been adopted in several practical applications, such as logistics, inventory control, and supply chain management. In the supply chain process, the items which put together usually have continuous tag IDs. When a reader intends to gather all IDs from numerous existing tags, the tag-to-reader response may collide with each other and result in an identification failure called signal collision. This phenomenon will greatly degrade the tag recognition efficiency. To solve this problem, we design an efficient tag identification protocol for better tag recognition efficiency. A k-ary tree based abstract is adopted in our proposed protocol, called k-ary Tree-based Anti-collision Scheme (k-TAS), as an underlying architecture for collision resolution. In addition, we construct a supply chain network simulation process to evaluate the performance of our proposed RFID anti-collision protocol and other existing ones. The performance evaluation shows that our proposed tag identification protocol outperforms the existing RFID anti-collision schemes in terms of the identification delay and communication overhead.
Huang, Yi Pin, and 黃義彬. "An Enhanced Query Tree (EQT) Protocol for Memoryless Tag Anti-Collision in RFID Networks." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/60713756381325241106.
Повний текст джерелаHe, Jyun-Yan, and 何駿彥. "RFID Tag Anti-Collision Protocols." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/83672538755202151961.
Повний текст джерела國立東華大學
資訊工程學系
99
Radio frequency identification (RFID) system consists of radio tags, readers, and the backend database system that associates RFID tag data collected by readers for verification or special need. A Reader communicates with tags at distance through wireless transmission. Many manufacturers see the intended applications of RFID technology, and deploy RFID in inventory control, distribution industry and supply chain management. As far, there are already many concrete applications using RFID, e.g., inventory control, distribution industry and supply chain management. However, a so-called tag collision problem in RFID system happen when multiple tags respond to a reader simultaneously and the reader cannot differentiate these tags correctly. Tag collisions will degrade identification efficiency, and this unreliable identification compromises the usefulness of RFID system. There are two major types of anti-collision protocols. One is ALOHA-based protocol and the other is tree-based protocol. ALOHA-based protocol reduces the tag collisions, while it has the starvation problem (a tag cannot be identified for a long time). To address such problem, two tree-based protocols- binary tree (BT) protocol and the query tree (QT) protocol- were accordingly proposed. In this thesis, we propose two QT based protocols. Recently, a RN16QT was proposed, which used a RN16 random number as the temporary ID of tag. It successfully reduces the time consumption for tag identification. However, the tag collision still occurs due to the short length of RN16. We propose an effective RN16QT (ERN16QT) to enhance RN16QTA. Our ERN16QT can also address the similar EPC. A ternary tree is impossible in QT protocol, but it brings about the optimum performance for tag identification. We propose a practical ternary QT protocol to efficiently identify a binary EPC.
Li, Chia-Hou, and 李佳候. "RFID Reader Anti-Collision Protocols." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/46793210654871474108.
Повний текст джерела國立東華大學
資訊工程學系
99
Radio frequency identification (RFID) system consists of radio tags, readers and the backend database system. Readers communicate with tags through wireless transmission to identify a tag. RFID has various application services, e.g., inventory control, distribution industry and supply chain management. Due to the fast and successful deployment of large scale RFID system, this results in a situation that multiple readers are located in a small area. This multi-reader RFID environment is referred to as dense reader environment (DRE). In DRE, multiple readers are operating in proximity of one another. Therefore, several readers interrogate at the same time in the vicinity. This DRE makes the RF channel noisy such that readers cannot successfully identify tags. This is so-called reader collision problem. Up to date, there are some techniques to solve the reader collision problem, which can be categorized into TDMA, FDMA, and SDMA, but the problem of reader collision cannot be completely solved by FDMA. In this thesis propose two reader anti-collision protocol based on SDMA and TDMA. By using the five sweeping-beam antenna in a reader (SDMA), we carefully sett the initial angles of all readers’ smart antennas and sweeping 360 degrees simultaneously, we could successfully identify tags and solve the collision problems in dense environments. At this time, we use five different angles. A five coloring theorem is used to select the initial angles of readers. On the other hand, TDMA is to use different timeslots for the reader accessing. However, it may have the following weaknesses: each reader has long idle time if the number of time slots, and the other is asynchronous problem. We adopt the (k, d)-coloring theorem to solve this two weakness.
Yeh, Ming-Kuei, and 葉明貴. "Anti-Collision Protocols In RFID System." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/35665247699275186199.
Повний текст джерела國立中央大學
資訊工程研究所
98
In the RFID system, the reader identifies tags by interrogating their IDs through a shared wireless communication channel. Collisions occur when multiple tags transmit their IDs to the reader simultaneously, degrading the performance of tag identification. How to reduce tag collisions to speed up the identification is thus important. There are several anti-collision protocols proposed for dealing with tag collisions. They can be categorized into two classes: ALOHA-based protocols and tree-based protocols that include deterministic tree-based and probabilistic counter-based subclasses of protocols. In this dissertation, we propose two probabilistic counter-based (“Adaptive Splitting and Pre-Signaling” and “Parallel Splitting”) protocols and one deterministic query tree-based (“Parallel Reverse Response”) anti-collision protocol. 1) “Adaptive Splitting and Pre-Signaling” protocol uses the idea of “Adaptive Splitting” scheme to estimate the number K of oncoming identification tags and split them into K proper subgroups, besides “Pre-Signaling” scheme is proposed to reduce the number of messages sent between the reader and tags by detecting the number of tags (null, one or multiple tags) with counter=1 previously. 2) “Parallel Splitting” protocol uses the idea of “parallel splitting” scheme to split the unidentified tags concurrently instead of only the tags with counter = 0 as in the ISO 18000-6B standard. It also utilizes “adaptive identification-tree height adjustment” scheme to adjust the number of leaf nodes of identification tree to approach the number of tags. 3) “Parallel Reverse Response” protocol integrates the ideaof “parallel prefix matching” and “Parallel Two Sub-carriers Response” schemes to let the tags with prefix ID matching the request bit string S or complementary of S be arranged to respond in two sub-carriers simultaneously in order to speed up RFID tagidentification. We analyze and simulate these three proposed protocols and compare them with related protocols to demonstrate their advantages.
Wu, Shu-Rong, and 吳淑蓉. "A Review and Taxonomy of Anti-collision Protocols for RFID Tag Identification." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/96302614467192480201.
Повний текст джерела華梵大學
工業工程與經營資訊學系碩士班
97
Radio Frequency Identification (RFID) is an automatic identification system for objects, which consists of readers、tags and host application system. A tag has a unique identification number (ID), and a reader communicates with tags which attached to objects over a shared wireless channel for tag identification. When reader interrogates tags within the reader’s range, and multiple tags transmit their IDs simultaneously, the tag-to-reader signals occur collision. Therefore, tag collision disturbs the reader’s identification efficiency. The tag anti-collision protocol is an important issue for fast recognizes objects. This research is major reviewed tag anti-collision protocols that be proposed recently. Tag anti-collision protocols can be grouped into two broad categories:Tree-based protocols and Aloha-based protocols. The research contains thirteen tag anti-collision protocols, seven of them are on the basis of Tree-based protocol, and the others are on the basis of Aloha-based protocol. This research classified these protocols by thier characteristic, and also provides a comparison between reviewed protocols, advantages and shortcomings, and suitable condition for use. This review could provide the basis for developing more efficient and perfect tag anti-collision protocols.
Lin, Chih-Chung, and 林志宗. "Anti-Collision Protocols with Blocking, Pairing, and Symbolic Response Technologies in RFID Tag Identification." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/51617047093161078035.
Повний текст джерела國立臺灣科技大學
資訊管理系
98
In Radio Frequency Identification (RFID) systems, the reader identifies tags through communication over a shared wireless channel. When multiple tags transmit their IDs simultaneously, their signals collide, increasing the identification delay. Therefore, many previous anti-collision algorithms, including an adaptive query splitting algorithm (AQS) and an adaptive binary splitting algorithm (ABS), focused on solving this problem. The reader, using AQS or ABS, reserves information obtained from the last process of tag identification in order to fast re-identify the staying tags. Using this information, AQS and ABS can successfully avoid collisions among staying tags. From the previous study, ABS may have the shorter identification delay, while AQS requires lighter tag specification. We propose three techniques based on ABS and AQS to accelerate identifying RFID tags, i.e., Blocking technique, Pairing technique, and Symbolic Response technique. First, because AQS and ABS let staying tags collide with arriving tags that newly appear in the current frame and were not recognized in the last frame, we propose Blocking technique to successfully prevent staying tags from be collided by arriving tags. After successfully dividing tags into arriving tags and staying tags, to accelerate identifying staying tags, we not only use Blocking technique but also further adopt Pair technique, which allows each pair of the tags recognized in the last frame to transmit their IDs simultaneously in the current frame. Then, we also discover staying tags do not need to respond complete IDs when arriving tags and staying tags are divided, because the algorithms already retained these IDs obtained from the last frame. Thus, we propose Symbolic Response technique to allow each staying tag to respond a symbolic response replacing the tag ID when re-identifying these recognized tags. We adopt Blocking technique on ABS and AQS to respectively propose Single resolution blocking ABS algorithm (SRBBT) and Single resolution blocking AQS algorithm (SRBQT), but they still identify staying tags one by one. Then, therefore, we adopt Pair and Blocking technique to propose Pair resolution blocking ABS algorithm (PRBBT) and Pair resolution blocking AQS algorithm (PRBQT). Moreover, PRBQT couples staying tags by sending a query that includes two ID prefixes to reduce the time at identifying staying tags. That means that PRBQT prepares two ID prefixes for each pair of staying tags. Thus, we further propose Enhanced pair resolution blocking AQS algorithm (EPRBQT), which also adopts the same Blocking technique as PRBQT, but uses a different Pair technique from it. EPRBQT uses a query that includes only one ID prefix to couple staying tags; thus, it has fewer transmitted bits compared to PRBQT. Finally, we use Symbolic response technique and respectively modify SRBBT, SRBQT, PRBBT, and PRBQT to develop SSRBBT, SSRBQT, SPRBBT, and SPRBQT, which allow each staying tag to respond a symbolic response replacing the tag ID when re-identifying these recognized tags. In this presentation, the performance of all algorithms is formally analyzed. And then, the analytic and simulation results show that our algorithms are better than ABS and AQS. The blocking algorithms can avoid more collisions than the non-blocking algorithms. And then, by Pair technology, the pairing blocking algorithms reduce about the half time at identifying staying tags compared with non-pairing blocking algorithms. Moreover, using Symbolic Response technology in blocking algorithms, this kind of algorithms successfully reduces much transmission time. Finally, because SPRBBT combines three technologies, i.e., blocking, pairing, and symbolic response, it shows the best performance.