Please use this identifier to cite or link to this item:
|Title:||Baud Rate-Based Hierarchical Multihop Routing Protocol for WSNs|
|Citation:||Lecture Notes in Electrical Engineering , Vol. 648 , , p. 469 - 476|
|Abstract:||In wireless sensor networks (WSNs), the data sensed by the sensor node are forwarded to the sink node either by direct communication or by multihop communication. The disadvantage of direct communication is that the sensor nodes consume more energy to reach the sink node as each sensor node has to work alone to reach the sink node, and if the sink node is too far, condition gets worsens. Contrary to direct communication, the multihop communication saves energy as it forwards the data to the nearest neighbor node which in turn forwards the data toward the sink node. In multihop communication, choosing the best neighbor node for forwarding the data is the most challenging task. Hence, in this article, a novel hierarchical multihop routing protocol for WSNs referred to as “Baud Rate-Based Hierarchical Multihop Routing Protocol for WSNs” has been proposed which uses Shannon channel capacity model ‘C’ and neighbor node distance to choose the best neighbor node; the chosen neighbor node will be capable of transmitting data with high baud rate, thereby increasing the throughput of the network. Further, the proposed model also increases the lifetime of the network as the nearest neighbor node will be chosen for the data transfer which saves the energy of the sensor node. The proposed algorithm is compared against the LEACH routing protocol and multihop LEACH protocol and is implemented in MATLAB. The quantitative and qualitative analysis of the simulation results depicts that the proposed algorithm performs better against the parameters remaining energy of the sensor nodes, network lifetime, and data throughput when compared to LEACH and multihop LEACH protocols. © 2020, Springer Nature Singapore Pte Ltd.|
|Appears in Collections:||2. Conference Papers|
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.