connectivity restoration
Recently Published Documents


TOTAL DOCUMENTS

115
(FIVE YEARS 31)

H-INDEX

16
(FIVE YEARS 2)

Author(s):  
Lee Baumgartner ◽  
Tim Marsden ◽  
Deanna Duffy ◽  
Ana Horta ◽  
Nathan Ning

Abstract Infrastructure-induced fragmentation of riverine ecosystems has prompted the need for more effective aquatic restoration efforts globally. Fragmentation assessments have been extensively undertaken to inform connectivity restoration efforts for fish and other aquatic biota, but they have potentially underestimated the extent of fragmentation by fixating on large dams and overlooking the contribution of other barriers like road crossings and small irrigation structures. The current study addresses this limitation in Mekong region countries (MReCs) of Southeast Asia, by assessing the fragmentation impacts of road crossings and small irrigation structures together with large dams. Our analysis indicates that the basin-scale fragmentation impact of road crossings is similar to that of large dams in MReCs, while small irrigation structures have a far greater impact. These findings raise concerns about the real global extent of aquatic fragmentation, and highlight the need for decision-makers to think beyond dams when attempting to restore connectivity for aquatic biota.


Author(s):  
Mahmood ul Hassan ◽  
Khalid Mahmood ◽  
Muhammad Kashif Saeed ◽  
Shahzad Ali ◽  
Safdar Zaman ◽  
...  

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.


Sensors ◽  
2021 ◽  
Vol 21 (19) ◽  
pp. 6418
Author(s):  
Vahid Khalilpour Akram ◽  
Zuleyha Akusta Dagdeviren ◽  
Orhan Dagdeviren ◽  
Moharram Challenger

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.


2021 ◽  
Vol 69 (1) ◽  
pp. 1003-1019
Author(s):  
Mahmood ul Hassan ◽  
Shahzad Ali ◽  
Khalid Mahmood ◽  
Muhammad Kashif Saeed ◽  
Amin Al-Awady ◽  
...  

2021 ◽  
Vol 69 (3) ◽  
pp. 3413-3427
Author(s):  
Mahmood ul Hassan ◽  
Amin Al-Awady ◽  
Khalid Mahmood ◽  
Shahzad Ali ◽  
Ibrahim Algamdi ◽  
...  

2020 ◽  
Vol 2020 ◽  
pp. 1-15
Author(s):  
Rab Nawaz Jadoon ◽  
Adnan Anwar Awan ◽  
Muhammad Amir Khan ◽  
WuYang Zhou ◽  
Aqdas Naveed Malik

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.


Author(s):  
Muhammad Kashif Saeed ◽  
Mahmood ul Hassan ◽  
Khalid Mahmood ◽  
Ansar Munir Shah ◽  
Jahangir Khan

Sign in / Sign up

Export Citation Format

Share Document