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.
There are two actors in cloud computing environment cloud providers and cloud users. On one hand cloud providers hold enormous computing resources in the cloud large data centers that rent the resources out to the cloud users on a pay-per-use basis to maximize the profit by achieving high resource utilization. On the other hand cloud users who have applications with loads variation and lease the resources from the providers they run their applications within minimum expenses. One of the most critical issues of cloud computing is resource management in infrastructure as a service (IaaS). Resource management related problems include resource allocation, resource adaptation, resource brokering, resource discovery, resource mapping, resource modeling, resource provisioning and resource scheduling. In this review we investigated resource allocation schemes and algorithms used by different researchers and categorized these approaches according to the problems addressed schemes and the parameters used in evaluating different approaches. Based on different studies considered, it is observed that different schemes did not consider some important parameters and enhancement is required to improve the performance of the existing schemes. This review contributes to the existing body of research and will help the researchers to gain more insight into resource allocation techniques for IaaS in cloud computing in the future.
Cloud computing infrastructure is suitable for meeting computational needs of large task sizes. Optimal scheduling of tasks in cloud computing environment has been proved to be an NP-complete problem, hence the need for the application of heuristic methods. Several heuristic algorithms have been developed and used in addressing this problem, but choosing the appropriate algorithm for solving task assignment problem of a particular nature is difficult since the methods are developed under different assumptions. Therefore, six rule based heuristic algorithms are implemented and used to schedule autonomous tasks in homogeneous and heterogeneous environments with the aim of comparing their performance in terms of cost, degree of imbalance, makespan and throughput. First Come First Serve (FCFS), Minimum Completion Time (MCT), Minimum Execution Time (MET), Max-min, Min-min and Sufferage are the heuristic algorithms considered for the performance comparison and analysis of task scheduling in cloud computing.
Abstract:The underwater wireless sensor network (UWSN) is considered a promising technology for collecting valuable data from underwater areas, particularly for aiding military operations and environmental predictions. UWSNs consist of underwater sensor nodes that have limited energy and use acoustics for communication. Routing in underwater sensor nodes is one of the challenging issues in UWSNs because of the need to forward data packets with minimal energy consumption and a high packet delivery ratio. Selecting the next forwarding nodes is one of the key components of routing in UWSNs and has a direct effect on energy consumption and the packet delivery ratio. Therefore, this problem has gained much attention from the research community with the intent of enhancing the performance of UWSNs. This paper qualitatively reviews routing protocols for UWSNs, focusing on the next-hop selection method and its strengths and weaknesses. A taxonomy is presented for reviewing routing protocols under different categories of the classification. A summary of the qualitative investigation is presented highlighting aims, the next-hop selection method, metrics, and priority considerations. A comprehensive investigation is carried out focusing on energy, link quality, void awareness, reliability, and shortest path characteristics. Finally, we discuss potential future research directions in UWSNs for forwarding node selection.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.