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

Autor: Moharram Challenger, Vahid Khalilpour Akram, Zuleyha Akusta Dagdeviren, Orhan Dagdeviren
Jazyk: angličtina
Rok vydání: 2021
Předmět:
Optimization
Coverage
Detection Algorithm
Computer science
Reliability (computer networking)
TP1-1185
0102 computer and information sciences
02 engineering and technology
01 natural sciences
Biochemistry
Energy-Aware
Article
Analytical Chemistry
connectivity restoration
minimum vertex cut
k-connectivity
0202 electrical engineering
electronic engineering
information engineering
ComputerSystemsOrganization_SPECIAL-PURPOSEANDAPPLICATION-BASEDSYSTEMS
Ad Hoc
Electrical and Electronic Engineering
Instrumentation
Placement
Computer. Automation
reliability
business.industry
Chemical technology
Node (networking)
Testbed
ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS
020206 networking & telecommunications
Fault tolerance
Atomic and Molecular Physics
and Optics
mobility
010201 computation theory & mathematics
Power
Path (graph theory)
Robot
Mechanism
fault tolerance
Wireless Sensor Networks
business
Wireless sensor network
Repair
Computer network
Data transmission
Zdroj: Sensors
Volume 21
Issue 19
Sensors (Basel, Switzerland)
Sensors, Vol 21, Iss 6418, p 6418 (2021)
ISSN: 1424-8220
DOI: 10.3390/s21196418
Popis: 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.
Scientific and Technological Research Council of Turkey (TUBITAK) [113E470]; University of Antwerp and Flanders Make (a strategic research center) [43169]
FundingThis research was funded by The Scientific and Technological Research Council of Turkey (TUBITAK) with the project number 113E470 and University of Antwerp and Flanders Make (a strategic research center) under grant number 43169.
Databáze: OpenAIRE
Externí odkaz:
Nepřihlášeným uživatelům se plný text nezobrazuje