One of the most challenging issues in the routing protocols for underwater wireless sensor networks (UWSNs) is the occurrence of void areas (communication void). That is, when void areas are present, the data packets could be trapped in a sensor node and cannot be sent further to reach the sink(s) due to the features of the UWSNs environment and/or the configuration of the network itself. Opportunistic routing (OR) is an innovative prototype in routing for UWSNs. In routing protocols employing the OR technique, the most suitable sensor node according to the criteria adopted by the protocol rules will be elected as a next-hop forwarder node to forward the data packets first. This routing method takes advantage of the broadcast nature of wireless sensor networks. OR has made a noticeable improvement in the sensor networks’ performance in terms of efficiency, throughput, and reliability. Several routing protocols that utilize OR in UWSNs have been proposed to extend the lifetime of the network and maintain its connectivity by addressing void areas. In addition, a number of survey papers were presented in routing protocols with different points of approach. Our paper focuses on reviewing void avoiding OR protocols. In this paper, we briefly present the basic concept of OR and its building blocks. We also indicate the concept of the void area and list the reasons that could lead to its occurrence, as well as reviewing the state-of-the-art OR protocols proposed for this challenging area and presenting their strengths and weaknesses.

In this paper we formulate a MultiSLA-Aware routing mechanism for GMPLS networks. Our approach aims at providing a realistic energy and emission aware routing mechanism by considering multiple Service Level Agreements. The proposed method of this paper has been tested with a more accurate and realistic energy and emission data calculated in course of performing the analysis. Our proposed method shows up to 55% reduction in emission while providing 100% Availability and Delay Service Level Agreement satisfactions.

In this paper, we present an Energy Efficient Depth-Based Opportunistic Routing protocol (EEDOR) that enhances the network lifetime of underwater wireless sensor networks. We implement EEDOR using an opportunistic routing approach, where a source node and its neighbors use wireless broadcast when exchanging their information to form the forwarding set. A novel holding time formula is used for each forwarding node based on its depth difference with the source and its priority in the forwarding set. We compare our proposed EEDOR protocol with the well-known DBR and EEDBR protocols. Our extensive simulation results show that our technique is energy efficient, reduces retransmissions and increases network stability. Our simulation results also show that EEDOR outperforms the EECOR and FLCOR protocols.

This paper introduces a new resource allocation mechanism for Wavelength Division Multiplexing (WDM) networks. The simple yet effective method introduced in this paper assigns the resources of a dynamically calculated route without needing an optimization solver. By minimizing the number of Lambda conversions at each node using this method, up to 8% more success rate can be achieved compared to assigning the resources using First Fit (FF) with continuity constraint. This method also results in up to 35% less energy usage compared to assigning the resources using First Fit without continuity constraint. The name of N Hop A Kind is after a winning combination of the game of Poker in which a hand with “n of a kind” wins.

In this paper we consider Green Service Level Agreement (SLA) as a constraint in finding a route for a dynamically received connection request in Wavelength Division Multiplexing (WDM) networks.We show that it is possible to save energy and reduce Greenhouse Gas (GHG) emission while satisfying optical network SLAs.The Integer Linear Programming (ILP) method introduced in this paper has been engineered to be simple and be solved in a timely manner needed for serving a dynamic connection request in control plane of the optical network.The ILP method introduced in this paper for the control plane of Optical WDM networks could also be used for the control plane of Software Defined Networks (SDN) and Software Defined Wide Area Networks.

An extensive body of research has been accumulated on finding alternative methods for supplying nodes with their locations in Wireless Sensor Networks (WSNs). Although some path planning models in two-dimensional (2D) regions have been proposed in recent years, many WSNs' realistic applications are applied in three-dimensional (3D) regions. In this paper, we introduce a three-dimensional path planning model for mobile anchor-assisted localization in WSNs. Our proposed model offers higher performance in terms of localization accuracy with a lower error rate in comparison to other proposed models.

In many applications of wireless sensor networks (WSNs), node location is required to locate the monitored event once occurs. Mobility-assisted localization has emerged as an efficient technique for node localization. It works on optimizing a path planning of a location-aware mobile node, called mobile anchor (MA). The task of the MA is to traverse the area of interest (network) in a way that minimizes the localization error while maximizing the number of successful localized nodes. For simplicity, many path planning models assume that the MA has a sufficient source of energy and time, and the network area is obstacle-free. However, in many real-life applications such assumptions are rare. When the network area includes many obstacles, which need to be avoided, and the MA itself has a limited movement distance that cannot be exceeded, a dynamic movement approach is needed. In this paper, we propose two novel dynamic movement techniques that offer obstacle-avoidance path planning for mobility-assisted localization in WSNs. The movement planning is designed in a real-time using two swarm intelligence based algorithms, namely grey wolf optimizer and whale optimization algorithm. Both of our proposed models, grey wolf optimizer-based path planning and whale optimization algorithm-based path planning, provide superior outcomes in comparison to other existing works in several metrics including both localization ratio and localization error rate.

Mobile anchor path planning techniques have provided as an alternative option for node localization in wireless sensor networks (WSNs). In such context, path planning is a movement pattern where a mobile anchor node's movement is designed in order to achieve a maximum localization ratio possible with a minimum error rate. Typically, the mobility path planning is designed in advance, which is applicable when the mobile anchor has sufficient sources of energy and time. However, when the mobility movement is restricted or limited, a dynamic path planning design is needed. This paper proposes a novel distributed range-free movement mechanism for mobility-assisted localization in WSNs when the mobile anchor's movement is limited. The designed movement is formed in real-time pattern using a fuzzy-logic approach based on the information received from the network and the nodes' deployment. Our proposed model, Fuzzy-Logic based Path Planning for mobile anchor-assisted Localization in WSNs (FLPPL), offers superior results in several metrics including both localization accuracy and localization ratio in comparison to other similar works.

Localization is essential to consider in relation to wireless sensor networks issues. Establishing mobility in the localization process creates improvements in various regards. Static path planning is one of a number of mobility models that are used in localization in wireless sensor networks. Most static path planning models depend on trilateration or triangulation concepts in direct connection fashion between unknown nodes and anchors for successful node localization; however, such methods are insufficient in cases of mobility discontinuity. Considering scenarios where the mobile anchor has limited movement, in this paper we propose using the DV-Hop technique to increase the localization ratio in static path planning models in wireless sensor networks.

This paper presents green service level agreement (GSLA) awareness for the hybrid and traditional routing mechanisms by proposing a mathematical model for the amount of route greenness, and proposing two algorithms for the adoption of GSLA. The effect of the adoption of GSLA on a network that on average has green energy available for longer duration of a day is modeled by defining a one-step two-by-two Markov matrix and representing the transformation through a state machine. This work also examines a re-provisioning algorithm to deal with the effect of re-provisioning of the established lightpaths in case of a change in the topology of a network. To study the effect of adopting GSLA, two Scenarios with different arrival rates of connections and four performance parameters such as average emission per lambda, average connection length, GSLA satisfaction and success rate are defined and analyzed over NSFnet. Results reveal that adopting the GSLA by routing mechanisms decreases the resource efficiency with both light and heavy traffic in return for less reduction in emission as compared to green and hybrid routing mechanisms.

The consistent performance, energy efficiency, and reliability are important factors for real-time monitoring of a patient's data, especially in a hospital environment. In this paper a routing protocol is proposed by considering the Quality of Service requirements of the body area network data packets. A mechanism for handling delay-sensitive packets is provided by this protocol. Extensive simulations using OMNeT++ based simulator Castalia illustrate that the proposed algorithm provides better performance than other QoS-aware routing protocols in terms of higher successful transmission rates, lower overall network traffic load, and fewer number of packet timeouts in both the mobile and static patient scenarios.

The paper deploys an adaptive provisioning algorithm to the traffic with huge volume of high-priority connection (BHC) requests with long holding time by proposing a novel service level agreement (SLA) aware mechanism over optical shared mesh networks. The contribution presented in this paper follows three main characteristics: (i) Proposing a new time-aware traffic engineering path constraint considering holding time of connections in addition to the availability; (ii) introducing a novel provisioning algorithm considering the proposed path attribute; and (iii) applying a high volume of high-priority dynamic traffic with long duration to the introduced mechanism in a new simulation environment to prove its effectiveness. The proposed mechanism benefits from dynamic SLA negotiation between a customer and service providers to buffer and further process the potentially blocked BHC requests. The simulation environment evaluates the network performance for two types of traffic: (i) traffic with different connection durations and (ii) traffic with different number of high-priority requests. The simulation results show reduced blocking probability, increased availability satisfaction rate, decreased resource overbuild and better resource utilization to preserve the high-priority class of traffic with long connection durations compared with other SLA-aware algorithms and protection schemes in shared mesh optical networks.

A variety of wireless sensor network (WSN) applications have been proposed. However, the efficiency of WSNs, as well as their ability to interact with different environments, varies. Many challenges and problems to be solved remain. Overcoming these challenges requires a protocol that will design and provide a highly efficient system, thus helping the WSN to transmit data in a suitable time. In WSNs with Mobile Elements (MEs), the task is first to find an effective way to minimize the length of the tour that the ME follows for data gathering. However, the minimized tour length should still offer access to all nodes in the networks for data collection form the sensor nodes. In this paper, we propose a protocol that results in a shorter ME tour length than previously proposed protocols, using closest rendezvous points (CRPs) distributed throughout the network. Furthermore, this proposed protocol offers access to all nodes inside the network for the exchange of data with the MEs, as facilitated by the suggested CRP algorithm. One or more nodes can be represented by a single CRP that provides connectivity to all of the nodes within its wireless range. In cases where a greater number of MEs are used, less time is required to traverse the network for data gathering. This research demonstrates that the tour time can be reduced significantly by using more than one ME.

This paper proposes a novel integrated energy and QoS-aware routing protocol with the considerations of energy, end-to-end latency, and reliability requirements of body area network (BAN) communication. The proposed routing protocol, called ZEQoS, introduces two main modules (MAC layer and network layer) and three algorithms (neighbor table constructor, routing table constructor, and path selector). To handle ordinary packets (OPs), delay-sensitive packets (DSPs), and reliability-sensitive packets (RSPs), the new mechanism first calculates the communication costs, end-to-end path delays, and end-to-end path reliabilities of all possible paths from a source to destination. The protocol then selects the best possible path(s) for OPs, RSPs, and DSPs by considering their QoS requirement. Extensive simulations using OMNeT++ based simulator Castalia 3.2 demonstrate that the performance of the proposed integrated algorithm is satisfactory when tested on a real hospital scenario, and all data types including OPs, DSPs, and RSPs are used as offered traffic. Simulations also show that the ZEQoS also offers better performance in terms of higher throughput, less packets dropped on MAC and network layers, and lower network traffic than comparable protocols including DMQoS and noRouting.

The recent research in Body Area Networks (BANs) is focused on making its communication more reliable, energy efficient, secure, and to better utilize system resources. In this paper we propose a novel BAN architecture for indoor hospital environments, and a new mechanism of peer discovery with routing table construction that helps to reduce network traffic load, energy consumption, and improves BAN reliability. The three scenarios with fixed and variable number of packets sent by source nodes are considered for better analysis. Static nodes are considered in first and second scenarios whereas mobile nodes are used in third scenario. We have performed extensive simulations in the OMNeT++ based Castalia-3.2 simulation environment to show that our proposed protocol has better performance in terms of reduced BAN traffic load, increased successful transmission rate, reduced number of packets forwarded by intermediate nodes, no packets dropped due to buffer overflow, and overall lower energy consumption when compared with a similar protocols.

The paper deploys an adaptive provisioning algorithm to the traffic with huge volume of high priority connection requests with long holding time by proposing a novel SLA-aware mechanism over optical shared mesh networks. The contribution presented in this paper follows three main characteristics: i) Proposing a new time-aware traffic engineering path constraint considering holding time of connections in addition to the availability, ii) Introducing a novel provisioning algorithm considering the proposed path attribute, and iii) Applying a high volume of high- priority dynamic traffic with long duration to the introduced mechanism in a new simulation environment to prove its effectiveness. The proposed mechanism benefits from dynamic service level agreement negotiation between a customer and service providers to buffer and further process the potentially blocked high priority connection requests. The simulation results show reduced blocking probability, increased availability satisfaction rate, decreased resource overbuild, and better resource utilization to preserve the high priority class of traffic compared to other SLA-aware algorithms and protection schemes in shared mesh optical networks.

The reliability, energy efficiency, and real-time display of patient's data are important factors for Body Area Network (BAN) communication in indoor hospital environments. In this paper we propose a novel routing protocol by considering the QoS requirements of BAN data with strict reliability requirements. Our proposed algorithm increases the reliable delivery of critical BAN data at the destination We have performed extensive simulations in the OMNeT++ based simulator Castalia to demonstrate the better performance of the proposed QoS based routing protocol for reliability sensitive data in terms of successful transmission rate, lower network routing traffic (hello packets) overhead, and lower end-to-end delay (latency) in both stationary and movable patient scenarios.

This paper presents a novel link-layer encryption protocol for wireless sensor networks. The protocol design aims to reduce energy consumption by reducing security related communication overhead. This is done by merging security related data of consecutive packets. The merging (or combining packets) based on simple mathematical operations helps to reduce energy consumption by eliminating the requirement to send security related fields in headers and trailers. We name our protocol as the Compact Security Protocol referred to as C-Sec. In addition to energy savings, the C-Sec protocol also includes a unique security feature of hiding the packet header information. This feature makes it more difficult to trace the flow of wireless communication, and helps to minimize the cost of defending against replay attacks. We performed rigorous testing of the C-Sec protocol and compared it with well-known protocols including TinySec, MiniSec, SNEP and Zigbee. Our performance evaluation demonstrates that the C-Sec protocol outperforms other protocols in terms of energy savings. We also evaluated our protocol with respect to other performance metrics including queuing delay and error probability.

Security was not considered when current wireless sensor nodes were designed. As a result, providing high level of security on current WSNs platforms is unattainable, especially against attacks based on key resolving and node compromise. In this paper, we scrutinize the security holes in current WSNs platforms and compare the main approaches to implementing their cryptographic primitives in terms of security, time, and energy efficiency. To secure these holes and provide more efficiency, we propose SN-SEC, a 32-bit RISC secure wireless sensor platform with hardware cryptographic primitives. The choice of cryptographic primitives for SN-SEC is based on their compatibility with the constrained nature of WSNs and their security. SN-SEC is implemented using very high-speed integrated circuit hardware description language. Experimental results using synthesis for Spartan-6 low-power FPGA show that the proposed design has a very reasonable computational time and energy consumption compared to well-known WSN processers.