TY - GEN
T1 - RFID trees
T2 - 7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2010
AU - Wu, Victor K.Y.
AU - Vaidya, Nitin H.
PY - 2010
Y1 - 2010
N2 - We create a distributed storage infrastructure by embedding passive RFID tags in trees, for forest search and rescue. As a hiker moves through the forest, her reader writes a unique identifier (ID) and increasing sequence numbers (SNs) to tags, called (ID,SN) pairs. This creates a digital path for searchers to follow if the hiker is lost. Since tag memory is limited, hikers must share this constrained resource to preserve their digital paths. At each tag, we consider a hiker overwriting an existing (ID,SN) pair if the tag is already full, according to one of four algorithms. In Oldest Selection (OS), the hiker deletes the oldest (ID,SN) pair. In Random Selection (RS), the hiker randomly deletes an (ID,SN) pair. In Highest Frequency Selection (HFS), the hiker deletes the (ID,SN) pair associated with the ID that she has seen the most in previous tag encounters. In Lowest Delete Frequency Selection (LDFS), the hiker deletes the (ID,SN) pair associated with the ID that she has deleted the least in previous tag encounters. HFS performs the best, but requires hikers to remember the number of ID encounters in the past, for each hiker ID.
AB - We create a distributed storage infrastructure by embedding passive RFID tags in trees, for forest search and rescue. As a hiker moves through the forest, her reader writes a unique identifier (ID) and increasing sequence numbers (SNs) to tags, called (ID,SN) pairs. This creates a digital path for searchers to follow if the hiker is lost. Since tag memory is limited, hikers must share this constrained resource to preserve their digital paths. At each tag, we consider a hiker overwriting an existing (ID,SN) pair if the tag is already full, according to one of four algorithms. In Oldest Selection (OS), the hiker deletes the oldest (ID,SN) pair. In Random Selection (RS), the hiker randomly deletes an (ID,SN) pair. In Highest Frequency Selection (HFS), the hiker deletes the (ID,SN) pair associated with the ID that she has seen the most in previous tag encounters. In Lowest Delete Frequency Selection (LDFS), the hiker deletes the (ID,SN) pair associated with the ID that she has deleted the least in previous tag encounters. HFS performs the best, but requires hikers to remember the number of ID encounters in the past, for each hiker ID.
UR - http://www.scopus.com/inward/record.url?scp=77955112418&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77955112418&partnerID=8YFLogxK
U2 - 10.1109/SECON.2010.5508249
DO - 10.1109/SECON.2010.5508249
M3 - Conference contribution
AN - SCOPUS:77955112418
SN - 9781424471515
T3 - SECON 2010 - 2010 7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks
BT - SECON 2010 - 2010 7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks
Y2 - 21 June 2010 through 25 June 2010
ER -