Boolean Spider Monkey Optimization Assisted Routing Integrated with Wireless Sensor Network
Main Article Content
Abstract
The Wireless Sensor Network (WSN) offers greater flexibility in network deployment, especially when powered by batteries. It offers solutions to the sensor nodes' energy consumption as it mainly operates as devices with faster data acquisition. Hence, it is difficult for the sensor nodes to carry such a computational burden from the source nodes to the target base station or the internet gateway. It is essential to maintain the routing paths as well as the balance of the sensor nodes. In this paper, we propose a Boolean Spider Monkey Optimization (BSMO) routing on WSNs is developed to maintain the stable routing path that matches the speed of input data acquisition. The sensor nodes help in data collection and acquisition and WSNs routes the data collected via hops between the source and sink nodes. The BSMO is responsible for controlling the data routing and matches the routing speed with data acquisition speed. Hence, the network is maintained in a stabilized condition. The simulation results are estimated in terms of average delay, throughput, and network energy efficiency. The result shows
Downloads
Metrics
Article Details
Licensing
TURCOMAT publishes articles under the Creative Commons Attribution 4.0 International License (CC BY 4.0). This licensing allows for any use of the work, provided the original author(s) and source are credited, thereby facilitating the free exchange and use of research for the advancement of knowledge.
Detailed Licensing Terms
Attribution (BY): Users must give appropriate credit, provide a link to the license, and indicate if changes were made. Users may do so in any reasonable manner, but not in any way that suggests the licensor endorses them or their use.
No Additional Restrictions: Users may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.