The Coverage Force Algorithm for Heterogeneous Wireless Sensor Networks

Qin, Ningning; Zhang, Lin; Bao-guo, XU

doi:10.3724/sp.j.1146.2009.00694

Cited by 7 publications

(6 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Widespread multistage heterogeneous networks are used in applications such as surveillance [ 8 , 9 , 12 , 26 ] and vehicle detection [ 10 , 11 ]. In this experiment, each

is set randomly in the range of

.…”

Section: Simulation Results Analysismentioning

confidence: 99%

“…In our coverage research, without loss of generality, our study maintains the key idea that all different intensities among heterogeneous nodes are considered various sensing magnitude values [ 12 ]. In other words, the details of the differences are unimportant compared with the size of the fluctuation that can affect the sensing abilities (coverage forces) of the nodes.Before introducing our proposed ICFD and TES, one important notion and two rules need to be given, where the Division Point (DP) will be defined for the beginning of coverage division, the Conflict Resolution Rule (CRR) will adjust the locations of DPs and the Supplementary Division Rule (SDR) will extend the division results.…”

Section: Methodsmentioning

confidence: 99%

“…Superior to the original CFA [ 12 ], the DPs proposed in this study areupdatedusing absolute coordinates. In the obtained division, the division line segments have exhibited that desired feature where the coverage force received from the base node is not less than other nodes.…”

Section: Methodsmentioning

confidence: 99%

“…In terms of the first problem, most of the methods for dividing were inspired by computation geometry, such as the Voronoi algorithm [ 15 , 34 ], greedy algorithm [ 15 , 34 ], and coverage force algorithm (CFA) [ 12 ] presented in our early studies, which have been able to partition an area into cells for every node, where all the points can receivemore sensing force from the base node inside than the others outside. These dividing methods fulfill the overall qualitative descriptions for the different kinds of sensor networks.…”

Section: System Modelmentioning

confidence: 99%

“…Our research accomplishes several tasks and makes the following contributions: Unfreezing the reliant requirement for global network data. This study presents Improved Coverage Force Division (ICFD) to extend the present local Coverage Force Algorithm (simply as CFA) [ 12 ] by proposing the coverage force division map on the basis of absolute coordinates. As a qualitative research result, this map can find the weak sensing points (simply called Weak Points or WPs) without a priori knowledge of the overall network topology.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

A Trajectory-Based Coverage Assessment Approach for Universal Sensor Networks

Qin

Zheng

Tian

2015

Sensors

View full text Add to dashboard Cite

To solve the problem of coverage performance assessment, this study proposes an evaluation method based on the trajectory of the target, which is applicable to universal sensor networks, including both heterogeneous and homogeneous sensor networks. Different from the traditional Voronoi algorithm, the proposed Improved Coverage Force Division (ICFD) plans a coverage force division map whichscales the qualitative coverage performancebasedon both covering intensities andlocations of the nodes. Furthermore, the Trajectory-based Evaluating Schedule (TES) is responsible for solving the quantitative coverage evaluationproblem by measuringthe resulting trajectories’ Balance Values (BVs). A model of weak-point ranking conjoined in consideration of coverage force and distance can guide future deployment to compensate coverage. Comparative trials using the greedy algorithm, Voronoi algorithm, and the proposed TES verify that TES achieves the approximate results for two-stage and multistage heterogeneous sensor networks with acceptable difference and lower complexity, and it is superior to the Voronoi algorithm in homogeneous sensor networks interms of breaking the four-point circle block.

show abstract

“…Widespread multistage heterogeneous networks are used in applications such as surveillance [ 8 , 9 , 12 , 26 ] and vehicle detection [ 10 , 11 ]. In this experiment, each

is set randomly in the range of

.…”

Section: Simulation Results Analysismentioning

confidence: 99%

Section: Methodsmentioning

confidence: 99%

Section: Methodsmentioning

confidence: 99%

Section: System Modelmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

A Trajectory-Based Coverage Assessment Approach for Universal Sensor Networks

Qin

Zheng

Tian

2015

Sensors

View full text Add to dashboard Cite

show abstract

A Weighted Voronoi Diagram Based Self-deployment Algorithm for Heterogeneous Mobile Sensor Network in Three-Dimensional Space

Tan¹,

Tang²,

Hussain³

et al. 2019

Communications in Computer and Information Science

View full text Add to dashboard Cite

A Novel Association Rule-Based Data Mining Approach for Internet of Things Based Wireless Sensor Networks

et al. 2020

View full text Add to dashboard Cite

Wireless Sensor Network (WSN) is one of the fundamental technologies used in the Internet of Things (IoT) which is deployed for diverse applications to carry out precise real-time observations. The limited resources of WSN with massive volume of fast-flowing IoT data make the aggregation and analytics of data more challenging. Recently, data mining-based solutions have been proposed to effectively handle the data being generated by the sensors and to analyze the data patterns for deducing the required information from it. The increasing need of these techniques motivated us to propose a distributed and efficient data mining technique that not only handles the massive and rapidly generated data by the nodes, but also increases the life span of the network. In this paper, we propose a novel scheme for the IoT based WSN that mines the sensor data using association rule without moving it to any Cluster Head (CH) or Base Station (BS). The new proposed scheme enables sensors to perform computations locally and only the minimum higher-level statistical summaries of the data at Cluster Members (CMs) are exchanged with their CH. This considerably reduces the communication overhead which ultimately prolongs the network lifetime. The proposed scheme is evaluated via extensive simulations and the results obtained demonstrate that the integration of the proposed scheme in the existing protocols significantly reduces the communication overhead which ultimately prolongs the network lifetime and stability.

show abstract

The Coverage Force Algorithm for Heterogeneous Wireless Sensor Networks

Cited by 7 publications

References 0 publications

A Trajectory-Based Coverage Assessment Approach for Universal Sensor Networks

A Trajectory-Based Coverage Assessment Approach for Universal Sensor Networks

A Weighted Voronoi Diagram Based Self-deployment Algorithm for Heterogeneous Mobile Sensor Network in Three-Dimensional Space

A Novel Association Rule-Based Data Mining Approach for Internet of Things Based Wireless Sensor Networks

Contact Info

Product

Resources

About