Connected Coverage for RFID and Wireless Sensor Networks

被引:5
|
作者
Jedda, Ahmed [1 ]
Khair, Mazen [1 ]
Mouftah, Hussein T. [1 ]
机构
[1] Univ Ottawa, Sch Elect Engn & Comp Sci, Ottawa, ON K1N 6N5, Canada
来源
ANT 2012 AND MOBIWIS 2012 | 2012年 / 10卷
关键词
RFID; Wireless Sensor Networks; connected coverage;
D O I
10.1016/j.procs.2012.06.146
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:1046 / 1051
页数:6
相关论文
共 50 条
  • [11] Maximizing network lifetime for connected target coverage in wireless sensor networks
    Zhao, Qun
    Gurusamy, Mohan
    WIMOB 2006: 2ND IEEE INTERNATIONAL CONFERENCE ON WIRELESS AND MOBILE COMPUTING, NETWORKING AND COMMUNICATIONS, PROCEEDINGS, 2006, : 94 - +
  • [12] Connected target coverage for fully data gathering in wireless sensor networks
    Junbin, Liang
    Ming, Liu
    Xiaoyan, Kui
    Sensors and Transducers, 2013, 155 (08): : 74 - 79
  • [13] A Virtual Square Partition for Connected Coverage Assurance in Wireless Sensor Networks
    Adulyasas, Attapol
    Sun, Zhili
    Wang, Ning
    2015 IEEE SENSORS APPLICATIONS SYMPOSIUM (SAS), 2015, : 299 - 304
  • [14] A Coverage Algorithm for Intermittently Connected Delay Tolerant Wireless Sensor Networks
    Vasconcelos, Israel L. C.
    Lima, David H. S.
    Figueiredo, Carlos M. S.
    Aquino, Andre L. L.
    2015 7TH INTERNATIONAL CONFERENCE ON NEW TECHNOLOGIES, MOBILITY AND SECURITY (NTMS), 2015,
  • [15] K-Connected target coverage problem in wireless sensor networks
    Li, Deying
    Cao, Jiannong
    Liu, Ming
    Zheng, Yuan
    COMBINATORIAL OPTIMIZATION AND APPLICATIONS, PROCEEDINGS, 2007, 4616 : 20 - +
  • [16] On Connected Target k-coverage in Heterogeneous Wireless Sensor Networks
    Yu, Jiguo
    Chen, Ying
    Huang, Baogui
    2015 INTERNATIONAL CONFERENCE ON IDENTIFICATION, INFORMATION, AND KNOWLEDGE IN THE INTERNET OF THINGS (IIKI), 2015, : 262 - 265
  • [17] On Connected Target k-Coverage in Heterogeneous Wireless Sensor Networks
    Yu, Jiguo
    Chen, Ying
    Ma, Liran
    Huang, Baogui
    Cheng, Xiuzhen
    SENSORS, 2016, 16 (01)
  • [18] A location-unaware connected coverage protocol in wireless sensor networks
    Mao, Yingchi
    Chen, Lijun
    Chen, Daoxu
    UBIQUITOUS INTELLIGENCE AND COMPUTING, PROCEEDINGS, 2007, 4611 : 524 - +
  • [19] Minimum Connected Sensor Cover and Maximum-Lifetime Coverage in Wireless Sensor Networks
    Du, D.-Z. (dzdu@utdallas.edu), 1600, Springer Science and Business Media, LLC (51):
  • [20] Sensor and sink placement, scheduling and routing algorithms for connected coverage of wireless sensor networks
    Kabakulak, Banu
    AD HOC NETWORKS, 2019, 86 : 83 - 102