Delay aware energy efficient reliable routing for data transmission in heterogeneous mobile sink wireless sensor network

Maurya, Sonam; Jain, V. K.; Chowdhury, Roy

doi:10.1016/j.jnca.2019.06.012

Cited by 41 publications

(15 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Possible future work could include HFE-based ring routing in WSNs, HFE-based heterogeneous clustering supporting sink mobility, HFE based on Cognitive Radio Sensor Networks (CRSN) etc. In addition to this, the proposed scheme can be applied to ring routing [49], big data systems [50], data compression [51] and blockchain technology [52] in terms of reliable data fusion.…”

Section: Discussionmentioning

confidence: 99%

Hesitant Fuzzy Entropy-Based Opportunistic Clustering and Data Fusion Algorithm for Heterogeneous Wireless Sensor Networks

Anees

Zhang

Baig

et al. 2020

Sensors

View full text Add to dashboard Cite

Limited energy resources of sensor nodes in Wireless Sensor Networks (WSNs) make energy consumption the most significant problem in practice. This paper proposes a novel, dynamic, self-organizing Hesitant Fuzzy Entropy-based Opportunistic Clustering and data fusion Scheme (HFECS) in order to overcome the energy consumption and network lifetime bottlenecks. The asynchronous working-sleeping cycle of sensor nodes could be exploited to make an opportunistic connection between sensor nodes in heterogeneous clustering. HFECS incorporates two levels of hierarchy in the network and energy heterogeneity is characterized using three levels of energy in sensor nodes. HFECS gathers local sensory data from sensor nodes and utilizes multi-attribute decision modeling and the entropy weight coefficient method for cluster formation and the cluster head election procedure. After cluster formation, HFECS uses the same techniques for performing data fusion at the first hierarchical level to reduce the redundant information flow from the first-second hierarchical levels, which can lead to an improvement in energy consumption, better utilization of bandwidth and extension of network lifetime. Our simulation results reveal that HFECS outperforms the existing benchmark schemes of heterogeneous clustering for larger network sizes in terms of half-life period, stability period, average residual energy, network lifetime, and packet delivery ratio.Sensors 2020, 20, 913 2 of 28 overall decrease in energy consumption and also reduces the interference among sensor nodes due to specific allocation of timeslots for communication purposes [4,5]. The clustering topology in WSN can effectively optimize the data redundancy by significantly reducing the size of the collected data using data aggregation and data fusion techniques at CH level. The aggregated or fused data can then be forwarded to the Base Station (BS) for further processing and accurate decision making of interested events [4][5][6].The recent literature shows that researchers have proposed a working-sleeping cycle strategy in WSN to save battery power in case the sensor nodes are idle and not performing any of the designated tasks. Alfayez et al. [7] discussed that the sensor nodes go to sleep to save their battery power and wake up before performing their routine operations. These node scheduling techniques can be categorized as synchronous and asynchronous working-sleeping scheduling. These node scheduling techniques are designed in accordance with the scenario to prolong the network lifetime and improve energy utilization by creating an opportunistic node connection between sensor nodes. According to [8][9][10][11][12], Opportunistic Routing (OR) is a paradigm for wireless networks that benefits from broadcast characteristics of a wireless medium by selecting multiple sensor nodes as candidate forwarders. In [10-12], a set of nodes were selected as potential forwarders that transmitted the data packet according to some special criteria after receiving data packet from their neighb...

show abstract

Section: Discussionmentioning

confidence: 99%

Hesitant Fuzzy Entropy-Based Opportunistic Clustering and Data Fusion Algorithm for Heterogeneous Wireless Sensor Networks

Anees

Zhang

Baig

et al. 2020

Sensors

View full text Add to dashboard Cite

show abstract

“…Tunca et al [29] performed a comparative analysis of various hierarchical routing protocols supporting sink mobility i.e. i) Grid-based [6,[31][32][33], ii) Tree-based [7,[34][35][36][37], iii) Cluster-based [37][38][39][40], iv) Area-based [30,9,[41][42][43][44] routing. Yarinezhad et al [32] proposed a virtual grid-based hierarchical routing protocol i.e., VGB which is designed to reduce the energy consumption and network delay by optimizing grid-header nodes while supporting sink mobility.…”

Section: Related Research Workmentioning

confidence: 99%

“…Maurya et al [30] presented the Load based Ring Routing (LBRR) in which multiple agent nodes help in prolonging the network lifetime by selecting energy efficient next-hop during data transmission. Delay Aware and Energy-Efficient Ring Routing (DA-EERR) protocol is proposed by Maurya et al [9]. DA-EERR adds the restricted search space to the concept of ring routing and LBRR to acquire minimum distance energy efficient next-hop node during data transmission.…”

Section: Related Research Workmentioning

confidence: 99%

“…Residual energy in time t is defined by omitting consumed energy in ∆t from the initial battery and harvested power in t-∆t. Thus, the energy efficiency for HESTOR can be computed in (9)…”

Section: B Virtual Ring Ch Electionmentioning

confidence: 99%

“…This type of hierarchical routing protocol would result in the significant decrease of advertisement overhead and also enhance the energy efficiency. Although the overall energy consumption could be decreased in multi-tier hierarchical structure, there is a high possibility that high-tier nodes might face hotspot problems due to increased traffic [6][7][8][9]. Tunca et al [10] proposed an area-based routing technique called ring routing, in which the formation of a virtual ring shaped structure is used to store the information of sink node's current position.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Harvested Energy Scavenging and Transfer capabilities in Opportunistic Ring Routing

et al. 2021

View full text Add to dashboard Cite

Energy conservation has always been a prominent design goal for hierarchical routing protocols supporting sink mobility. Advertising the current position of mobile sink introduces control packet overhead which ultimately results in an increase in energy consumption and shorter network lifetime. Energy harvesting through ambient sources have enabled the utilization of rechargeable devices for Wireless Sensor Networks to perpetually remain operational. The modifications in the hierarchical structure of wireless sensor networks along with energy scavenging approaches could possibly minimize the control packet overhead and also provide a significant improvement in energy conservation. In this paper, we propose a novel Harvested Energy Scavenging and Transfer capabilities in Opportunistic Ring Routing protocol which uses a distinguishing approach of hybrid (ring + cluster) topology in which the network architecture is initially supported by the formation of a virtual ring structure and then a two-tier routing topology is used in the virtual ring as an overlay by grouping nodes into clusters. The rate of energy gain from solar harvesting and radio frequency transfer is the criterion for selecting cluster heads. The role of cluster heads is exploited to advertise the mobile sink current position as well as forward the aggregated data towards mobile sink using energy transfer based opportunistic routing. The simulation results reveal that our scheme considerably outperforms the existing benchmarks in terms of control packet overhead, energy conservation, network lifetime, packet delivery ratio and average end-end delay.

show abstract

Node placement optimization using particle swarm optimization and iterated local search algorithm in wireless sensor networks

Chelbi

Dhahri

Bouaziz

2021

Int J Communication

View full text Add to dashboard Cite

Summary Coverage and connectivity are the two most challenging issues in target‐based wireless sensor networks (WSNs). For that, node placement is one of the fundamental concerns that affect the performance of coverage and connectivity in WSN. This paper introduces a new approach by combining particle swarm optimization and iterated local search (PSO‐ILS) to have an optimum coverage and connectivity rate with the minimum number of nodes. In one side, to maintain the full coverage of targets, the PSO‐ILS is used to deploy the minimum number of sensor nodes. In other side, to achieve the full connectivity, the optimal position determination (OPD) algorithm was conceived to identify the optimal candidate positions which can be used by the PSO‐ILS to place the minimum number of relay nodes. The obtained results considered over a number of runs are compared with canonical PSO, differential evolution (DE), and genetic algorithms (GAs). The outcomes derived from this comprehensive analysis determine that PSO‐ILS provides an effectual improvement in contrary to the methods PSO, DE, and GA in terms of the selected potential positions to ensure full coverage of target points and the number of relay nodes required to achieve full connectivity.

show abstract

Delay aware energy efficient reliable routing for data transmission in heterogeneous mobile sink wireless sensor network

Cited by 41 publications

References 30 publications

Hesitant Fuzzy Entropy-Based Opportunistic Clustering and Data Fusion Algorithm for Heterogeneous Wireless Sensor Networks

Hesitant Fuzzy Entropy-Based Opportunistic Clustering and Data Fusion Algorithm for Heterogeneous Wireless Sensor Networks

Harvested Energy Scavenging and Transfer capabilities in Opportunistic Ring Routing

Node placement optimization using particle swarm optimization and iterated local search algorithm in wireless sensor networks

Contact Info

Product

Resources

About