Authors: Yasuhiro Imasaki, Yongbing Zhang, Yusheng Ji
Addresses: Utsunomiya City Government, 1-1-5 Asahi, Utsunomiya, Tochigi 320-8540, Japan. ' Graduate School of Systems and Information Engineering, University of Tsukuba, 1-1-1 Tennodai, Tsukuba, Ibaraki 305-8573, Japan. ' National Institute of Informatics, 2-1-2 Hitotsubashi, Chiyoda-ku, Tokyo 101-8430, Japan
Abstract: Wireless devices (nodes) with Radio Frequency Identification (RFID) sensors can move autonomously and transmit data to other devices directly or via some intermediate devices. A node has to guarantee to find a secure transmission route to a given destination node and to minimise the transmission overhead. A traditional routing algorithm either guarantees the reachability to the destination but with a long route length or yields a short route but with no reachability guarantee. In this paper, we propose an efficient algorithm called SKIP-FACE that guarantees the reachability and provides shorter route length than previous approaches like FACE. We also propose an efficient algorithm called TRIANGLE that utilises the record of route search in searching decision for a source-destination pair and provides much higher reachability than previous approaches with no reachability guarantee like COMPASS and GEDIR. Simulation results show that SKIP-FACE yields 15% shorter route length and 15% less routing messages than FACE. Furthermore, the results show that the reachability in TRIANGLE is always higher than 95% whereas the reachability in COMPASS or GEDIR can be lower than 30% in cases when the node density is low or the transmission range is short.
Keywords: RFID sensor networks; radio frequency identification; data transmission; route search; reachability guarantee; planar graph; RFID security; secure transmission.
International Journal of Security and Networks, 2010 Vol.5 No.2/3, pp.119 - 127
Available online: 17 Mar 2010 *Full-text access for editors Access for subscribers Purchase this article Comment on this article