Mobile node rostering in intermittently connected passive RFID networks

— This paper focuses on the problem of rostering in intermittently connected passive RFID networks. It aims to report a list of tagged mobile nodes that appear in given interested area(s) and time interval(s). Such rostering faces several unique challenges. First, the network consists of two dramatically different types of nodes: powerful static readers and extremely resource-constrained mobile tags. Communication can be established from a reader to a tag only, but not tags to tags or readers to readers. Therefore the connectivity is very low and intermittent. Besides connectivity, the tag’s computation power is also intermittent. It is available only for a short interval when the tag is powered up by a nearby reader, rendering any continuous functions impossible. Moreover, the capacity of tags is so limited that it becomes the critical network resource and communication bottleneck. To address the above challenges, we propose a rostering algorithm that employs a dynamic spaceeffic...

• Type: Journal
• Year: 2011
• Where: PERCOM
• Authors: Zhipeng Yang, Hongyi Wu
• Keywords: Communication Bottleneck, Computer Networks, Information Redundancy, PERCOM 2011, Scale Simulations