Multihop routing with static and distributed clustering in WSNs

Abasıkeleş‐Turgut, İpek

doi:10.1007/s11276-021-02683-2

Cited by 5 publications

(3 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The distance between the CHs and the BS, on the other hand, is usually quite large. If only a single hop is used for communication, the cluster heads' unnecessary energy consumption will be exacerbated [12,13]. Therefore, hierarchical clustering protocols often necessitate a routing algorithm to determine the optimum path amongst each CH and the BS, data can be transmitted to it.…”

Section: International Journal Of Electrical and Computer Engineering...mentioning

confidence: 99%

Energy Efficient Multi-hop routing scheme using Taylor based Gravitational Search Algorithm in Wireless Sensor Networks

B¹,

Champla

Pushpavalli³

et al. 2023

Int. j. electr. comput. eng. syst. (Online)

View full text Add to dashboard Cite

A group of small sensors can participate in the wireless network infrastructure and make appropriate transmission and communication sensor networks. There are numerous uses for drones, including military, medical, agricultural, and atmospheric monitoring. The power sources available to nodes in WSNs are restricted. Furthermore, because of this, a diverse method of energy availability is required, primarily for communication over a vast distance, for which Multi-Hop (MH) systems are used. Obtaining the optimum routing path between nodes is still a significant problem, even when multi-hop systems reduce the cost of energy needed by every node along the way. As a result, the number of transmissions must be kept to a minimum to provide effective routing and extend the system's lifetime. To solve the energy problem in WSN, Taylor based Gravitational Search Algorithm (TBGSA) is proposed, which combines the Taylor series with a Gravitational search algorithm to discover the best hops for multi-hop routing. Initially, the sensor nodes are categorised as groups or clusters and the maximum capable node can access the cluster head the next action is switching between multiple nodes via a multi-hop manner. Initially, the best (CH) Cluster Head is chosen using the Artificial Bee Colony (ABC) algorithm, and then the data is transmitted utilizing multi-hop routing. The comparison result shows out the extension of networks longevity of the proposed method with the existing EBMRS, MOGA, and DMEERP methods. The network lifetime of the proposed method increased by 13.2%, 21.9% and 29.2% better than DMEERP, MOGA, and EBMRS respectively.

show abstract

Section: International Journal Of Electrical and Computer Engineering...mentioning

confidence: 99%

Energy Efficient Multi-hop routing scheme using Taylor based Gravitational Search Algorithm in Wireless Sensor Networks

B¹,

Champla

Pushpavalli³

et al. 2023

Int. j. electr. comput. eng. syst. (Online)

View full text Add to dashboard Cite

show abstract

“…), and (g) network topology management (like scalability, etc.). While some previous studies support only one objective (eg, References 28,29), huge number of works support various objectives simultaneously (eg, References 25 and 30‐39).…”

Section: Related Workmentioning

confidence: 99%

“…Increasing the efficiency and scalability are the most important benefits of distributed algorithms. The ideas proposed in References 12,15,25,26,28,29,36,41,[54][55][56][57][58][59][60] are formed based on distributed clustering algorithm. Also, ideas proposed in References 13,14 are formed based on centralized clustering algorithm.…”

Section: Clustering Approachesmentioning

confidence: 99%

An energy‐aware and lightweight routing algorithm using clustering and mobile sinks in wireless sensor networks

Adabi

Mohammadifar

Nezhad

2022

Trans Emerging Tel Tech

View full text Add to dashboard Cite

A wireless sensor network (WSN) consists of a number of small sensors which are powered by low-cost irreplaceable batteries. Therefore, one of the main issues in WSN design is to prolong the battery life of the individual sensors. Clustering and utilization of mobile sinks in collaboration with base station (BS) are two common solutions to address energy consumption challenge. Based on these solutions, a new algorithm in name "Energy-aware Routing algorithm using Clustering and Mobile Sinks (ERCMS)" is proposed in this article. The distinguishing features of ERCMS are as follows: (1) a geometric pattern is applied to divide entire network area into some parts and make cluster in each part. This pattern adjusts the cluster size based on the distance from the sink. Thus, hotspot problem is expected to be reduced, (2) computational load is distributed over sensors, (3) length of messages are controlled and each message is defined in the format with minimum required information, (4) simple mathematics approaches those impose lightweight computations are adopted, and (5) accuracy of mobile sink dispatching procedure is improved in critical conditions of the network. The simulation results show that ERCMS outperforms DFCR, MDFCR, and TEO-MCRP in terms of consumed energy, delivery ratio, delay, routing overhead, and throughput.

show abstract

Heterogeneous load balancing improvement on an energy-aware distributed unequal clustering protocol using BBO algorithms

Maleki

Bidgoli²

2022

Wireless Netw

View full text Add to dashboard Cite

Multihop routing with static and distributed clustering in WSNs

Cited by 5 publications

References 23 publications

Energy Efficient Multi-hop routing scheme using Taylor based Gravitational Search Algorithm in Wireless Sensor Networks

Energy Efficient Multi-hop routing scheme using Taylor based Gravitational Search Algorithm in Wireless Sensor Networks

An energy‐aware and lightweight routing algorithm using clustering and mobile sinks in wireless sensor networks

Heterogeneous load balancing improvement on an energy-aware distributed unequal clustering protocol using BBO algorithms

Contact Info

Product

Resources

About