Identifying Partitions in Wireless Sensor Network

E. Anna Devi

doi:10.1007/s10766-018-0593-7

Identifying Partitions in Wireless Sensor Network

2018-08-07

0

PRE

AI

E

E. Anna Devi *

L

LeoManickam, J. Martin

DOI：10.1007/s10766-018-0593-7

原文链接

原文求助

摘要

En 中文

Wireless sensor networks, consists of a group of tiny nodes, which are powered by small size batteries, which can get failed very easily. The failure of a single node may lead to the failure of an entire network in the following way. If a particular node is unaware of the failed situation of its neighbor node, it simply forwards the packet again and again as it will not receive any acknowledgment. This message passing merely wastes the precious energy of the node, which leads to its failure. This process continues which leads to the failure of the entire network. It is crucial, to identify the node which is failed, as and when it happens and to reconnect the network. In this paper, a hop count based cut detection algorithm is proposed to detect the failure of the nodes and, mobile nodes are used to reconnect the partitioned network. In HCCD at each hop, every node select the node with minimum hop count and maximum link cost, thereby the worst node can be identified as cut node and this cut can be identified before the network actually fails. Experiment results shows that hop count based cut detection outperforms the traditional distributed cut detection algorithm and reconnection using mobile nodes avoids data loss.

Keyword:

Wireless sensor networks

Cut detection

Hop count

Reconnection

Mobile nodes

Identifying Partitions in Wireless Sensor Network

摘要

AI总结

期刊

机构