Connected Coverage for RFID and Wireless Sensor Networks | Zendy

Ahmed Jedda | Zendy; Mazen G. Khair | Zendy; Hussein T. Mouftah | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Connected Coverage for RFID and Wireless Sensor Networks

Author(s) -

Ahmed Jedda,

Mazen G. Khair,

Hussein T. Mouftah

Publication year - 2012

Publication title -

procedia computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.334

H-Index - 76

ISSN - 1877-0509

DOI - 10.1016/j.procs.2012.06.146

Subject(s) - computer science , wireless sensor network , cover (algebra) , computer network , connected dominating set , connected component , default gateway , set (abstract data type) , node (physics) , graph , strongly connected component , wireless network , wireless , dominating set , algorithm , theoretical computer science , telecommunications , artificial intelligence , mechanical engineering , structural engineering , vertex (graph theory) , engineering , programming language

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research