A P2P-Based Market-Guided Distributed Routing Mechanism for High-Throughput Hybrid Wireless Networks

Shen, Haiying; Li, Ze; Yu, Lei

doi:10.1109/tmc.2014.2320255

Cited by 25 publications

(6 citation statements)

References 49 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In 2014, the authors of [8, 30, 31] have suggested the combining the LEACH and imperialist competitive algorithm (ICA) to promote the efficient cluster head selection in WSN. They have considered the uniformity of cluster, energy consumption and coverage of the network to analyse the adequacy of the network.…”

Section: Literature Reviewmentioning

confidence: 99%

Hybrid model for security‐aware cluster head selection in wireless sensor networks

Shankar

Jaisankar

Khan

et al. 2019

IET wirel. sens. syst.

View full text Add to dashboard Cite

Wireless sensor network (WSN) is considered as the resource constraint network, in which the entire nodes have limited resources. In WSN, prolonging the lifetime of the network remains as the unsolved point. Accordingly, this study intends to propose a hybrid GGWSO (Grouped Grey Wolf Search Optimisation) algorithm to improve the performance of a cluster head selection in WSN, so that the network's lifetime can be extended. The proposed method concerns the main constraints associated with distance, delay, energy, and security. This study compares the performance of the proposed GGWSO with several traditional algorithms like artificial bee colony (ABC), fractional ABC, group search optimisation and Grey Wolf optimisation-based cluster head selection. During the performance analysis, the various ranges of risk, such as 20, 60, and 100% are added to validate the performance variations, by evaluating the number of alive nodes, and normalised network energy remained in the network. The simulation results have shown that there is a need for a hybrid model for attaining the superior results.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Hybrid model for security‐aware cluster head selection in wireless sensor networks

Shankar

Jaisankar

Khan

et al. 2019

IET wirel. sens. syst.

View full text Add to dashboard Cite

show abstract

“…The proposed infrastructure should adopt large infrastructure and also should provide scalability. So a defined routing algorithm should be constructed for the proposed architecture [15] [16].…”

Section: Literature Surveymentioning

confidence: 99%

An Efficienct LWSP Technique in WSN With Shortest Path Routinf for Less Latency in Data Transmission

Durghadevi¹,

Vetrivelan²

2019

IJCET

View full text Add to dashboard Cite

Wireless network is an established connection for data transformation from one node to another node and the biggest issue in the data transformation is congestion and latency which destroys the transmitting function. In wireless sensor networks (WSNs), Shortest path routing can find multiple paths from source node to destination node for achieving high responsibility and high energy-efficiency. However, most of the existing Shortest path routing protocols in the literature construct multiple paths with long latency and high over head and it is a common issue. In this paper, a fiction Shortest path routing protocol in WSNs is proposed named LWSP [Shortest path without Latency], which can discover shortest paths with short latency and low command processing overhead time. Performance analyses and simulation results shows that our proposed protocol has much better performance than the existing ones in terms of both latency and command processing overhead time.

show abstract

“…Because of the constraints and the energy usage of the system, the CH has been chosen. The grouping methods use the correspondence between the information because the gigantic amount of information given by the sensors are practically identical and this outcome in a progressively capable energy usage [12] [16] [13] [14] [15]. Here the enduring energy is considered as the answer for every node to be chosen as a CH.…”

Section: Introductionmentioning

confidence: 99%

I-CSA based Cluster Head Selection Model in Wireless Sensor Network

Shelgaonkar¹

2020

JNACS

View full text Add to dashboard Cite

In WSN, the clustering technique can be used to reduce the traffic in the network and it can be predominantly used to minimize the utilization of energy in the network, thus it leads to the multipath routing which increases the reliability of the network throughout the available paths. Since clustering is an effective and apt way on providing a better route that transmits data without any conflicts. However, in the concept of clustering, the selection of Cluster Head (CH) is considered as a complex process as it has to satisfy certain parameters for effectual performance. In this research work, a novel CH selection approach is developed based on a new optimization algorithm referred to as the Intensity-based Cuckoo Search Algorithm (I-CSA), which is an extended version of standard Cuckoo Search Algorithm (CSA). The optimized CH selection is done by I-CSA that considers the triplet objective function like delay, energy, and distance. Finally, the efficiency of the presented work is evaluated over other conventional works in terms of energy, alive nodes as well.

show abstract

A P2P-Based Market-Guided Distributed Routing Mechanism for High-Throughput Hybrid Wireless Networks

Cited by 25 publications

References 49 publications

Hybrid model for security‐aware cluster head selection in wireless sensor networks

Hybrid model for security‐aware cluster head selection in wireless sensor networks

An Efficienct LWSP Technique in WSN With Shortest Path Routinf for Less Latency in Data Transmission

I-CSA based Cluster Head Selection Model in Wireless Sensor Network

Contact Info

Product

Resources

About