Deployment of Sensor Nodes for Connectivity Restoration and Coverage Maximization in WSNs

Wireless sensor networks are envisioned to play a very important role in the Internet of Things in near future and therefore the challenges associated with wireless sensor networks have attracted researchers from all around the globe. A common issue which is well studied is how to restore network connectivity in case of failure of single or multiple nodes. Energy being a scarce resource in sensor networks drives all the proposed solutions to connectivity restoration to be energy efficient. In this paper we introduce an intelligent on-demand connectivity restoration technique for wireless sensor networks to address the connectivity restoration problem, where nodes utilize their transmission range to ensure the connectivity and the replacement of failed nodes with their redundant nodes. The proposed technique helps us to keep track of system topology and can respond to node failures effectively. Thus our system can better handle the issue of node failure by introducing less overhead on sensor node, more efficient energy utilization, better coverage, and connectivity without moving the sensor nodes.

Download Full-text

PINC: Pickup Non-Critical Node Based k-Connectivity Restoration in Wireless Sensor Networks

Sensors ◽

10.3390/s21196418 ◽

2021 ◽

Vol 21 (19) ◽

pp. 6418

Author(s):

Vahid Khalilpour Akram ◽

Zuleyha Akusta Dagdeviren ◽

Orhan Dagdeviren ◽

Moharram Challenger

Keyword(s):

Data Transmission ◽

Sensor Nodes ◽

Wireless Sensor ◽

Critical Groups ◽

Critical Node ◽

Connectivity Restoration ◽

Critical Nodes ◽

Communication Path ◽

Complicated Task ◽

Node Failures

A Wireless Sensor Network (WSN) is connected if a communication path exists among each pair of sensor nodes (motes). Maintaining reliable connectivity in WSNs is a complicated task, since any failure in the nodes can cause the data transmission paths to break. In a k-connected WSN, the connectivity survives after failure in any k-1 nodes; hence, preserving the k-connectivity ensures that the WSN can permit k-1 node failures without wasting the connectivity. Higher k values will increase the reliability of a WSN against node failures. We propose a simple and efficient algorithm (PINC) to accomplish movement-based k-connectivity restoration that divides the nodes into the critical, which are the nodes whose failure reduces k, and non-critical groups. The PINC algorithm pickups and moves the non-critical nodes when a critical node stops working. This algorithm moves a non-critical node with minimum movement cost to the position of the failed mote. The measurements obtained from the testbed of real IRIS motes and Kobuki robots, along with extensive simulations, revealed that the PINC restores the k-connectivity by generating optimum movements faster than its competitors.

Download Full-text

Smart node relocation (SNR) and connectivity restoration mechanism for wireless sensor networks

EURASIP Journal on Wireless Communications and Networking ◽

10.1186/s13638-021-02053-8 ◽

2021 ◽

Vol 2021 (1) ◽

Author(s):

Mahmood ul Hassan ◽

Khalid Mahmood ◽

Muhammad Kashif Saeed ◽

Shahzad Ali ◽

Safdar Zaman ◽

...

Keyword(s):

Wireless Sensor Networks ◽

Sensor Networks ◽

Performance Metrics ◽

Base Station ◽

Sensor Nodes ◽

Wireless Sensor ◽

Basic Operation ◽

Efficient Operation ◽

Connectivity Restoration ◽

Node Failures

AbstractNode failures are inevitable in wireless sensor networks (WSNs) because sensor nodes in WSNs are miniature and equipped with small and often irreplaceable batteries. Due to battery drainage, sensor nodes can fail at any instance. Moreover, WSNs operate in hostile environments and environmental factors may also contribute to nodes failure. Failure of nodes leads to disruption of inter-node connectivity and might also lead to network partitioning. Failure to communicate with each other and with the base station can compromise the basic operation of the sensor network. For restoration of connectivity, a robust recovery mechanism is required. The existing connectivity restoration mechanisms suffer from shortcomings because they do not focus on energy-efficient operation and coverage-aware mechanisms while performing connectivity restoration. As a result, most of these mechanisms lead to the excessive mobility of nodes, which itself causes the utilization of excessive battery. In this work, we propose a novel technique called smart node relocation (SNR). SNR is capable of detecting and restoring the connectivity caused by either single or multiple node failures. For achieving energy efficiency, SNR relies on transmitting a lesser number of control packets. For achieving the goal of being coverage-aware, it tries to relocate only essential nodes while trying to restore connectivity. By performing extensive simulations, we prove that SNR outperforms the existing approaches concerning multiple performance metrics including but not limited to the total number of packets transmitted, total distance moved for connectivity restoration, the percentage reduction in field coverage.

Download Full-text

Distributed connectivity restoration in networks of movable sensor nodes

Computers & Electrical Engineering ◽

10.1016/j.compeleceng.2016.10.014 ◽

2016 ◽

Vol 56 ◽

pp. 608-629 ◽

Cited By ~ 4

Author(s):

Krishna P. Sharma ◽

T.P. Sharma

Keyword(s):

Sensor Nodes ◽

Connectivity Restoration

Download Full-text

Rearrangement of mobile wireless sensor nodes for coverage maximization based on immune node deployment algorithm

Computers & Electrical Engineering ◽

10.1016/j.compeleceng.2015.04.003 ◽

2015 ◽

Vol 43 ◽

pp. 76-89 ◽

Cited By ~ 18

Author(s):

Mohammed Abo-Zahhad ◽

Sabah M. Ahmed ◽

Nabil Sabor ◽

Shigenobu Sasaki

Keyword(s):

Sensor Nodes ◽

Wireless Sensor ◽

Wireless Sensor Nodes ◽

Mobile Wireless ◽

Node Deployment ◽

Coverage Maximization ◽

Mobile Wireless Sensor

Download Full-text

PACR: Position-Aware Protocol for Connectivity Restoration in Mobile Sensor Networks

Wireless Communications and Mobile Computing ◽

10.1155/2020/8859256 ◽

2020 ◽

Vol 2020 ◽

pp. 1-15

Author(s):

Rab Nawaz Jadoon ◽

Adnan Anwar Awan ◽

Muhammad Amir Khan ◽

WuYang Zhou ◽

Aqdas Naveed Malik

Keyword(s):

Sensor Networks ◽

Data Transmission ◽

Recovery Process ◽

Mobile Sensor Networks ◽

Sensor Nodes ◽

Wireless Sensor ◽

Connectivity Restoration ◽

Communication Links ◽

Exact Position ◽

Failed Node

Wireless Sensor Networks (WSNs) have gained global attention in recent times due to their vast applications in various fields. These networks can face the disruption of data transmission due to sensor node failures when placed in harsh, inaccessible, and adverse environments such as battlefields or monitoring in enemy territory. The specific tasks performed by the collaboration among the sensor nodes in WSNs by internode connectivity may be terminated. Besides this, due to the failure of sensor nodes, the area covered by the network may be limited, which can cause damage to the objectives for such a network, as there might be an unaware danger in the lost area. Connectivity is a big problem in mobile WSNs due to the mobility of nodes. Researchers have developed a lot of algorithms that are capable enough for connectivity problems, but they do not emphasize the loss of coverage. We try to fill these gaps by proposing the new hybrid algorithm PACR (Position-Aware protocol for Connectivity Restoration). The concept behind PACR is the same as a person who writes his will before death on a deathbed. In the same way, when the sensor energy is below the threshold, it is converted into a recovery coordinator and generates a recovery plan. This accelerates the recovery by decreasing the time needed for failure identification. For the recovery process, the neighbor’s nodes do not travel to the exact position of the failed node. Instead, they just move to the distance where they can build communication links with other nodes. This greatly prolongs the network lifetime. The simulation results show that PACR outperforms other techniques present in the literature.

Download Full-text

Distributed Entropy Energy-Efficient Clustering algorithm for cluster head selection (DEEEC)

Journal of Intelligent & Fuzzy Systems ◽

10.3233/jifs-189135 ◽

2020 ◽

Vol 39 (6) ◽

pp. 8139-8147

Author(s):

Ranganathan Arun ◽

Rangaswamy Balamurugan

Keyword(s):

Energy Efficient ◽

Clustering Algorithm ◽

Cluster Head ◽

Residual Energy ◽

Energy Utilization ◽

Sensor Nodes ◽

Second Stage ◽

Energy Efficient Clustering ◽

Two Stages ◽

Ch Selection

In Wireless Sensor Networks (WSN) the energy of Sensor nodes is not certainly sufficient. In order to optimize the endurance of WSN, it is essential to minimize the utilization of energy. Head of group or Cluster Head (CH) is an eminent method to develop the endurance of WSN that aggregates the WSN with higher energy. CH for intra-cluster and inter-cluster communication becomes dependent. For complete, in WSN, the Energy level of CH extends its life of cluster. While evolving cluster algorithms, the complicated job is to identify the energy utilization amount of heterogeneous WSNs. Based on Chaotic Firefly Algorithm CH (CFACH) selection, the formulated work is named “Novel Distributed Entropy Energy-Efficient Clustering Algorithm”, in short, DEEEC for HWSNs. The formulated DEEEC Algorithm, which is a CH, has two main stages. In the first stage, the identification of temporary CHs along with its entropy value is found using the correlative measure of residual and original energy. Along with this, in the clustering algorithm, the rotating epoch and its entropy value must be predicted automatically by its sensor nodes. In the second stage, if any member in the cluster having larger residual energy, shall modify the temporary CHs in the direction of the deciding set. The target of the nodes with large energy has the probability to be CHs which is determined by the above two stages meant for CH selection. The MATLAB is required to simulate the DEEEC Algorithm. The simulated results of the formulated DEEEC Algorithm produce good results with respect to the energy and increased lifetime when it is correlated with the current traditional clustering protocols being used in the Heterogeneous WSNs.

Download Full-text

A Survey on Hierarchical Cluster Based Secure Routing Protocols and Key Management Schemes in Wireless Sensor Networks

International Journal of Scientific Research in Computer Science Engineering and Information Technology ◽

10.32628/cseit183810 ◽

2018 ◽

pp. 18-26

Author(s):

Yugashree Bhadane ◽

Pooja Kadam

Keyword(s):

Routing Protocol ◽

Routing Protocols ◽

Key Management ◽

Energy Efficient ◽

Base Station ◽

Secure Routing ◽

Sensor Nodes ◽

Wireless Sensor ◽

Management Schemes ◽

Cluster Based Routing

Now days, wireless technology is one of the center of attention for users and researchers. Wireless network is a network having large number of sensor nodes and hence called as “Wireless Sensor Network (WSN)”. WSN monitors and senses the environment of targeted area. The sensor nodes in WSN transmit data to the base station depending on the application. These sensor nodes communicate with each other and routing is selected on the basis of routing protocols which are application specific. Based on network structure, routing protocols in WSN can be divided into two categories: flat routing, hierarchical or cluster based routing, location based routing. Out of these, hierarchical or cluster based routing is becoming an active branch of routing technology in WSN. To allow base station to receive unaltered or original data, routing protocol should be energy-efficient and secure. To fulfill this, Hierarchical or Cluster base routing protocol for WSN is the most energy-efficient among other routing protocols. Hence, in this paper, we present a survey on different hierarchical clustered routing techniques for WSN. We also present the key management schemes to provide security in WSN. Further we study and compare secure hierarchical routing protocols based on various criteria.

Download Full-text