Routing and Congestion Control in Wireless Sensor Networks using the Ant Colony Optimization algorithm and the Tabu search algorithm
preprint
OA: closed
CC-BY-4.0
Abstract
Wireless sensor networks (WSN) are a new generation of networks that consist of a enormous number of sensor nodes. These nodes are usually inexpensive and have the ability to communicate wirelessly, compute, and sensing. The main purpose of these networks is to collect information about the environment. These networks' function is that the nodes collect the information, and then this data is sent to the base station. Therefore, data transfer, routing, congestion control are important and challenging issues in this network type. Various protocols have been proposed in this field, considering energy utilization and increasing the network's lifetime are important problems. Our goal in this study is to consider the energy consumption and increase the network lifetime and some of the Quality of Service (QoS) parameters, such as increasing the number of alive nodes and throughput. In this paper, we use an Ant Colony Optimization (ACO) algorithm to try the routing send data from a source node to the Cluster Head (CH). Then the routing analysis performed with the Tabu search (TS) algorithm is to found the route that has congestion. If the path has more than a 70% threshold, the path putting up on the congestion route, and the ACO algorithm must find the new path to send data from source to CH. In this research, the proposed method's performance with the Adaptive Cuckoo Search Based Optimal Rate Adjustment (ACSRO) algorithm, Fuzzy based Cross-layer mechanism using Oppositional Artificial Bee Colony (FCOABC) algorithm, and the Flock-based Congestion Control (Flock-CC) algorithm in the same data set has been investigated in the NS3 simulator.
My notes (saved in your browser only)
Citation neighborhood (no data yet)
We don't have any in-corpus citations linked to this paper yet. The paper's references may be in our DB but unresolved to ``paper_id`` (resolution happens at ingest when the cited DOI matches a row we already have). Run the cross-source citation reconcile pass to retry.
References (23)
- doi:10.1145/2872936 via crossref
- doi:10.1007/s11277-018-6021-x via crossref
- doi:10.1016/j.comnet.2010.05.003 via crossref
- doi:10.1109/access.2020.3025432 via crossref
- doi:10.1007/s11277-017-4896-6 via crossref
- doi:10.1007/s11036-018-1018-y via crossref
- doi:10.1109/access.2020.2976819 via crossref
- doi:10.1055/s-0040-1709715 via crossref
- doi:10.1016/j.apenergy.2019.114109 via crossref
- doi:10.1007/s11277-018-5981-1 via crossref
- doi:10.1007/s11277-018-5752-z via crossref
- doi:10.1109/access.2020.3010313 via crossref
- doi:10.1109/mci.2006.329691 via crossref
- doi:10.7763/ijiet.2011.v1.67 via crossref
- doi:10.1016/j.asoc.2009.02.014 via crossref
- doi:10.1109/tvt.2018.2882130 via crossref
- doi:10.1002/dac.4672 via crossref
- doi:10.1016/j.swevo.2020.100802 via crossref
- doi:10.1057/palgrave.jors.2601163 via crossref
- doi:10.1007/978-1-4613-0303-9_33 via crossref
- doi:10.1016/j.aej.2016.10.005 via crossref
- doi:10.1007/s11276-018-1848-3 via crossref
- doi:10.1016/j.comnet.2012.12.008 via crossref
Source provenance
- crossref
- last seen: 2026-05-30T01:00:42.038142+00:00
- europepmc
- last seen: 2026-05-19T01:45:01.086888+00:00
- unpaywall
- last seen: 2026-05-21T05:10:58.409756+00:00
License: CC-BY-4.0