Abstract
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 Va such that they form, with a gateway node vg, a connected network. That is the induced graph of {Va ∪vg} 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
