A lifetime extended multi-levels heterogeneous routing protocol for wireless sensor networks

Tyagi, Sudhanshu; Tanwar, Sudeep; Gupta, Sumit Kumar; Kumar, Neeraj; Rodrigues, Joel J. P. C.

doi:10.1007/s11235-014-9884-5

Cited by 47 publications

(20 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The limitations identified from the comprehensive review 21–30 of the existing clustering‐based routing protocols are as follows: The existing kd‐tree algorithm is capable of handling only 74% of the impact introduced by the problems of space in managing the process of insertion that is essential in improving the efficiency in the process of clustering. The existing clustering‐based routing protocol like WPO‐EECRP only focuses on energy conservation and energy optimizations rather than focusing on eliminating the other factors that decide on the process of effective cluster formation. The traditional LEACH, improved LEACH and k‐means algorithm‐based cluster routing protocol fail to handle the issues that emerge during the probabilistic selection of CHs. Most of the existing clustering‐based routing protocols incorporate energy parameter as the major factor but fail to utilize cooperation and packet forwarding capability for ensuring effective process of clustering. …”

Section: Related Workmentioning

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

Section: Related Workmentioning

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

show abstract

“…To overcome these drawbacks, many extension over this algorithm has been proposed including LEACH‐C, EHE‐LEACH, LEACH‐B, W‐LEACH, H‐LEACH, LEACH‐GA, Q‐LEACH, and TL‐LEACH . Also, the notion of hierarchical clustering have been utilized in other research activities to extend the lifetime of WSN.…”

Section: Related Workmentioning

confidence: 99%

“…In EEMHR, the sensor nodes are organized into a k ‐level hierarchy and the sensor selection in each level is done based on the ratio of number of alive nodes to the total number of nodes. LE‐MHR protocol tries to preserve the energy of network in higher level of network and to separate the number of nodes in different level of hierarchy. Referring to the implementation approaches, the clustering algorithms can be categorized within centralized and distributed approaches. In centralized approaches, a global view from the whole network is required to select the cluster head nodes.…”

Section: Related Workmentioning

confidence: 99%

A new rank‐order clustering algorithm for prolonging the lifetime of wireless sensor networks

Mostafavi

Hakami

2020

Int J Communication

View full text Add to dashboard Cite

Energy efficient resource management is critical for prolonging the lifetime of wireless sensor networks (WSNs). Clustering of sensor nodes with the aim of distributing the traffic loads in the network is a proven approach for balanced energy consumption in WSN. The main body of literature in this topic can be classified as hierarchical and distance-based clustering techniques in which multi-hop, multi-level forwarding, and distance-based criteria are utilized for categorization of sensor nodes. In this study, we propose the approximate rank-order wireless sensor networks (ARO-WSNs) clustering algorithm as a combined hierarchical and distance-based clustering approach. Different from absolute distance, ARO-WSN algorithm utilizes a new rank-order distance measure for agglomerative hierarchical clustering. Specifically, for each sensor node, we generate a ranking order list by sorting all other sensor nodes in the neighborhood by absolute distance. Then, the rank-order distance of two sensor nodes is computed using their ranking orders. The designed algorithm iteratively group all sensor nodes into a small number of sub-clusters. The results show that ARO-WSN outperforms the competitive clustering algorithms in terms of efficiency and precision/recall. The lifetime of the network with the first node death criterion improved relative to LEACH, LEACH-C, LEACH with fuzzy descriptors, and BPA-CRP by 60%, 85%, 22%, and 18%, respectively, and with last node death criterion improved relative to K-means, LEACH, LEACH-C, and LEACH with fuzzy descriptors by 42%, 67%, 64%, and 24%, respectively. KEYWORDSapproximate rank-order, clustering, network lifetime, wireless sensor networks INTRODUCTIONWireless sensor networks (WSNs) have been utilized for a wide range of applications such as environmental monitoring, 1 target tracking, 2 health care monitoring, 3 and crisis management. 4 Sensors networks, as a group of collaborative sensors for a specific application, have made significant changes in the way that people interact with the environment. However, the WSNs face strict limitations in terms of communication bandwidth, battery, and computing power. These inherent constraints in sensor nodes have posed great challenges to the WSNs. Therefore, how to find cost-effective solutions to reduce energy consumption in WSN and efficiently exploit the scare resources in the network remains an important research area.Int J Commun Syst. 2020;33:e4313.wileyonlinelibrary.com/journal/dac

show abstract

“…Algorithms of energy consumption control consist of three categories: cluster-based schemes [21][22][23][24][25][26][27][28], optimization-based schemes [29][30][31][32][33][34][35][36][37], and backpressure-based schemes [38][39][40][41][42][43]. Clusterbased schemes can balance the energy consumption of nodes and prolong network lifetime through selecting cluster-head nodes and forming clusters according to some ingenious criteria.…”

Section: Introductionmentioning

confidence: 99%

A Cross-Layer Optimization QoS Scheme in Wireless Multimedia Sensor Networks

Fan

2019

Algorithms

View full text Add to dashboard Cite

There are two main challenges in wireless multimedia sensors networks: energy constraints and providing DiffServ. In this paper, a joint flow control, routing, scheduling, and power control scheme based on a Lyapunov optimization framework is proposed to increase network lifetime and scheduling fairness. For an adaptive distribution of transmission opportunities, a differentiated queueing services (DQS) scheme is adopted for maintaining data queues. In the Lyapunov function, different types of queues are normalized for a unified dimension. To prolong network lifetime, control coefficients are designed according to the characteristics of the wireless sensor networks. The power control problem is proved to be a convex optimization problem and two optimal algorithms are discussed. Simulation results show that, compared with existing schemes, the proposed scheme can achieve a better trade-off between QoS performances and network lifetime. The simulation results also show that the scheme utilizing the distributed media access control scheme in scheduling performs best in the transmission of real-time services.

show abstract

A lifetime extended multi-levels heterogeneous routing protocol for wireless sensor networks

Cited by 47 publications

References 24 publications

An Energy‐Proficient Clustering‐Inspired Routing Protocol using Improved Bkd‐tree for Enhanced Node Stability and Network Lifetime 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

A new rank‐order clustering algorithm for prolonging the lifetime of wireless sensor networks

A Cross-Layer Optimization QoS Scheme in Wireless Multimedia Sensor Networks

Contact Info

Product

Resources

About