.png){kind=icon}
.png){kind=icon}
Return
An optimized Bidding-based coverage improvement algorithm for hybrid wireless sensor networks
.png){kind=icon}
PRE
AI
DOI：10.1016/j.compeleceng.2017.12.031.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The positioning techniques and adjusting sensing radius of nodes have an important role in improving the network coverage of hybrid wireless sensor networks. In this paper, we propose a novel optimized bidding-based algorithm that able to identify the coverage holes after deploying the stationary sensor nodes, also adjust sensing radius of nodes effectively based on the Delaunay triangulation. In addition, if necessary, an endeavor is made to relocate a portion of mobile nodes at the appropriate positions to cover the holes and reduce the overlapping area. Furthermore, the structure of created triangles i.e. acute and obtuse, layout vertices, region coverage status in before and after the relocation are considered in moving strategy of the proposed algorithm. Extensive simulations have been performed to validate the effectiveness of the proposed algorithm in terms of the coverage ratio, number of moved nodes, number of alive nodes and average of nodes movement. (C) 2017 Elsevier Ltd. All rights reserved.
Keywords:
Wireless sensor network
Area coverage
Sensing radius
Delaunay Triangulation
Optimized Bidding
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.9
Papers:
6.7K
Citations:
1.3W