Localized discrete fourier transform spread OFDM (DFT-SOFDM) systems for 4G wireless communication

Master'sMASTER OF ENGINEERIN

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

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 coherent authentication framework for mobile computing based on homomorphic signature and implicit authentication

Mobile cloud computing is an extension of cloud computing that allow the users to access the cloud service via their mobile devices. Although mobile cloud computing is convenient and easy to use, the security challenges are increasing significantly.One of the major issues is unauthorized access.Identity Management enables to tackle this issue by protecting the identity of users and controlling access to resources. Although there are several IDM frameworks in place, they are vulnerable to attacks like timing attacks in OAuth, malicious code attack in OpenID and huge amount of information leakage when user’s identity is compromised in Single Sign-On. Our proposed framework implicitly authenticates a user based on user’s typing behavior.The authentication information is encrypted into homomorphic signature before being sent to IDM server and tokens are used to authorize users to access the cloud resources.Advantages of our proposed framework are: user’s identity protection and prevention from unauthorized access

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