A Reduced Complexity of Vahedi's Tag Estimation Method for DFSA

In order to calculate the number of tags in a radio frequency identification (RFID) system, several tag estimation methods have been investigated in literature and most of the available estimation methods need the overall knowledge of idle, success and collision slots of the previous frame to carry out the tag estimation process. In this article, we present three techniques to reduce the complexity of Vahedi’s tag estimation for tag collision resolution in RFID systems using dynamic frame slotted ALOHA. Our modified and useful approach considers the information about only the number of empty, successful or colliding slots in the previous frame for the tag estimation. Three decision rules were obtained by maximizing the likelihood of success, idle and collision which helps in the reduction of complexity substantially. However, the accuracy of estimation decreases for success-only and idle-only methods while the collision-only method gives a consistent and lower estimate error when the frame sizes and the number of tags increase

Hardware Software Co-Design of a Farming Robot

Food means life and no one can think about living without food. This is the most fundamental human necessity and food security is one of the major global concern of this century. With the revolution and recent advancements in the field of electronics and communication, there has been a paradigm shift from conventional farming ways to the modern one. This paper talks about the development of hardware software co-design of agricultural farming robot. Our developed farming robot has two parts namely hardware part which further consists of mechanical, electrical, control and tools segments and the software part which allows user to interact with the farming robot via cloud service. Our proposed hardware architecture is compatible with commercial Farmbot product and the developed web-based software can be extended for more features and applications. Furthermore, the developed robot has been tested and it works well

A collision resolution algorithm for RFID using modified dynamic tree with Bayesian tag estimation

© 1997-2012 IEEE. A new tree-based anti-collision protocol for radio-frequency identification systems is proposed to achieve a very high tag identification efficiency. The proposed algorithm works in two phases. In the first phase, the number of competing tags is estimated through the proposed Bayesian estimation technique, while in the second phase, tags are identified using our modified dynamic tree algorithm. The system efficiency is mathematically derived and verified through simulation. Numerical results show that the proposed algorithm achieves a tag identification system efficiency of 45% and a time system efficiency of 78.5%, thus outperforming any existing collision resolution algorithms

A Comparative Study of Customer Preferences for Telecommunication Technologies in Pakistan

The telecommunication industry is a huge and ever-growing industry and it is contributing dominantly to the economy in terms of revenue generation and being one of the biggest taxpayers to the government. Telecommunication is now considered to be a basic necessity. In this paper, a study has been conducted to know the customer preferences of telecommunication technologies in Lahore, Pakistan, and also to compare different customer preferences for telecommunication technologies. From the results of our study, we have concluded that there is a great variation among people in terms of their usage of mobile phones and internet services. Furthermore, results regarding the relationship between the socio-demographic characteristics and the preference towards specific telephony and internet service providers have also been analyzed. This work is unique when the scenario of Pakistan is considered. No such study has been conducted in Pakistan to know the customer preferences in Pakistan. Some recommendations for the telecommunication operators have also been discussed which can help to know their customer needs in a better fashion

Frame Size Analysis of Optimum Dynamic Tree in RFID Systems

In RFID (Radio Frequency Identification) system, an anti-collision algorithm plays a prominent role in the tag identification process in order to reduce the tag identification delay and enhance the RFID system efficiency. In this work, we present a theoretical analysis of optimal frame size assignment for maximizing the system efficiency of a tree-based anti-collision algorithm, called optimum dynamic tree (ODT) algorithm, for RFID tag identification process. Our analysis indicates that the appropriate frame size for a given number of competing tags should not be set to the same value as the number of tags, which is commonly adopted in the literature. Instead, the frame size should be smaller roughly by a factor of 0.871 to maximize system efficiency. The closed-form for calculating system efficiency is derived and the derived simulation results are in a good agreement with the theoretical one. The exact appropriate frame sizes for the number of tags ranging from 2 to 100 are tabulated and compare the tag-identification time of conventional binary tree and ODT algorithms by using the international standard ISO 18000-6B

A fast tag identification anti-collision algorithm for RFID systems

© 2019 John Wiley & Sons, Ltd. In this work, we propose a highly efficient binary tree-based anti-collision algorithm for radio frequency identification (RFID) tag identification. The proposed binary splitting modified dynamic tree (BS-MDT) algorithm employs a binary splitting tree to achieve accurate tag estimation and a modified dynamic tree algorithm for rapid tag identification. We mathematically evaluate the performance of the BS-MDT algorithm in terms of the system efficiency and the time system efficiency based on the ISO/IEC 18000-6 Type B standard. The derived mathematical model is validated using computer simulations. Numerical results show that the proposed BS-MDT algorithm can provide the system efficiency of 46% and time system efficiency of 74%, outperforming all other well-performed algorithms

Computationally efficient implementation of video rectification in an FPGA for stereo vision applications

Abstract—In order to obtain depth perception in computer vision, it is needed to process pairs of stereo images. This process is computationally challenging to be carried out in real-time, because it requires the search for matches between objects in both images. Such process is significantly simplified if the images are rectified. Stereo image rectification involves a matrix transformation which when done in software will not produce real-time results although it is very demanding. Therefore, the video streaming and matrix transformation are not usually implemented in the same system. Our product is a stereo camera pair which produces a rectified real time image output with a resolution of 320x240 at a frame rate of 15FPS and delivers them via a 100-Ethernet interface. We use a Spartan 3E FPGA for real-time processing within which we implement an image rectification algorithm