AMCTD: Adaptive Mobility of Courier nodes in Threshold-optimized DBR Protocol for Underwater Wireless Sensor Networks

In dense underwater sensor networks (UWSN), the major confronts are high error probability, incessant variation in topology of sensor nodes, and much energy consumption for data transmission. However, there are some remarkable applications of UWSN such as management of seabed and oil reservoirs, exploration of deep sea situation and prevention of aqueous disasters. In order to accomplish these applications, ignorance of the limitations of acoustic communications such as high delay and low bandwidth is not feasible. In this paper, we propose Adaptive mobility of Courier nodes in Threshold-optimized Depth-based routing (AMCTD), exploring the proficient amendments in depth threshold and implementing the optimal weight function to achieve longer network lifetime. We segregate our scheme in 3 major phases of weight updating, depth threshold variation and adaptive mobility of courier nodes. During data forwarding, we provide the framework for alterations in threshold to cope with the sparse condition of network. We ultimately perform detailed simulations to scrutinize the performance of our proposed scheme and its comparison with other two notable routing protocols in term of network lifetime and other essential parameters. The simulations results verify that our scheme performs better than the other techniques and near to optimal in the field of UWSN.Comment: 8th International Conference on Broadband and Wireless Computing, Communication and Applications (BWCCA'13), Compiegne, Franc

On the selection of connectivity-based metrics for WSNs using a classification of application behaviour

This paper addresses a subset of Wireless Sensor Network (WSN) applications in which data is produced by a set of resource-constrained source nodes and forwarded to one or more sink nodes. The performance of such applications is affected by the connectivity of the WSN, since nodes must remain connected in order to transfer data from sources to sinks. Designers use metrics to measure and improve the efficacy of WSN applications. We aim to facilitate the choice of connectivity-based metrics by introducing a classification of WSN applications based on their data collection behaviour and indicating the metrics best suited to the evaluation of particular application classes. We argue that no suitable metric currently exists for a significant class of applications with the following characteristics: 1) application data is periodically routed or disseminated from source nodes to one or more sink nodes, and 2) the application can continue to function with the loss of source nodes although its useful network lifetime diminishes as a result. We present a new metric, known as Connectivity Weighted Transfer, which may be used to evaluate WSN applications with these characteristics.Preprin

Mathematical Models and Algorithms for Network Flow Problems Arising in Wireless Sensor Network Applications

We examine multiple variations on two classical network flow problems, the maximum flow and minimum-cost flow problems. These two problems are well-studied within the optimization community, and many models and algorithms have been presented for their solution. Due to the unique characteristics of the problems we consider, existing approaches cannot be directly applied. The problem variations we examine commonly arise in wireless sensor network (WSN) applications. A WSN consists of a set of sensors and collection sinks that gather and analyze environmental conditions. In addition to providing a taxonomy of relevant literature, we present mathematical programming models and algorithms for solving such problems. First, we consider a variation of the maximum flow problem having node-capacity restrictions. As an alternative to solving a single linear programming (LP) model, we present two alternative solution techniques. The first iteratively solves two smaller auxiliary LP models, and the second is a heuristic approach that avoids solving any LP. We also examine a variation of the maximum flow problem having semicontinuous restrictions that requires the flow, if positive, on any path to be greater than or equal to a minimum threshold. To avoid solving a mixed-integer programming (MIP) model, we present a branch-and-price algorithm that significantly improves the computational time required to solve the problem. Finally, we study two dynamic network flow problems that arise in wireless sensor networks under non-simultaneous flow assumptions. We first consider a dynamic maximum flow problem that requires an arc to transmit a minimum amount of flow each time it begins transmission. We present an MIP for solving this problem along with a heuristic algorithm for its solution. Additionally, we study a dynamic minimum-cost flow problem, in which an additional cost is incurred each time an arc begins transmission. In addition to an MIP, we present an exact algorithm that iteratively solves a relaxed version of the MIP until an optimal solution is found

Routing Protocols for Underwater Acoustic Sensor Networks: A Survey from an Application Perspective

Underwater acoustic communications are different from terrestrial radio communications; acoustic channel is asymmetric and has large and variable end‐to‐end propagation delays, distance‐dependent limited bandwidth, high bit error rates, and multi‐path fading. Besides, nodes’ mobility and limited battery power also cause problems for networking protocol design. Among them, routing in underwater acoustic networks is a challenging task, and many protocols have been proposed. In this chapter, we first classify the routing protocols according to application scenarios, which are classified according to the number of sinks that an underwater acoustic sensor network (UASN) may use, namely single‐sink, multi‐sink, and no‐sink. We review some typical routing strategies proposed for these application scenarios, such as cross‐layer and reinforcement learning as well as opportunistic routing. Finally, some remaining key issues are highlighted

A survey of network lifetime maximization techniques in wireless sensor networks

Emerging technologies, such as the Internet of things, smart applications, smart grids and machine-to-machine networks stimulate the deployment of autonomous, selfconfiguring, large-scale wireless sensor networks (WSNs). Efficient energy utilization is crucially important in order to maintain a fully operational network for the longest period of time possible. Therefore, network lifetime (NL) maximization techniques have attracted a lot of research attention owing to their importance in terms of extending the flawless operation of battery-constrained WSNs. In this paper, we review the recent developments in WSNs, including their applications, design constraints and lifetime estimation models. Commencing with the portrayal of rich variety definitions of NL design objective used for WSNs, the family of NL maximization techniques is introduced and some design guidelines with examples are provided to show the potential improvements of the different design criteri

Data Collection Method for Mobile Sensor Networks Based on the Theory of Thermal Fields

Many sensor applications are aimed for mobile objects, where conventional routing approaches of data delivery might fail. Such applications are habitat monitoring, human probes or vehicular sensing systems. This paper targets such applications and proposes lightweight proactive distributed data collection scheme for Mobile Sensor Networks (MSN) based on the theory of thermal fields. By proper mapping, we create distribution function which allows considering characteristics of a sensor node. We show the functionality of our proposed forwarding method when adapted to the energy of sensor node. We also propose enhancement in order to maximize lifetime of the sensor nodes. We thoroughly evaluate proposed solution and discuss the tradeoffs