scholarly journals DIEER: Delay-Intolerant Energy-Efficient Routing with Sink Mobility in Underwater Wireless Sensor Networks

Sensors ◽  
2020 ◽  
Vol 20 (12) ◽  
pp. 3467
Author(s):  
Kamran Latif ◽  
Nadeem Javaid ◽  
Imdad Ullah ◽  
Zeeshan Kaleem ◽  
Zafar Abbas Malik ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Data Dissemination ◽  
Propagation Delay ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Underwater Wireless Sensor Networks ◽  
Energy Efficient Routing ◽  
Packet Delivery

Underwater Wireless Sensor Networks (UWSNs) are an enabling technology for many applications in commercial, military, and scientific domains. In some emergency response applications of UWSN, data dissemination is more important, therefore these applications are handled differently as compared to energy-focused approaches, which is only possible when propagation delay is minimized and packet delivery at surface sinks is assured. Packet delivery underwater is a serious concern because of harsh underwater environments and the dense deployment of nodes, which causes collisions and packet loss. Resultantly, re-transmission causes energy loss and increases end-to-end delay ( D E 2 E ). In this work, we devise a framework for the joint optimization of sink mobility, hold and forward mechanisms, adoptive depth threshold ( d t h ) and data aggregation with pattern matching for reducing nodal propagation delay, maximizing throughput, improving network lifetime, and minimizing energy consumption. To evaluate our technique, we simulate the three-dimensional (3-D) underwater network environment with mobile sink and dense deployments of sensor nodes with varying communication radii. We carry out scalability analysis of the proposed framework in terms of network lifetime, throughput, and packet drop. We also compare our framework to existing techniques, i.e., Mobicast and iAMCTD protocols. We note that adapting varying d t h based on node density in a range of network deployment scenarios results in a reduced number of re-transmissions, good energy conservation, and enhanced throughput. Furthermore, results from extensive simulations show that our proposed framework achieves better performance over existing approaches for real-time delay-intolerant applications.

An Energy Aware Routing Based on Swarm Intelligence for Wireless Sensor Networks

2013 ◽  
Vol 706-708 ◽  
pp. 635-638
Author(s):  
Yong Lv
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Swarm Intelligence ◽  
Network Lifetime ◽  
Average Energy ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Aware ◽  
Energy Efficient Routing

Wireless Sensor Networks consisting of nodes with limited power are deployed to collect and distribute useful information from the field to the other sensor nodes. Energy consumption is a key issue in the sensor’s communications since many use battery power, which is limited. In this paper, we describe a novel energy efficient routing approach which combines swarm intelligence, especially the ant colony based meta-heuristic, with a novel variation of reinforcement learning for sensor networks (ARNet). The main goal of our study was to maintain network lifetime at a maximum, while discovering the shortest paths from the source nodes to the sink node using an improved swarm intelligence. ARNet balances the energy consumption of nodes in the network and extends the network lifetime. Simulation results show that compared with the traditional EEABR algorithm can obviously improve adaptability and reduce the average energy consumption effectively.

scholarly journals Mobile target localization based on iterative tracing for underwater wireless sensor networks

2020 ◽  
Vol 16 (7) ◽  
pp. 155014772094063
Author(s):  
Ruolin Guo ◽  
Danyang Qin ◽  
Min Zhao ◽  
Guangchao Xu
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Acoustic Waves ◽  
Propagation Delay ◽  
Target Localization ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Underwater Wireless Sensor Networks ◽  
Underwater Environment ◽  
Mobile Target

In underwater wireless sensor networks, sensor position information has important value in network protocols and collaborative detection. However, many challenges were introduced in positioning sensor nodes due to the complexity of the underwater environment. Aiming at the problem of the stratification effect of underwater acoustic waves, the long propagation delay of messages, as well as the mobility of sensor nodes, a mobile target localization scheme for underwater wireless sensor network is proposed based on iterative tracing. Four modules are established in the mobile target localization based on iterative tracing: the data collection and rough position estimation, the estimation and compensation of propagation delay, the node localization, and the iteration. The deviation of distance estimation due to the assumption that acoustic waves propagate along straight lines in an underwater environment is compensated by the mobile target localization based on iterative tracing, and weighted least squares estimation method is used to perform linear regression. Moreover, an interacting multiple model algorithm is put forward to reduce the positioning error caused by the mobility of sensor nodes, and the two services of node time synchronization and localization assist each other during the iteration to improve the accuracy of both parties. The simulation results show that the proposed scheme can achieve higher localization accuracy than the similar schemes, and the positioning errors caused by the above three problems can be reduced effectively.

scholarly journals An Energy Efficient Localization-Free Routing Protocol for Underwater Wireless Sensor Networks

2012 ◽  
Vol 8 (4) ◽  
pp. 307246 ◽  
Author(s):  
Abdul Wahid ◽  
Dongkyun Kim
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Routing Protocol ◽  
Energy Efficient ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Underwater Wireless Sensor Networks ◽  
Research Attention ◽  
Underwater Environment

Recently, underwater wireless sensor networks (UWSNs) have attracted much research attention from both academia and industry, in order to explore the vast underwater environment. UWSNs have peculiar characteristics; that is, they have large propagation delay, high error rate, low bandwidth, and limited energy. Therefore, designing network/routing protocols for UWSNs is very challenging. Also, in UWSNs, improving the energy efficiency is one of the most important issues since the replacement of the batteries of underwater sensor nodes is very expensive due to the unpleasant underwater environment. In this paper, we therefore propose an energy efficient routing protocol, named (energy-efficient depth-based routing protocol) EEDBR for UWSNs. EEDBR utilizes the depth of sensor nodes for forwarding data packets. Furthermore, the residual energy of sensor nodes is also taken into account in order to improve the network lifetime. Based on the comprehensive simulation using NS2, we observe that EEDBR contributes to the performance improvements in terms of the network lifetime, energy consumption, and end-to-end delay. A previous version of this paper was accepted in AST-2011 conference.

scholarly journals Major Energy Efficient Routing Schemes in Wireless Sensor Networks: Survey and Idea

2013 ◽  
Vol 4 (2) ◽  
pp. 261-266 ◽  
Author(s):  
Jahangeer Ali ◽  
Gulshan Kumar ◽  
Dr. Mritunjay Kumar Rai
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Energy Efficient ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Efficient Routing ◽  
Routing Schemes ◽  
Sensing Applications

Sensing the environment without human intervention is carried out with Wireless Sensor Networks. Thus WSNs have gained impetus in every field as applicable to various sensing applications. As the sensor nodes are very minute with limited power, memory and controlling mechanism. Thus it is necessary to implement energy efficient routing in sensor nodes such that network lifetime is enhanced. In this paper, we have discussed various existing energy efficient routing schemes and made comparison on various parameters in literature survey. Finally came to conclusion that there is a need of an energy efficient routing protocol which can further extend network lifetime. We propose an idea in which existing; Enhanced Energy Efficient Protocol with Static Clustering (EEEPSC) is modified by placing a fraction of nodes having more energy than normal nodes in the locations where Base Station is far away. And BS is placed within the area of deployed nodes.

scholarly journals An Uneven Node Self-Deployment Optimization Algorithm for Maximized Coverage and Energy Balance in Underwater Wireless Sensor Networks

Sensors ◽  
2021 ◽  
Vol 21 (4) ◽  
pp. 1368 ◽  
Author(s):  
Luoheng Yan ◽  
Yuyao He ◽  
Zhongmin Huangfu
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Energy Balance ◽  
Optimization Algorithm ◽  
Growth Ring ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Underwater Wireless Sensor Networks ◽  
Connected Network ◽  
Deployment Optimization

The underwater wireless sensor networks (UWSNs) have been applied in lots of fields such as environment monitoring, military surveillance, data collection, etc. Deployment of sensor nodes in 3D UWSNs is a crucial issue, however, it is a challenging problem due to the complex underwater environment. This paper proposes a growth ring style uneven node depth-adjustment self-deployment optimization algorithm (GRSUNDSOA) to improve the coverage and reliability of UWSNs, meanwhile, and to solve the problem of energy holes. In detail, a growth ring style-based scheme is proposed for constructing the connective tree structure of sensor nodes and a global optimal depth-adjustment algorithm with the goal of comprehensive optimization of both maximizing coverage utilization and energy balance is proposed. Initially, the nodes are scattered to the water surface to form a connected network on this 2D plane. Then, starting from sink node, a growth ring style increment strategy is presented to organize the common nodes as tree structures and each root of subtree is determined. Meanwhile, with the goal of global maximizing coverage utilization and energy balance, all nodes depths are computed iteratively. Finally, all the nodes dive to the computed position once and a 3D underwater connected network with non-uniform distribution and balanced energy is constructed. A series of simulation experiments are performed. The simulation results show that the coverage and reliability of UWSN are improved greatly under the condition of full connectivity and energy balance, and the issue of energy hole can be avoided effectively. Therefore, GRSUNDSOA can prolong the lifetime of UWSN significantly.

scholarly journals Energy-efficient routing in the proximity of a complicated hole in wireless sensor networks

2021 ◽  
Author(s):  
Khanh-Van Nguyen ◽  
Chi-Hieu Nguyen ◽  
Phi Le Nguyen ◽  
Tien Van Do ◽  
Imrich Chlamtac
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Geographic Routing ◽  
Routing Algorithms ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Efficient Routing ◽  
Routing Schemes ◽  
Routing Scheme ◽  
Effective Manner

AbstractA quest for geographic routing schemes of wireless sensor networks when sensor nodes are deployed in areas with obstacles has resulted in numerous ingenious proposals and techniques. However, there is a lack of solutions for complicated cases wherein the source or the sink nodes are located close to a specific hole, especially in cavern-like regions of large complex-shaped holes. In this paper, we propose a geographic routing scheme to deal with the existence of complicated-shape holes in an effective manner. Our proposed routing scheme achieves routes around holes with the (1+$$\epsilon$$ ϵ )-stretch. Experimental results show that our routing scheme yields the highest load balancing and the most extended network lifetime compared to other well-known routing algorithms as well.

scholarly journals An Integrated Routing Mechanism on Homogenous Wireless Sensor Networks using Genetic Algorithm

2021 ◽  
Author(s):  
Ramin Danehchin
Keyword(s):  
Genetic Algorithm ◽  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Collection ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Efficient Routing ◽  
Hop Count ◽  
Routing Problem ◽  
Cluster Heads

Abstract Data collection on Wireless Sensor Networks (WSNs) is a significant challenge to satisfy the requirements of various applications. Providing an energy-efficient routing technique is the primary step in data collection over WSNs. The existing data collection techniques in the WSNs field struggle with the imbalance load distribution and the short lifetime of the network. This paper proposes a novel mechanism to select cluster-heads, cluster the wireless sensor nodes, and determine the optimal route from source nodes to the sink. We employ the genetic algorithm to solve the routing problem considering the hop-count of the cluster-heads to the sink, the number of each cluster member, residual energy of cluster-heads, and the number of cluster-heads connected to the sink as the fitness criteria. Our proposed mechanism uses a greedy approach to calculate the hop-count of each cluster-head to the sink for integrating the clustering and routing process on WSNs. The simulation results demonstrate that our proposed mechanism improves the energy consumption, the number of live nodes, and the lifetime of the network compared to other data collection approaches on WSNs.

scholarly journals End-To-End Delay Optimization in Wireless Sensor Network (WSN)

2012 ◽  
pp. 247-251
Author(s):  
Shweta K. Kanhere ◽  
Mahesh Goudar ◽  
Vijay M. Wadhai
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Relay Node ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Packet Forwarding ◽  
Central System ◽  
Neighboring Node ◽  
Packet Delivery ◽  
End To End

In this paper, we are interested in optimizing the delay of event-driven wireless sensor networks, for which events does not occur frequently. In such systems, most of the energy is consumed when the radios are on, waiting for an arrival to occur. Sleep-wake scheduling is an effective mechanism to prolong the lifetime of this energy constrained wireless sensor networks by optimization of the delay in the network but this scheme could result in substantial delays because a transmitting node needs to wait for its next-hop relay node to wake up. An attempt has been made to reduce these delays by developing new method of packet forwarding schemes, where each nod opportunistically forwards a packet to the its neighboring node that wakes up among multiple candidate nodes. In this paper, the focus is to study how to optimize the packet forwarding schemes by optimization of the expected packet-delivery delays from the sensor nodes to the sink. Based on optimized delay scheme result, we then provide a solution to the central system about how to optimally control the system parameters of the sleep-wake scheduling protocol and the packet forwarding protocol to maximize the network lifetime, subject to a constraint on the expected end-to-end packet delivery delay. Our numerical results indicate that the proposed solution can outperform prior heuristic solutions in the literature, especially under the practical scenarios where there are obstructions, e.g., a lake or a mountain, in the area of wireless sensor networks.

Sign in / Sign up

Export Citation Format

Share Document