Distributed Hybrid Coverage Hole Recovery in Wireless Sensor Networks

Maali, Yashar; Rafiei, Ali; Ni, Wei

doi:10.1109/jsen.2016.2613539

Cited by 14 publications

(13 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Using the sleep scheduling technique, a guaranteed service coverage protocol for wireless sensor networks introduced in Zhang et al 169 In addition, the sleep scheduling mechanism is controlled by the sleep factor 170–173 . However, the sleep schedule technique cannot fix the coverage hole in the network precisely, when there is no active and inactive node in the coverage slot area.…”

Section: Service Discovery and Cluster‐based Routing Protocolsmentioning

confidence: 99%

Service redundancy and cluster‐based routing protocols for wireless sensor and mobile ad hoc networks: A survey

Yagoub

Rodrigues

Khalifa

et al. 2020

Int J Communication

View full text Add to dashboard Cite

SummaryService discovery (SD) is the cornerstone of wireless and mobile systems. The discovery of effective service is the key to achieve a higher level of ubiquity, which ensures the availability of services to users and applications significantly, and the high use of services. The research in this field is limited, with a few SD protocols available for specific purposes specified in the 6LoWPAN region. This paper discusses the various issues and challenges facing the design and selection of the appropriate service discovery and cluster‐based mechanism. Moreover, attention has been drawn to the cross‐layer solution by discussing different clustering techniques used to solve the redundancy problems. Furthermore, the service discovery protocols and cluster‐based routing protocols are critically investigated considering the redundancy problem, methods, mechanisms, and architectures by categorizing them into different categories, comparing them with fundamental parameters in the WSNs and MANETs environments. In addition, a modern form is proposed to show the life cycle of the service discovery process, and a new figure has been designed to clarify to the researchers various of the open issues related to the service discovery and cluster‐based routing protocols, corresponding objectives and the techniques of solving problems. Through the discussion of the scientific papers under survey, important results and valuable recommendations were reached. The survey is concluded with a summary, open research issues, outlook, and directions for future research on the topic.

show abstract

Section: Service Discovery and Cluster‐based Routing Protocolsmentioning

confidence: 99%

Service redundancy and cluster‐based routing protocols for wireless sensor and mobile ad hoc networks: A survey

Yagoub

Rodrigues

Khalifa

et al. 2020

Int J Communication

View full text Add to dashboard Cite

show abstract

“…In Line 1, the sink broadcasts the information of CICHs when some RMSE values of reconstruction points detected by the sink are greater than the given RMSE ε 0 . (17) has been selected as the objective function (14) calculate (19) has been selected as the objective function (16) calculate for each CICH h i ∈ H (29) w m j , h i = Q 0 (30) end for (31) end for (32) end if (33) a perfect matching is found from G (34) return the subset of mobile sensor nodes M In Line 2, every mobile sensor node m j ∈ M keeps the received information of all CICHs from the sink, where the received information contains the positions of the CICHs.…”

Section: A Definitions and Analyses Of The Ddr Algorithmmentioning

confidence: 99%

“…This method makes local healing where only sensor nodes scattered at a suitable distance from the hole will be joined in the fixing procedure. A new game-theoretic scheme was presented in [17], in which combined actions of physical relocation and sensing range adjustment allow each sensor node to decrease coverage holes in an energy-efficient distributed manner. The work [18] exploited a distributed solution, named as distributed Voronoi, which combines Voronoi and cooperation of mobile sensors to limit the movement of each sensor to avoid generating new coverage holes.…”

Section: Introductionmentioning

confidence: 99%

Repairing Confident Information Coverage Holes for Big Data Collection in Large-Scale Heterogeneous Wireless Sensor Networks

Chen

2019

IEEE Access

View full text Add to dashboard Cite

The quality of service (QoS) and lifetime of wireless sensor networks (WSNs) are severely degraded by coverage holes generated by random deployment or battery exhaustion of sensors. This work firstly introduces a novel confident information coverage CIC) model to dramatically reduce the density of sensor nodes and accurately detect confident information coverage holes (CICHs). Then, the problem of repairing confident information coverage holes (RCICHs) for big data collection in a large-scale heterogeneous WSN (LS-HWSN) which widely spreads over a geographic area with thousands of stationary sensor nodes and mobile sensor nodes is formulated, called as RCICH problem, which is to effectively repair CICHs considering that the transmitted data velocity of sensor nodes is different. Furthermore, we prove it to be NP-completeness. The target of the problem is to find a subset of mobile sensor nodes from all mobile sensor nodes while minimizing the amount of lost throughputs LTs) of all dispatched mobile sensor nodes or maximizing the amount of repairing transmission times (RTTs) for all dispatched mobile sensor nodes, with different objectives. Finally, based on the CIC model and the data-centric perspective, two heuristic schemes including a centralized dispatch scheme and a distributed dispatch scheme are proposed to effectively solve the RCICH problem. Simulation results show that the proposed schemes effectively repair CICHs while increasing the QoS and lifetime of the LS-HWSN with the topology control of a fan-shaped clustering (FSC) protocol. INDEX TERMS Large-scale heterogeneous wireless sensor networks, big data collection, confident information coverage, repairing confident information coverage holes.

show abstract

“…Authors in [15] proposed a distributed hybrid coverage hole healing algorithms which gave a game theoretic approach. Each sensor combined physical relocation and sensing range adjustment to minimize the coverage hole.…”

Section: Related Workmentioning

confidence: 99%

A mobile assisted coverage hole patching scheme based on particle swarm optimization for WSNs

Wang

Kim

et al. 2017

Cluster Comput

View full text Add to dashboard Cite

Wireless sensor networks (WSNs) have drawn much research attention in recent years due to the superior performance in multiple applications, such as military and industrial monitoring, smart home, disaster restoration etc. In such applications, massive sensor nodes are randomly deployed and they remain static after the deployment, to fully cover the target sensing area. This will usually cause coverage redundancy or coverage hole problem. In order to effectively deploy sensors to cover whole area, we present a novel node deployment algorithm based on mobile sensors. First, sensor nodes are randomly deployed in target area, and they remain static or switch to the sleep mode after deployment. Second, we partition the network into grids and calculate the coverage rate of each grid. We select grids with lower coverage rate as candidate grids. Finally, we awake mobile sensors from sleep mode to fix coverage hole, particle swarm optimization (PSO) algorithm is used to calculate moving position of mobile sensors. Simulation results show that our algorithm can effectively improve the coverage rate of WSNs.

show abstract

Distributed Hybrid Coverage Hole Recovery in Wireless Sensor Networks

Cited by 14 publications

References 28 publications

Service redundancy and cluster‐based routing protocols for wireless sensor and mobile ad hoc networks: A survey

Service redundancy and cluster‐based routing protocols for wireless sensor and mobile ad hoc networks: A survey

Repairing Confident Information Coverage Holes for Big Data Collection in Large-Scale Heterogeneous Wireless Sensor Networks

A mobile assisted coverage hole patching scheme based on particle swarm optimization for WSNs

Contact Info

Product

Resources

About