Energy efficiency and reliability are widely understood to be one of the dominant considerations for Underwater Wireless Sensor Networks (UWSNs). In this paper, in order to maintain energy efficiency and reliability in a UWSN, Cuckoo Optimization Algorithm (COA) is adopted that is a combination of three techniques of geo-routing, multi-path routing, and Duty-Cycle mechanism. In the proposed alg...

In Underwater Wireless Sensor Networks (UWSNs), the geographic routing is a preferred choice for data transmission due to the unique characteristics of underwater environment such as the three dimensional topology, the limited bandwidth and power resources. This paper focuses on underwater routing protocols in the network layer, where underwater sensor nodes can collaborate with each other to t...

The use of efficient signal processing tools (SPTs) to extract proper indices for the fault detection in induction motors (IMs) is the essential part of any fault recognition procedure. The 2nd part of this two-part paper is, in turn, divided into two parts. Part two covers the signal processing techniques which can be applied to non-stationary conditions. In this paper, all utilized SPTs for n...

The stateless, low overhead and distributed nature of the Geographic routing protocols attract a lot of research attentions recently. Since the geographic routing would face void problems, leading to complementary routing such as perimeter routing which degrades the performance of geographic routing, most research works are focus on optimizing this complementary part of geographic routing to im...

Stateless greedy forwarding based on physical positions of nodes is considered to be more scalable than conventional topology-based routing. However, the stateless nature of geographic forwarding also prevents it from predicting holes in node distribution. Thus, frequent topology holes can significantly degrade the performance of geographic forwarding. So far the approaches mostly depend on exc...

We present a new geographic routing algorithm, Greedy Distributed Spanning Tree Routing (GDSTR), that finds shorter routes and generates less maintenance traffic than previous algorithms. While geographic routing potentially scales well, it faces the problem of what to do at local dead ends where greedy forwarding fails. Existing geographic routing algorithms handle dead ends by planarizing the...

Geographic routing exerts geographic information to select the next-hop along the route to the destination. Greedy forwarding is a geographic routing mechanism that uses geographical location information of nodes and the distance of each node to the destination, to select next-hop node that achieve the most positive movement to the destination. Where greedy forwarding is not possible, it can be...

Minimizing Energy consumption is considered as one of the most important principles in the development of routing protocols for Wireless Sensor Networks (WSN). In this study, we propose a Location based Energy-Aware Reliable routing protocol (LEAR) for WSN based on sensor position and clustering. Geographical routing protocols are efficient and convenient for optimum energy consumption and band...

In this paper, we propose a cross-layer optimized geographic node-disjoint multipath routing algorithm, that is, twophase geographic greedy forwarding plus. To optimize the system as a whole, our algorithm is designed on the basis of multiple layers’ interactions, taking into account the following. First is the physical layer, where sensor nodes are developed to scavenge the energy from environ...