• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.7
• /
• pp.3064-3094
• /
• 2018

Currently, the Underwater Sensor Networks (UWSNs) is mainly an interesting area due to its ability to provide a technology to gather many valuable data from underwater environment such as tsunami monitoring sensor, military tactical application, environmental monitoring and many more. However, UWSNs is suffering from limited energy, high packet loss and the use of acoustic communication. In UWSNs most of the energy consumption is used during the forwarding of packet data from the source to the destination. Therefore, many researchers are eager to design energy efficient routing protocol to minimize energy consumption in UWSNs. As the opportunistic routing (OR) is the most promising method to be used in UWSNs, this paper focuses on the existing proposed energy efficient OR protocol in UWSNs. This paper reviews the existing proposed energy efficient OR protocol, classifying them into 3 categories namely sender-side-based, receiver-side-based and hybrid. Furthermore each of the protocols is reviewed in detail, and its advantages and disadvantages are discussed. Finally, we discuss potential future work research directions in UWSNs, especially for energy efficient OR protocol design.

• Journal of Institute of Control, Robotics and Systems
• /
• v.19 no.8
• /
• pp.694-701
• /
• 2013

This paper deals with the problem of accurately tracking a single target moving through UWSNs (Underwater Wireless Sensor Networks) by employing underwater acoustic sensors. This paper addresses the issues of estimating the states of the target, and improving energy efficiency by applying a Kalman filter in a distributed architecture. Each underwater wireless sensor nodes composing the UWSNs is battery-powered, so the energy conservation problem is a critical issue. This paper provides an algorithm which increases the energy efficiency of each sensor node through WuS (Waked-up/Sleeping) and VM (Valid Measurement) selecting schemes. Simulation results illustrate the performance of the distributed tracking filter.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.49 no.3
• /
• pp.19-25
• /
• 2012

Underwater sensor networks (UWSNs) employ acoustic channels for communications. One of the main characteristics of the underwater acoustic channel is long propagation delay. Previously proposed MAC (medium access control) protocols for wireless sensor networks cannot be directly used in UWSNs due to the long propagation delay. The long propagation delay and uneven nodes deployments cause spatial fairness in UWSNs. Therefore, a new MAC protocol for UWSNs needs to be developed to provide efficient communications. In this paper, we propose an efficient MAC protocol in order to alleviate the fairness problem. In the proposed scheme, when a node receives a RTS packet, it does not immediately send back but delays a CTS packet. The node collects several RTS packets from source nodes during the delay time. It chooses one of the RTS packets based on the queue status information. And then, it sends a CTS packet to the source node which sent the chosen RTS packet. The performance of the proposed scheme is investigated via simulation. Simulation results show that our scheme is effective and alleviates the fairness problem.

• Journal of Institute of Control, Robotics and Systems
• /
• v.15 no.6
• /
• pp.641-648
• /
• 2009

Currently several kinds of sensor localization methods have been developed for terrestrial wireless sensor networks. This study, in order to extend the field to underwater environments, a localization technique is studied for UWSNs (Underwater Wireless Sensor Networks). In underwater environments, RF (Radio Frequency) signal is not suitable for underwater usage because of extremely limited propagation. Because of that reason UWSNs should be constituted with acoustic modems. But, to realize underwater application, we can borrow many design principles from ongoing research for terrestrial environments. So, in this paper we introduce the modified localization algorithm using ToA method which is based on the terrestrial research. First of all, we study the localization techniques for terrestrial environments where we investigate possible methods to underwater environment. And then the appropriate algorithm is presented in the underwater usage. Finally the proposed underwater based localization algorithm is evaluated by using computer.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.2
• /
• pp.504-527
• /
• 2015

Underwater wireless sensor networks (UWSNs) are similar to the terrestrial sensor networks. Nevertheless, there are different characteristics among them such as low battery power, limited bandwidth and high variable propagation delay. One of the common major problems in UWSNs is determining an efficient and reliable routing between the source node and the destination node. Therefore, researchers tend to design efficient protocols with consideration of the different characteristics of underwater communication. Furthermore, many routing protocols have been proposed and these protocols may be classified as location-based and location-free routing protocols. Pressure-based routing protocols are a subcategory of the location-free routing protocols. This paper focuses on reviewing the pressure-based routing protocols that may further be classified into non-void avoidance protocols and void avoidance protocols. Moreover, non-void avoidance protocols have been classified into single factor based and multi factor based routing protocols. Finally, this paper provides a comparison between these protocols based on their features, performance and simulation parameters and the paper concludes with some future works on which further study can be conducted.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.10
• /
• pp.4844-4864
• /
• 2017

Interference-aware routing protocol design for underwater wireless sensor networks (UWSNs) is one of the key strategies in reducing packet loss in the highly hostile underwater environment. The reduced interference causes efficient utilization of the limited battery power of the sensor nodes that, in consequence, prolongs the entire network lifetime. In this paper, we propose an energy-efficient interference-aware routing (EEIAR) protocol for UWSNs. A sender node selects the best relay node in its neighborhood with the lowest depth and the least number of neighbors. Combination of the two routing metrics ensures that data packets are forwarded along the least interference paths to reach the final destination. The proposed work is unique in that it does not require the full dimensional localization information of sensor nodes and the network total depth is segmented to identify source, relay and neighbor nodes. Simulation results reveal better performance of the scheme than the counterparts DBR and EEDBR techniques in terms of energy efficiency, packet delivery ratio and end-to-end delay.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.18 no.5
• /
• pp.1390-1411
• /
• 2024

Underwater Wireless Sensors Networks (UWSNs) are deployed in remotely monitored environment such as water level monitoring, ocean current identification, oil detection, habitat monitoring and numerous military applications. Providing scalable and efficient routing is very challenging in UWSNs due to the harsh underwater environment. The biggest difficulties are the nodes inherent movement due to water current, long delay in data transmission, low bandwidth of the acoustic signal, high error rate and energy scarcity in battery powered nodes. Many routing protocols have been proposed to solve the aforementioned problems. There are three broad categories of routing protocols namely depth based, energy based and vector-based routing. Vector Based Forwarding protocols perform routing through virtual pipeline by defining their radius which give proper direction to packets communication. We proposed a routing protocol termed as Path-Oriented Energy Scaled Expanded Vector Based Forwarding (PESEVBF). PESEVBF takes into account all parameters; holding time, the source nodes packets routing path and void holes creation on the second hop; PESEVBF not only considers the packet upward advancement but also focus on density of the forwarded nodes in terms of number of potential forwarding and suppressed nodes for path selection. Node selection in resultant holding time is based on minimum Path Factor (PF) value. Moreover, the suppressed node will be selected for packet forwarding to avoid the void holes occurrences on the second hop. Performance of PESEVBF is compared with other routing protocols using matrices such as energy consumption, packet delivery ratio, packets dropping ratio and duplicate packets creation indicating considerable performance improvement.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.11
• /
• pp.2940-2955
• /
• 2012

In this paper, we propose aggregate signcryption for achieving data security in UWSNs. The main challenge of these networks established in sensitive environments is offline sink visiting. Moreover, the sensors must retain collected data for long enough time to offload them onto the itinerant sink. Thus, the unattended nature of data collection intervals might offer the adversary the opportunity to apply various attacks without detection. In this paper, employing low order operations (in time and space), we propose a new secure scheme in which various security goals such as confidentiality (through encrypting), authentication and integrity (through signing) are achieved. In addition, the aggregation process of our scheme reduces the space and communication overheads both for sensors and sink, i.e. the proposed technique efficiently enables the sensors and sink to protect, verify and recover all the related data. We further compare our scheme with the best alternative work in the literature.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.10
• /
• pp.4971-4987
• /
• 2019

Node localization is the basic task of underwater wireless sensor networks (UWSNs). Most of the existing underwater localization methods rely on ranging accuracy. Due to the special environment conditions in the ocean, beacon nodes are difficult to deploy accurately. The narrow bandwidth and high delay of the underwater acoustic communication channel lead to large errors. In order to reduce the ranging error and improve the positioning accuracy, we propose a localization algorithm based on ranging correction and inertial coordination. The algorithm can be divided into two parts, Range Correction based Localization algorithm (RCL) and Inertial Coordination based Localization algorithm (ICL). RCL uses the geometric relationship between the node positions to correct the ranging error and obtain the exact node position. However, when the unknown node deviates from the deployment area with the movement of the water flow, it cannot communicate with enough beacon nodes in a certain period of time. In this case, the node uses ICL algorithm to combine position data with motion information of neighbor nodes to update its position. The simulation results show that the proposed algorithm greatly improves the positioning accuracy of unknown nodes compared with the existing localization methods.

• Journal of Korea Multimedia Society
• /
• v.14 no.11
• /
• pp.1438-1449
• /
• 2011

UWSNs(Underwater Wireless Sensor Networks) need effective modeling fitted to the customized type of application and its covering area. In particular it requires an energy efficient data aggregation method for such customized application. In this paper, we envisage the application oriented model for monitoring the pollution or intrusion detection over a given underwater area. The suggested model is based on the honeycomb array of hexagonal prisms. In this model, the purpose of data aggregation is that the head node of each layer(cluster) receives just one event data arrived firstly and transfer this and its position data to the base station effectively in the manner of energy efficiency and simplicity without duplication. Here if we apply the existent data aggregation methods to this kind of application, the result is far from energy efficiency due to the complexity of the data aggregation process based on the shortest path or multicast tree. In this paper we propose three energy efficient and simple data aggregation methods in the domain of cluster and three in the domain of inter-cluster respectively. Based on the comparative performance analysis of the possible combination pairs in the two domains, we derive the best energy efficient data aggregation method for the suggested application.