Abstract

In this article, to monitor the fields with square and circular geometries, three energy-efficient routing protocols are proposed for underwater wireless sensor networks. First one is sparsity-aware energy-efficient clustering, second one is circular sparsity-aware energy-efficient clustering, and the third one is circular depth–based sparsity-aware energy-efficient clustering routing protocol. All three protocols are proposed to minimize the energy consumption of sparse regions, whereas sparsity search algorithm is proposed to find sparse regions and density search algorithm is used to find dense regions of the network field. Moreover, clustering is performed in dense regions to minimize redundant transmissions of a data packet, while sink mobility is exploited to collect data from sensor nodes with an objective of minimum energy consumption. A depth threshold [Formula: see text] value is also used to minimize number of hops between source and destination for less energy consumption. Simulation results show that our schemes perform better than their counter-part schemes (depth-based routing and energy-efficient depth-based routing) in terms of energy efficiency.

Highlights

  • Underwater wireless sensor network (UWSN) has attracted industrial and research community due to its detrimental nature which provides many unique applications like under-sea exploration, aquatic environment monitoring, underwater pollution monitoring, coastal surveillance for defense strategies, mineral extraction, and so on.[1,2,3] Typical UWSN architecture consists of sink(s) and sensor nodes to gather useful information

  • UWSN: underwater wireless sensor network; DBR: depth-based routing; EEDBR: energy-efficient depth-based routing; WDFAD-DBR: weighting depth and forwarding area division depth-based routing; DEADS: depth and energy aware dominating set–based algorithm; BTM: balance transmission mechanism; NNDBC: node non-uniform deployment based on clustering; DDG: distributed data gathering; AURP: AUV-aided underwater routing protocol; 3D-SM: three-dimensional sink mobility; ACOA: ant colony optimization algorithm; AFSA: artificial fish swarm algorithm; AUVs: autonomous underwater vehicles; CNs: courier nodes; mobile sink(s) (MS): mobile sink

  • In EEDBR, packet delivery in each round is higher than DBR and sparsity-aware energy-efficient clustering (SEEC) due to the selection of high residual energy and low depth sensor nodes to forward data at the cost of high energy consumption as shown in Figure 11, while in our proposed routing protocol, the ratio of packets sent in each round is less because cluster head (CH) transmit compressed data packet of all neighbors to the sink(s) instead of multiple packets

Read more

Summary

Introduction

Underwater wireless sensor network (UWSN) has attracted industrial and research community due to its detrimental nature which provides many unique applications like under-sea exploration, aquatic environment monitoring, underwater pollution monitoring, coastal surveillance for defense strategies, mineral extraction, and so on.[1,2,3] Typical UWSN architecture consists of sink(s) and sensor nodes to gather useful information. Wahid and Kim[6] select the forwarder node with high residual energy and low depth to avoid energy hole creation in the network It balanced the energy consumption in dense regions of the network, nodes near the sink(s) die quickly as compared to nodes far from the destination due to imbalanced traffic load. This article (an extension of Azam et al.9) introduces three energy-efficient routing protocols, sparsity-aware energy-efficient clustering (SEEC),[9] circular sparsityaware energy-efficient clustering (CSEEC), and circular depth–based sparsity-aware energy-efficient clustering (CDSEEC), to minimize the data load in the dense regions and to avoid energy hole creation in sparse regions of the network field. Performance evaluation is presented in section ‘‘Simulation discussion,’’ and, the conclusion of our work is given in section ‘‘Conclusion and future work.’’

Related work
5: Find coordinates of node n
Conclusion and future work
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.