Performance analysis of routing protocols for Mobile Wireless Sensor Network in an environment with obstacles using NCTUns tools

Benkirane, Said; Hssane, Abderrahim Beni; Hasnaoui, My Lahcen; Ouadghiri, My Driss El; Laghdir, Mohamed

doi:10.1109/ngns.2012.6656102

Cited by 2 publications

(1 citation statement)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…On the other hand, the appearance of coverage holes indicates the burst of special events, such as forest fire and earthquake [8]. Unfortunately, due to nonuniformity of deployment [9], failure of nodes [10], and obstacle of terrain [11], coverage holes are bound to appear and gradually increase in number and size. Thus, to alleviate the increase is stringently demanded [12].…”

Section: Introductionmentioning

confidence: 99%

Detecting Boundary Nodes and Coverage Holes in Wireless Sensor Networks

Zhao¹,

Liu²,

Lei³

et al. 2016

Mobile Information Systems

View full text Add to dashboard Cite

The emergence of coverage holes in wireless sensor networks (WSNs) means that some special events have broken out and the function of WSNs will be seriously influenced. Therefore, the issues of coverage holes have attracted considerable attention. In this paper, we focus on the identification of boundary nodes and coverage holes, which is crucially important to preventing the enlargement of coverage holes and ensuring the transmission of data. We define the problem of coverage holes and propose two novel algorithms to identify the coverage holes in WSNs. The first algorithm, Distributed Sector Cover Scanning (DSCS), can be used to identify the nodes on hole borders and the outer boundary of WSNs. The second scheme, Directional Walk (DW), can locate the coverage holes based on the boundary nodes identified with DSCS. We implement the algorithms in various scenarios and fully evaluate their performance. The simulation results show that the boundary nodes can be accurately detected by DSCS and the holes enclosed by the detected boundary nodes can be identified by DW. The comparisons confirm that the proposed algorithms outperform the existing ones.

show abstract