Hybrid energy efficient static routing protocol for homogeneous and heterogeneous large scale WSN

Qabouche, Hicham; Sahel, Aïcha; Badri, Abdelmajid

doi:10.1007/s11276-020-02473-2

Cited by 22 publications

(10 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As a departure, we consider that the network is divided into k levels. Each level k have a radius of k * do 2 from the BS [30] as shown in Figure 1. After leveling we proceed to CHs election and GTs selection to maintain cluster-heads to transmit collected information to the base station.…”

Section: Set-up Phasementioning

confidence: 99%

See 1 more Smart Citation

Novel reliable and dynamic energy-aware routing protocol for large scale wireless sensor networks

Qabouche

Sahel

Badri

et al. 2022

IJECE

Self Cite

View full text Add to dashboard Cite

<p>Wireless sensor networks (WSN) are made up of an important number of sensors, called nodes, distributed in random way in a concerned monitoring area. All sensor nodes in the network are mounted with limited energy sources, which makes energy harvesting on top of the list of issues in WSN. A poor communication architecture can result in excessive consumption, reducing the network lifetime and throughput. Centralizing data collection and the introduction of gateways (GTs), to help cluster heads (CHs), improved WSN life time significantly. However, in vast regions, misplacement and poor distribution of GTs wastes a huge amount of energy and decreases network’s performances. In this work, we describe a reliable and dynamic with energy-awareness routing (RDEAR) protocol that provides a new GT’s election approach taking into consideration CHs density, transmission distance and energy. Applied on 20 different networks, RDEAR reduced the overall energy consumption, increased stability zone and network life time as well as other compared metrics. Our proposed approach increased network’s throughput up to 75.92% , 67.7% and 9.78% compared to the low energy adaptive clustering hierarchy (LEACH), distributed energy efficient clustering (DEEC) and static multihop routing (SMR), protocols, respectively.</p>

show abstract

Section: Set-up Phasementioning

confidence: 99%

“…In this stage, CHs are elected based on the same process used on LEACH where each node will decide being a CH or not based on a random number compared with a threshold value T (s), expressed, as in [27], [30], in (3), the node became a CH if the number chosen is less than T (s).…”

Section: Chs Election Processmentioning

confidence: 99%

Novel reliable and dynamic energy-aware routing protocol for large scale wireless sensor networks

Qabouche

Sahel

Badri

et al. 2022

IJECE

Self Cite

View full text Add to dashboard Cite

show abstract

“…The HEESR (Hybrid Energy Efficient static routing protocol for homogeneous heterogeneous large scale WSNs) is providing maximum throughput using less energy. The Dormant nodes are not require input energy in sleeping modes 76) .…”

Section: Advantages Of Clusterizationmentioning

confidence: 99%

Qualitative Analysis of Intra-Class and Inter-Class Clustering Routing and Clusterization in Wireless Sensor Network

Mishra¹,

Priyadarshini²,

Choudhary³

et al. 2021

Evergreen

View full text Add to dashboard Cite

A wireless sensor network is a group of large number of nodes which are randomly deployed in a specific area. This deployment of nodes is in form of number of clusters. The main purpose of these nodes is to sense the surrounding condition like temperature, humidity etc. and send it to the central processing unit through the intermediate nodes following some routing protocol. The main concern here is the energy consumption by these nodes during the data communication as these nodes are equipped with non-rechargeable batteries. Currently much of the research is going on to design such routing protocol which can make the network energy efficient or to increase the lifetime of network. This paper provides a comparative review of clusterization and routing algorithms provided in the different literatures for wireless sensor network. Comparison was carried out on the basis of node density, types of nodes connectivity, network coverage area and cluster head selection probability.

show abstract

“…Qabouche et al [33] propose a static routing protocol that combines clustering and multi-hop routing. Data is transmitted in each round through independent SNs called gateways, which connect clusterhead SNs with the BS.…”

Section: Background and Related Workmentioning

confidence: 99%

Adaptive Probabilistic Model for Energy-Efficient Distance-based Clustering in WSNs (Adapt-P): A LEACH-based Analytical Study

Suleiman,

Hamdan

2021

Preprint

View full text Add to dashboard Cite

Network lifetime and energy consumption of data transmission have been primary Quality of Service (QoS) obligations in Wireless Sensor Networks (WSNs). The environment of a WSN is often organized into clusters to mitigate the management complexity of such obligations. However, the distance between Sensor Nodes (SNs) and the number of clusters per round are vital factors that affect QoS performance of a WSN. The designer's conundrum resolves around the desire to sustain a balance between the limited residual energy of SNs and the demand for prolonged network lifetime. Any imbalance in controlling conflicting objectives may result in either QoS penalties due to draining SN energies which leaves WSN's environment unevenly covered, or an over-cost environment that is significantly difficult to distribute and operate. Low-Energy Adaptive Clustering Hierarchy (LEACH) is a well-known distributed clustering algorithm proposed to tackle such difficulties. Multiple LEACH-based algorithms have also been proposed to enhance QoS requirements. Proposed algorithms typically focus on residual energies of SNs to compute a probability function that selects cluster-heads. Some algorithms form an optimal energy-efficient path toward a destination SN. Nevertheless, these algorithms do not consider variations in network's state at run-time. Such a state changes in an adaptive manner according to existing network structures and conditions. Thus, cluster-heads per round are not elected adaptively depending on the state and distances between SNs. To tackle such complications, this paper proposes an energy-efficient adaptive distance-based clustering called Adapt-P, in which an adaptive probability function is developed to formulate clusters. A near-optimal distance between each cluster-head and its cluster-members is formulated so that energy consumption of the network is mitigated and accordingly the network lifetime is maximized. Distances between and residual energies of SNs are employed to obtain a maximum number of cluster-heads to be elected per round. The cluster-head selection probability is adapted at the end of each round based on the maximum number of cluster-heads permitted per round found a priori and the number of existing alive SNs in the network. The Adapt-P based algorithms proposed in this paper improve the performance of LEACH algorithm in term adaptivity and network lifetime.

show abstract

Hybrid energy efficient static routing protocol for homogeneous and heterogeneous large scale WSN

Cited by 22 publications

References 21 publications

Novel reliable and dynamic energy-aware routing protocol for large scale wireless sensor networks

Novel reliable and dynamic energy-aware routing protocol for large scale wireless sensor networks

Qualitative Analysis of Intra-Class and Inter-Class Clustering Routing and Clusterization in Wireless Sensor Network

Adaptive Probabilistic Model for Energy-Efficient Distance-based Clustering in WSNs (Adapt-P): A LEACH-based Analytical Study

Contact Info

Product

Resources

About