Connected Coverage for RFID and Wireless Sensor Networks

We introduce a localized distributed algorithm for the connected RFID coverage problem which we name LCTC (Local Connect Then Cover). Given a set of RFID readers V and tags T, the problem is to find the minimum number of readers V-a such that they form, with a gateway node v(g), a connected network. That is the induced graph of {V-a boolean OR v(g)} is connected where any two readers are connected if they are in proximity of each other. Algorithm LCTC which builds a connected dominating set and add to it more nodes to cover every tag in the network. Algorithm LCTC was shown through simulation experiments to give excellent results in terms of the number of non-redundant readers generated and execution time. Algorithm LCTC can be applied to the targets connected coverage problem found in the field of wireless sensor networks and RFID/Sensors networks. (C) 2011 Published by Elsevier Ltd.