Please use this identifier to cite or link to this item: http://hdl.handle.net/2440/112070
Citations
Scopus Web of Science® Altmetric
?
?
Type: Journal article
Title: A grid-based reliable multi-hop routing protocol for energy-efficient wireless sensor networks
Author: Chen, Z.
Shen, H.
Citation: International Journal of Distributed Sensor Networks, 2018; 14(3):1-17
Publisher: SAGE Publications
Issue Date: 2018
ISSN: 1550-1477
1550-1477
Statement of
Responsibility: 
Zhansheng Chen and Hong Shen
Abstract: Due to the limited energy and the non-equivalence of wireless sensor network nodes, it is imperative to reduce and rationally use the energy consumption of the nodes to prolong the network lifetime. Clustering routing algorithm can address the problem efficiently. In this article, a grid-based reliable multi-hop routing approach for wireless sensor networks is proposed. In order to minimize and balance the energy consumption, our proposed protocol, grid-based reliable multi-hop routing protocol, optimizes the cluster head election process by combining individual ability which consists of node’s residual energy and node’s location, and local cognition which can balance energy consumption among clusters via a consultative mechanism based on cluster head’s lifetime expectancy, while considering data forwarding delay and reliable transmission of data. Simulation results show that grid-based reliable multi-hop routing protocol has improved stability period as compared to other protocols. Meanwhile, grid-based reliable multi-hop routing protocol has better performance in energy efficiency, data forwarding delay, and reliable transmission of data.
Keywords: Wireless sensor networks; routing protocol; consultative mechanism; network lifetime; delay
Rights: © The Author(s) 2018
RMID: 0030085599
DOI: 10.1177/1550147718765962
Grant ID: http://purl.org/au-research/grants/arc/DP150104871
Appears in Collections:Computer Science publications

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.