The optimal k-covering tag deployment for RFID-based localization

NCUIR > College of Electrical Engineering & Computer Science > Department of Computer Science and information Engineering > journal & Dissertation > Item 987654321/51648

Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/51648

Title:	The optimal k-covering tag deployment for RFID-based localization
Authors:	Ku,WS;Sakai,K;Sun,MT
Contributors:	資訊工程學系
Date:	2011
Issue Date:	2012-03-27 18:58:26 (UTC+8)
Publisher:	國立中央大學
Abstract:	Radio Frequency Identification (RFID) technologies are applied in many fields for a variety of applications today. Recently, new solutions are proposed to deploy RF tags on the ground instead of attaching them to objects for RFID-based monitoring and localization. However, the optimal tag deployment strategy is yet to be addressed. In this paper, we identify the optimal deployment patterns that guarantee k-covering (i.e., at least k RFID tags are accessible anywhere in the deployment region), where k <= 3. In addition, we analyze the achievable minimum upper bound and the average of localization error when the optimal deployment patterns are applied. The numerical results show that our optimal deployment patterns significantly reduce the required number of tags for k-covering compared with the square pattern which is commonly used in RFID-based monitoring and localization systems. The comparison between simulation and analytical results shows that our analytical models provide very accurate estimations of localization error. (C) 2010 Elsevier Ltd. All rights reserved.
Relation:	JOURNAL OF NETWORK AND COMPUTER APPLICATIONS
Appears in Collections:	[Department of Computer Science and information Engineering] journal & Dissertation

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	558	View/Open

社群 sharing