TITLE:
A Multi-Hop Dynamic Path-Selection (MHDP) Algorithm for the Augmented Lifetime of Wireless Sensor Networks
AUTHORS:
Perumal Kalyanasundaram, Thangavel Gnanasekaran
KEYWORDS:
Wireless Sensor Networks (WSN), Cluster Based WSN, Multi-Hop Mode, Residual Energy, Average Delay, Multi-Hop Dynamic Path-Selection Algorithm, Life Time
JOURNAL NAME:
Circuits and Systems,
Vol.7 No.10,
August
29,
2016
ABSTRACT: In Wireless Sensor Networks (WSN), the
lifetime of sensors is the crucial issue. Numerous schemes are proposed to
augment the life time of sensors based on the wide range of parameters. In majority
of the cases, the center of attraction will be the nodes’ lifetime enhancement
and routing. In the scenario of cluster based WSN, multi-hop mode of
communication reduces the communication cast by increasing average delay and
also increases the routing overhead. In this proposed scheme, two ideas are
introduced to overcome the delay and routing overhead. To achieve the higher
degree in the lifetime of the nodes, the residual energy (remaining energy) of
the nodes for multi-hop node choice is taken into consideration first. Then the
modification in the routing protocol is evolved (Multi-Hop Dynamic
Path-Selection Algorithm—MHDP). A dynamic path updating is initiated in
frequent interval based on nodes residual energy to avoid the data loss due to
path extrication and also to avoid the early dying of nodes due to elevation of
data forwarding. The proposed method improves network’s lifetime significantly.
The diminution in the average delay and increment in the lifetime of network
are also accomplished. The MHDP offers 50% delay lesser than clustering. The
average residual energy is 20% higher than clustering and 10% higher than
multi-hop clustering. The proposed method improves network lifetime by 40% than
clustering and 30% than multi-hop clustering which is considerably much better
than the preceding methods.