Abstract: A RFID (Radio Frequency Identification) yoking-proof provides a verification manner that a pair of RFID tags is scanned simultaneously by one reader device to guarantee the physical proximity of multiple objects. However, the previous studies provide the verification that requires the online verifier. The connectivity between a reader and a verifier limits the practicality of a yoking proof. In this paper, we propose an offline yoking proof protocol to preserve the offline verification that does not require the online verifier. In addition, the protocol for a pair of tags is easily extended to the one for multiple tags without additional expensive devices. Our analysis shows that the proposed protocol provides offline verification securely and effectively.

• Publication Date: 05-Jan-2014
• DOI: 10.15224/978-981-07-8859-9-21
• Views: 0
• Downloads: 0

Abstract: The emergence of Vehicular Ad-hoc Networks (VANETs) provides drivers and passengers with safer and more convenient services. However special characteristics of VANETs such as high mobility, movement constraint, and signal blocking hinder the wide propagation of it. One good way to alleviate those unique characteristics of VANETs is clustering. Even though there are many clustering techniques, few investigations to understand them are conducted. In this paper, we examine some cluster based approaches in VANETs carefully and classify them into two categories based on the property of cluster; that is, stationary cluster and mobile cluster. Finally, the advantages and disadvantages of both will be illustrated. We hope that researchers who design the new clustering mechanism in VANETs could facilitate this classification to make theirs more suitable for their purpose.

• Publication Date: 05-Jan-2014
• DOI: 10.15224/978-981-07-8859-9-22
• Views: 0
• Downloads: 0