Healing of large-scale failures in WSN by the effectual placement of relay nodes

被引:7
作者
Rajeswari, Gopinathan [1 ]
Murugan, Krishnan [1 ]
机构
[1] Anna Univ, Ramanujan Comp Ctr, Chennai 600025, Tamil Nadu, India
关键词
telecommunication network reliability; wireless sensor networks; relay networks (telecommunication); failure analysis; sensor placement; telecommunication network planning; recovery time; average node degree; large-scale failures; effectual placement; lightening growth; IoT; sensor failures; node failures; multiple disjoint sub-networks; named network partitioning problem; isolated network segments; distributed approach FRTP; disconnected network; network simulator tool NS-2; healing relay nodes; WSN; Internet of Things; fully-connected network; failure recovery; Torricelli points; distance; 100; 0; m; WIRELESS SENSOR NETWORKS; RESTORING CONNECTIVITY; ALGORITHM; RECOVERY;
D O I
10.1049/iet-com.2020.0320
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
The lightening growth in Internet of Things (IoT), forced the deployment of various types of applications. Due to the likelihood of sensor failures, the applications of IoT cannot be benefited. These node failures can transform the fully-connected network into multiple disjoint sub-networks, named network partitioning problem where the nodes fail to perform intended services. The federation of these isolated network segments is essential. In this study, a distributed approach FRTP (Failure Recovery using Relay Nodes at Torricelli points (T-p)) is proposed, where the restoration of the disconnected network is initiated using the relay nodes (RNs). The performance of FRTP is evaluated using network simulator tool NS-2 and the experimental results show that it achieves better performance than the existing approaches. The main goal of the proposed approach is to minimise the number of HRNs (Healing Relay Nodes), APL (Average path length), recovery time of the network and to maximise the average node degree. The average improvement in minimisation of number of HRN, APL, and recovery time of the network for radio range of 100 m are 21.57, 13.23, and 9.96%, respectively, and the maximisation of average node degree is 9.83%.
引用
收藏
页码:3030 / 3038
页数:9
相关论文
共 28 条
[1]   Establishing connectivity among disjoint terminals using a mix of stationary and mobile relays [J].
Abbas, Ahmad ;
Younis, Mohamed .
COMPUTER COMMUNICATIONS, 2013, 36 (13) :1411-1421
[2]   Recovering From a Node Failure in Wireless Sensor-Actor Networks With Minimal Topology Changes [J].
Abbasi, Ameer A. ;
Younis, Mohamed F. ;
Baroudi, Uthman A. .
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2013, 62 (01) :256-271
[3]   Internet of Things: A Survey on Enabling Technologies, Protocols, and Applications [J].
Al-Fuqaha, Ala ;
Guizani, Mohsen ;
Mohammadi, Mehdi ;
Aledhari, Mohammed ;
Ayyash, Moussa .
IEEE COMMUNICATIONS SURVEYS AND TUTORIALS, 2015, 17 (04) :2347-2376
[4]  
Alfadhly Abdullah, 2010, 2010 25th Biennial Symposium on Communications (QBSC), P67, DOI 10.1109/BSC.2010.5473000
[5]  
Arthi R, 2010, COMM COM INF SC, V90, P80
[6]   AgriTalk: IoT for Precision Soil Farming of Turmeric Cultivation [J].
Chen, Wen-Liang ;
Lin, Yi-Bing ;
Lin, Yun-Wei ;
Chen, Robert ;
Liao, Jyun-Kai ;
Ng, Fung-Ling ;
Chan, Yuan-Yao ;
Liu, You-Cheng ;
Wang, Chin-Cheng ;
Chiu, Cheng-Hsun ;
Yen, Tai-Hsiang .
IEEE INTERNET OF THINGS JOURNAL, 2019, 6 (03) :5209-5223
[7]   An autonomic bio-inspired algorithm for wireless sensor network self-organization and efficient routing [J].
de Castro, Miguel Franklin ;
Ribeiro, Levi Bayde ;
Souza Oliveira, Camila Helena .
JOURNAL OF NETWORK AND COMPUTER APPLICATIONS, 2012, 35 (06) :2003-2015
[8]   Localized motion-based connectivity restoration algorithms for wireless sensor and actor networks [J].
Imran, Muhammad ;
Younis, Mohamed ;
Said, Abas Md ;
Hasbullah, Halabi .
JOURNAL OF NETWORK AND COMPUTER APPLICATIONS, 2012, 35 (02) :844-856
[9]   Restoring connectivity in a resource constrained WSN [J].
Joshi, Yatish K. ;
Younis, Mohamed .
JOURNAL OF NETWORK AND COMPUTER APPLICATIONS, 2016, 66 :151-165
[10]   THE GRAHAM SCAN TRIANGULATES SIMPLE POLYGONS [J].
KONG, XS ;
EVERETT, H ;
TOUSSAINT, G .
PATTERN RECOGNITION LETTERS, 1990, 11 (11) :713-716