DkCS: An efficient dynamic k-coverage scheduling algorithm for Wireless Sensor Networks

A Distributed Scalar Controller Selection Scheme for Redundant Data Elimination in Sensor Networks

“…A redundant positioning architecture (Han et al 2008) discusses a novel architecture for processing vast amount of data from pervasive devises. Similarly, a novel approach has been suggested by Abdullah et al 2012 that provides required k coverage, where each point in a deployment field is covered by at least k sensors. The proposed algorithm builds a maximum number of layers, where each layer is 1-covered and 1-connected.…”

Redundant data minimisation using hexagonal scalar premier neighbourhood for optimum camera actuation scheme

“…The work carried out in [11] uses a node placement strategy for providing full coverage as well as connectivity among nodes in networks. The approach discussed in [12] depicts an algorithm that provides required k coverage. Recently, an in‐depth study is conducted in [13] from perspective deformation aspect.…”

“…ISPs, SSPs, TSPs, QSPs, QUSPs and TLSPs) present at the event region detect the event on behalf of their scalar sensing neighbours. ‘Two sensors i and j are said to be sensing neighbours, if their Euclidean distance ‘Dist ( i , j ) < 2 R S ’, where R s is the sensing range as used by Abdullah and Manaf [12]. These premiers communicate their corresponding cameras regarding the occurring event by broadcasting the event detect (ED) message which is sent by an SP to its corresponding camera.…”

Centralised cum sub‐centralised scheme for multi‐event coverage and optimum camera activation in wireless multimedia sensor networks

“…The work proposed in [13] uses a node placement strategy for providing full coverage and connectivity among nodes in networks. The approach discussed in [14] depicts an algorithm that provides required k coverage.…”