Impact of the energy-based and location-based LEACH secondary cluster aggregation on WSN lifetime

Amodu, Oluwatosin Ahmed; Mahmood, Rosli

doi:10.1007/s11276-016-1414-9

Cited by 36 publications

(16 citation statements)

References 57 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Cluster-head capabilities depend on the clustering objectives or focus used in their formation, and taking into account the capabilities of the nodes and their effective range. Most of the work on CH node selection has focused on the energy capacity of network nodes [ 19 , 20 ]. The following node attributes have been differentiating factors among the various clustering and CH node selection schemes.…”

Section: Related Workmentioning

confidence: 99%

A Clustering WSN Routing Protocol Based on k-d Tree Algorithm

Anzola

Pascual

Bermúdez

et al. 2018

Sensors

View full text Add to dashboard Cite

Clustering in wireless sensor networks has been widely discussed in the literature as a strategy to reduce power consumption. However, aspects such as cluster formation and cluster head (CH) node assignment strategies have a significant impact on quality of service, as energy savings imply restrictions in application usage and data traffic within the network. Regarding the first aspect, this article proposes a hierarchical routing protocol based on the k-d tree algorithm, taking a partition data structure of the space to organize nodes into clusters. For the second aspect, we propose a reactive mechanism for the formation of CH nodes, with the purpose of improving delay, jitter, and throughput, in contrast with the low-energy adaptive clustering hierarchy/hierarchy-centralized protocol and validating the results through simulation.

show abstract

Section: Related Workmentioning

confidence: 99%

A Clustering WSN Routing Protocol Based on k-d Tree Algorithm

Anzola

Pascual

Bermúdez

et al. 2018

Sensors

View full text Add to dashboard Cite

show abstract

“…is the weight of the corresponding node, and f (u i ) is the identification of the node status, the numerical value can be obtained by formula (1). The degree of the node u i in graph G and its square graph G * are denoted as d G (u i ) and d G * (u i ), respectively.…”

Section: Cross Cube Based Cds Constructed Algorithmmentioning

confidence: 99%

“…Thus, it is widely used in many applications such as monitoring of the diverse environment and collecting data for the structural health diagnosis. The WSNs is composed of large amounts of resource-limited wireless sensor nodes [1]. These sensor nodes are usually deployed physically nearby the targets of interest in a close range to maximise the detection coverage.…”

Section: Introductionmentioning

confidence: 99%

Minimization of delay and collision with cross cube spanning tree in wireless sensor networks

Zhang

Tsai

et al. 2018

Wireless Netw

View full text Add to dashboard Cite

The Wireless Sensor Networks (WSNs) is a system containing the event detection and the data gathering abilities. The data gathering mechanism is the fundamental but important procedure in the WSN environment. The way of the data gathering majorly affects the efficiency of WSNs on retrieving data at the sink node. It is generally known that the clustering techniques are effective to reduce the energy consumption in the WSNs. However, the discussion on the packet collision and the transmission delay in the CDS based routing algorithms still remains vacant. The packet loss and the transmission delay may raise because of the collision and cause the negative impact of the WSNs performance. In addition, the transmission delay phenomenon in the WSNs may cause the inefficient result in the data gathering process. Unfortunately, it is usually neglected in the existing literature. To overcome the drawback of transmission delay and collision, a Cluster-based Converge Cast Tree (CCCT) structure is proposed in this paper. Furthermore, three major problems including the Minimal Connected Documenting Set (MCDS) problem, the delay aware CDS problem, and the CCCT construction problem are revealed in this study. Finally, the proposed algorithms are examined by the simulations. The simulation results indicate that the proposed CCCT struc

show abstract

“…Further, the issues of network scalability emerge with maximum probability due to the birth, death and reboot of various interacting sensor nodes in the network 5 . These problems of network scalability impose a number of issues that are associated to latency, message loss, neighbor discovery and congestion in the network 6 . The problems of network scalability induce routing issues during the processes of loop discovery and communication path establishment.…”

Section: Introductionmentioning

confidence: 99%

An Energy‐Proficient Clustering‐Inspired Routing Protocol using Improved Bkd‐tree for Enhanced Node Stability and Network Lifetime in Wireless Sensor Networks

Janakiraman¹,

Priya

2020

Int J Communication

View full text Add to dashboard Cite

Energy conservation in Wireless Sensor Networks (WSNs) is essential for improving the stability of sensor nodes and network lifetime. An energyproficient clustering-based routing protocol is necessary for efficient cluster formation and Cluster Head (CH) selection to sustain Quality of Service (QoS). In this paper, an Improved Bkd-Tree-Inspired Energy-eFficient Clusteringbased Routing Protocol (IBkd-Tree-IEFCRP) is propounded as a potential strategy for guaranteeing significant cluster formation and management. It is proposed as an effective strategy in CH node allocation that handles the impacts of QoS during the process of data dissemination. This IBkd-Tree-IEFCRP is proposed to deal with energy saving with respect to data traffic by including a strategy of cluster formation which incorporates the benefits of partition data structure that incorporates animprovedBkd-treealgorithm.Italsoconcentrates ontheprocessofCHselection by integrating a reactive approach that enhances throughput with minimized energy, delay and jitter. The simulation experiments of the proposed IBkd-Tree-IEFCRP confirm a better performance in improving the average throughput by 13.21%, reducing the energy consumptions by 12.96%, minimizing the delay by 11.98% and reducing the jitter by 14.24% when compared to the baseline kdimensional tree algorithm (kd-tree algorithm), Weighting and Parameter Optimization-based Energy-Efficient Clustering Routing Protocol (WPO-EECRP), Improved Clustering by Fast Search and Finding of Density Peaks (ICFSFDP), and Energy-based Cluster Centered Routing Protocol (ECCRP) taken for comparison. The proposed IBkd-Tree-IEFCRP is also identified to reduce delay by 8.42% and jitter by 7.18% and increase throughput by 6.84% when compared to the benchmarked protocols for different number of rounds.

show abstract

Impact of the energy-based and location-based LEACH secondary cluster aggregation on WSN lifetime

Cited by 36 publications

References 57 publications

A Clustering WSN Routing Protocol Based on k-d Tree Algorithm

A Clustering WSN Routing Protocol Based on k-d Tree Algorithm

Minimization of delay and collision with cross cube spanning tree in wireless sensor networks

An Energy‐Proficient Clustering‐Inspired Routing Protocol using Improved Bkd‐tree for Enhanced Node Stability and Network Lifetime in Wireless Sensor Networks

Contact Info

Product

Resources

About