Optimum energy efficient multi-hop protocol for homogenous and heterogeneous 3D underwater acoustic sensor networks

Information transmission is extremely challenging in underwater acoustic sensor networks (UASNs) because, in the acoustic channel, the packet loss is high compared to other channels due to low bandwidth and a long propagation delay. So, designing an efficient energy algorithm is a big challenge in the acoustic channel. In this paper, first, a cluster head (CH) election fitness function based on a hybrid particle swarm optimization and gravitational search algorithm (PSO-GSA) is proposed for a three-dimensional (3D) underwater sensor network (UASN). The proposed algorithm includes CH election, CH load, and neighbor CH distance for multi-hop transmission (MH-PSOGSA). Then, based on the proposed algorithm, a relay-based traffic-aware energy-efficient routing protocol (R-TAEERP) with a weight function is proposed to offload the heavy consumption of the CHs. MATLAB simulations were accomplished to compare the performance of MH-PSOGSA and R-TAEERP with the existing representative protocols. The heterogeneity in energy and traffic has been considered. The simulation results show better performance of the proposed algorithm than other existing representative protocols in terms of energy consumption, the performance of the stable region, and the lifetime of the network.     

LRP: Link quality‐aware queue‐based spectral clustering routing protocol for underwater acoustic sensor networks

Recently, underwater acoustic sensor networks (UASNs) have been considered as a promising approach for monitoring and exploring the oceans in lieu of traditional underwater wireline instruments. As a result, a broad range of applications exists ranging from oil industry to aquaculture and includes oceanographic data collection, disaster prevention, offshore exploration, assisted navigation, tactical surveillance, and pollution monitoring. However, the unique characteristics of underwater acoustic communication channels, such as high bit error rate, limited bandwidth, and variable delay, lead to a large number of packet drops, low throughput, and significant waste of energy because of packets retransmission in these applications. Hence, designing an efficient and reliable data communication protocol between sensor nodes and the sink is crucial for successful data transmission in underwater applications. Accordingly, this paper is intended to introduce a novel nature‐inspired evolutionary link quality‐aware queue‐based spectral clustering routing protocol for UASN‐based underwater applications. Because of its distributed nature, link quality‐aware queue‐based spectral clustering routing protocol successfully distributes network data traffic load evenly in harsh underwater environments and avoids hotspot problems that occur near the sink. In addition, because of its double check mechanism for signal to noise ratio and Euclidean distance, it adopts opportunistically and provides reliable dynamic cluster‐based routing architecture in the entire network. To sum up, the proposed approach successfully finds the best forwarding relay node for data transmission and avoids path loops and packet losses in both sparse and densely deployed UASNs. Our experimental results obtained in a set of extensive simulation studies verify that the proposed protocol performs better than the existing routing protocols in terms of data delivery ratio, overall network throughput, end‐to‐end delay, and energy efficiency.     

Performance optimization of duty‐cycled MAC in delay‐energy constrained sensor network under uniform and nonuniform traffic generation

Duty‐cycle at the media access control (MAC) layer plays a key role in energy savings and network lifetime extension. It consists in putting a node's radio in the sleep state as soon as it has no communication activity. Traditional wireless sensor network MAC protocols are designed with short duty‐cycles at the cost of long delays. Careful design is required for joint energy‐delay constrained applications, where the optimal parameters should be thoroughly derived. The present paper deals with this issue and mathematically derives optimal values of key MAC parameters under low data rate applications for 3 well‐known duty‐cycled MAC protocols, WiseMAC, SCP‐MAC, and LMAC as representatives of 3 MAC protocol categories, respectively, preamble‐sampling, slotted contention‐based, and frame‐based. The analysis provides also the optimum traffic sampling rate that guarantees the minimum energy consumption. It shows the role of these parameters in achieving the targeted end‐to‐end delay constraints under network models with uniform traffic generation, for ring and grid topologies. As a second contribution, the model is extended to nonuniform traffic scenarios, where a certain percentage of deployed nodes are relays whose role is to balance traffic forwarding and save the overall network energy. The results reveal that different optimal internal MAC parameters and traffic generation rates can be found for different configurations of relay nodes deployment, which achieve minimal network energy consumption while satisfying the application required end‐to‐end delay threshold.     

A delay‐centric parallel multi‐path routing protocol for cognitive radio ad hoc networks

In this paper, we develop a delay‐centric parallel multi‐path routing protocol for multi‐hop cognitive radio ad hoc networks. First, we analyze the end‐to‐end delay of multi‐path routing based on queueing theory and present a new dynamic traffic assignment scheme for multi‐path routing with the objective of minimizing end‐to‐end delay, considering both spectrum availability and link data rate. The problem is formulated as a convex problem and solved by a gradient‐based search method to obtain optimal traffic assignments. Furthermore, a heuristic decentralized traffic assignment scheme for multi‐path routing is presented. Then, based on the delay analysis and the 3D conflict graph that captures spectrum opportunity and interference among paths, we present a route discovery and selection scheme. Via extensive NS2‐based simulation, we show that the proposed protocol outperforms the benchmark protocols significantly and achieves the shortest end‐to‐end delay. Copyright © 2015 John Wiley & Sons, Ltd.     

Distributed Routing Based on Minimum End‐to‐End Delay for OFDMA Backhaul Mobile Mesh Networks

In this paper, an orthogonal frequency division multiple access (OFDMA)‐based minimum end‐to‐end delay (MED) distributed routing scheme for mobile backhaul wireless mesh networks is proposed. The proposed scheme selects routing paths based on OFDMA subcarrier synchronization control, subcarrier availability, and delay. In the proposed scheme, OFDMA is used to transmit frames between mesh routers using type‐I hybrid automatic repeat request over multipath Rayleigh fading channels. Compared with other distributed routing algorithms, such as most forward within radius R, farthest neighbor routing, nearest neighbor routing, and nearest with forwarding progress, simulation results show that the proposed MED routing can reduce end‐to‐end delay and support highly reliable routing using only local information of neighbor nodes.     

A novel QoS routing protocol for LEO and MEO satellite networks

The rapid advance of communication and satellite technology pushes broadband satellite networks to carry on multimedia traffic. However, the function of onboard routing cannot be provided in existing satellite networks with inter‐satellite links, and quality of service (QoS) of satellite networks cannot be reliably guaranteed because of great difficulties in processing of long distance‐dependent traffic. In this paper, a two‐layered low‐Earth orbit and medium‐Earth orbit satellite network (LMSN) is presented. A novel hierarchical and distributed QoS routing protocol (HDRP) is investigated, and an adaptive bandwidth‐constrained minimum‐delay path algorithm is developed to calculate routing tables efficiently using the QoS metric information composed of delays and bandwidth. The performance of LMSN and HDRP is also evaluated through simulations and theoretical analysis. Copyright © 2007 John Wiley & Sons, Ltd.     

A new delay‐constrained algorithm for multicast routing tree construction

New multimedia applications provide guaranteed end‐to‐end quality of service (QoS) and have stringent constraints on delay, delay‐jitter, bandwidth, cost, etc. The main task of QoS routing is to find a route in the network, with sufficient resources to satisfy the constraints. Most multicast routing algorithms are not fast enough for large‐scale networks and where the source node uses global cost information to construct a multicast tree. We propose a fast and simple heuristic algorithm (EPDT) for delay‐constrained routing problem for multicast tree construction. This algorithm uses a greedy strategy based on shortest‐path and minimal spanning trees. It combines the minimum cost and the minimum radius objectives by combining respectively optimal Prim's and Dijkstra's algorithms. It biases routes through destinations. Besides, it uses cost information only from neighbouring nodes as it proceeds, which makes it more practical, from an implementation point of view. Copyright © 2004 John Wiley & Sons, Ltd.     

Delay constraint multipath routing for wireless multimedia ad hoc networks

According to the disadvantages of real time and continuity for multimedia services in ad hoc networks, a delay constraint multipath routing protocol for wireless multimedia ad hoc networks, which can satisfy quality of service (QoS) requirement (QoS multipath optimized link state routing [MOLSR]), is proposed. The protocol firstly detects and analyzes the link delay among the nodes and collects the delay information as the routing metric by HELLO message and topology control message. Then, through using the improved multipath Dijkstra algorithm for path selection, the protocol can gain the minimum delay path from the source node to the other nodes. Finally, when the route is launched, several node‐disjoint or link‐disjoint multipaths will be built through the route computation. The simulation and test results show that QoS‐MOLSR is suitable for large and dense networks with heavy traffic. It can improve the real time and reliability for multimedia transmission in wireless multimedia ad hoc networks. The average end‐to‐end delay of QoS‐MOLSR is four times less than the optimized link state routing. Copyright © 2014 John Wiley & Sons, Ltd.     

Joint load balanced stable routing and communication segment assignment in mobile cognitive radio ad‐hoc networks

The fundamental issues in mobile cognitive radio ad‐hoc networks are the selection of the optimal stable paths between nodes and proper assignment of the frequency channels/time slots (communication segments) to the links. In this paper, a joint load balanced stable routing and communication segment assignment algorithm is proposed that considers jointly the mobility prediction, mitigating the co‐channel interference and energy consumption. The novelty of the proposed algorithm lies in the increasing of the path stability, which benefits from the maximum link lifetime parameter and introduced weighting function to keep routes away from the PU's region. This avoids the negative impacts on the PUs' operations and decreases the conflict of the cognitive nodes. In the proposed algorithm, the concept of load balancing is considered that yields in the balancing energy consumption in the network, improving the network performance and distributing traffic loads on all available channels. The effectiveness of the proposed algorithm is verified by evaluating the aggregate interference energy, average end‐to‐end delay, goodput, and the energy usage per packet under 6 scenarios. The results show that the performance of the proposed algorithm is significantly better than the recently proposed joint stable routing and channel assignment protocol.     

Maximum Lifetime Routing Problem in Duty-Cycling Sensor Networks

In order to extend the lifetime of a wireless sensor network, the energy consumption of individual sensor nodes need to be minimized. This can be achieved by minimizing the idle listening time with duty cycling mechanism and/or minimizing the number of communications per node. The nodes will have different relay loads for different routing strategies: therefore, the routing problem is important factor in minimization of the number of communications per node. In this paper, we investigate achievable network lifetime with a routing mechanism on top of an existing duty-cycling scheme. To this end, we formulated the routing problem for duty-cycling sensor network as a linear programming problem with the objective of maximizing the network lifetime. Using the developed linear programming formulation, we investigate the relationship between network lifetime and duty-cycling parameter for different data generation rates and determine the minimum duty-cycling parameter that meets the application requirements. To the best of our knowledge, this is the first mathematical programming formulation which addresses the maximum lifetime routing problem in duty-cycling sensor network. In order to illustrate the application of the analytical model, we solved the problem for different parameter settings.     

Queue‐based multiple path load balancing routing protocol for MANETs

Congestion in the network is the main cause for packet drop and increased end‐to‐end transmission delay of packet between source and destination nodes. Congestion occurs because of the simultaneous contention for network resources. It is very important to efficiently utilize the available resources so that a load can be distributed efficiently throughout the network. Otherwise, the resources of heavily loaded nodes may be depleted very soon, which ultimately affects network performances. In this paper, we have proposed a new routing protocol named queue‐based multiple path load balancing routing protocol. This protocol discovers several node‐disjoint paths from source to destination nodes. It also finds minimum queue length with respect to individual paths, sorts the node‐disjoint paths based on queue length, and distributes the packets through these paths based on the minimum queue length. Simulation results show that the proposed routing protocol distributes the load efficiently and achieves better network performances in terms of packet delivery ratio, end‐to‐end delay, and routing overhead. Copyright © 2016 John Wiley & Sons, Ltd.     

Improved multicast routing in MANETs using link stability and route stability

The growing popularity of multimedia applications and services needs to support several quality of service metrics such as high throughput, low energy, and jitter, which is a challenging task in mobile ad hoc networks. Because of limited bandwidth, energy constraints, dynamic topology, transmission errors, and fluctuating link stability, the links between adjacent nodes are often not reliable and may break because of node mobility. Link breakage initiates the process of rerouting either at the sender node (the node at which the link breaks) or at the source node. In either case, it leads to packet loss, delivery delays, and increased control overheads. Hence, to attain a minimum quality of service, routing protocols must address the dynamic network topology. Uncertain and varying movement of nodes necessitates stability of the links between such nodes. The objective of this paper is to propose 2 protocols, the first based on link stability and the other based on route stability. Link stability identifies a stable link from the available links to the next hop and determines a stable end‐to‐end route. The probability of successful transmission of periodic packets is used as a link stability metric to assess the stable path. Acknowledgment ‐free packets are used to check connectivity in the network. Increased probability of successful transmission implies that the selected link is sustained for longer duration and can deliver packets more reliably or, as a consequence, results in a stable link to deliver a better data rate. With a stable link, there is a reduced possibility of retransmissions, reduced end‐to‐end delay, reduced control overheads, and enhanced data delivery ratio. Selection of the most stable route for data transmission improves the performance. Experimental results from simulations performed on EXata/Cyber v2.0 simulator reveal that our proposed protocols are an improvement over the existing protocols in terms of packet delivery ratio, average end‐to‐end delay, and average route lifetime, even without route optimization with the minor increase in control packets. A case study of the application of proposed protocols is also presented.     

DRP: An energy‐efficient routing protocol for underwater sensor networks

The features of transmissions in underwater sensor networks (UWSNs) include lower transmission rate, longer delay time, and higher power consumption when compared with terrestrial radio transmissions. The negative effects of transmission collisions deteriorate in such environments. Existing UWSN routing protocols do not consider the transmission collision probability differences resulting from different transmission distances. In this paper, we show that collision probability plays an important role in route selection and propose an energy‐efficient routing protocol (DRP), which considers the distance‐varied collision probability as well as each node's residual energy. Considering these 2 issues, DRP can find a path with high successful transmission rate and high‐residual energy. In fact, DRP can find the path producing the longest network lifetime, which we have confirmed through theoretical analysis. To the best of our knowledge, DRP is the first UWSN routing protocol that uses transmission collision probability as a factor in route selection. Simulation results verify that DRP extends network lifetime, increases network throughput, and reduces end‐to‐end delay when compared with solutions without considering distance‐varied collision probability or residual energy.     

Beacon‐based routing protocols for underwater acoustic sensor networks

Underwater Acoustic Sensor Networks (UW‐ASN) are provisioned with limited bandwidth, long variable propagation delay, limited available energy, highly unreliable acoustic channels, and random node mobility. Consequently, efficient data routing between source destination pair requires UW‐ASN to apply a technology different than terrestrial networks. For the past few years researchers have proposed many robust and efficient routing protocols for UW‐ASN, thus reviewing the challenges posed by stringent underwater environment. These protocols can be broadly categorized into localization based and localization‐free protocols. This paper presents a critical review of beacon‐based localization‐free routing protocols and suggest possible solution to improve the working of studied beacon based protocols. This work categorizes beacon based protocols into hop‐by‐hop, end‐to‐end, single, and multiple parameters based forwarding protocols. This categorization will help to differentiate and identify the requirements for the development of new beacon‐based protocols. Finally, this paper presents performance comparison based on simulation results and outlines the research gap and future directions.     

A simple void node and loop‐free three‐dimensional routing protocol for multi‐hop wireless networks

Wireless networks are now very essential part for modern ubiquitous communication systems. The design of efficient routing and scheduling techniques for such networks have gained importance to ensure reliable communication. Most of the currently proposed geographic routing protocols are designed for 2D spatial distribution of user nodes, although in many practical scenarios user nodes may be deployed in 3D space also. In this paper, we propose 3D routing protocols for multihop wireless networks that may be implemented in two different ways depending on how the routing paths are computed. When the routing paths to different user nodes from the base station in the wireless network are computed by the base station, we call it centralized protocol (3DMA‐CS). A distributed routing (3DMA‐DS) protocol is implemented when respective routing path of each user node to the base station is computed by the user node. In both of these protocols, the user (base station) selects the relay node to forward packets in the direction of destination, from the set of its neighbours, which makes minimum angle with the reference line drawn from user (base station) to the base station (user), within its transmission range. The proposed protocols are free from looping problem and can solve the void node problem (VNP) of multihop wireless networks. Performance analysis of the proposed protocol is shown by calculating end‐to‐end throughput, average path length, end‐to‐end delay, and energy consumption of each routing path through extensive simulation under different network densities and transmission ranges.     

On-call processing delay in high speed networks

In future BISDN networks, significant burdens will be placed on the processing elements in the network since call routing and admission policies will be more computationally intensive than those in present day networks. Thus, the bottleneck in future networks is likely to shift from the communication links to the processing elements. The delays at these elements are influenced by their processing capacity and factors such as; routing algorithms, propagation delays, admission control functions, and network topology. The goal of this paper is to characterize the behavior of these factors on the call setup time and accepted call throughput. This behavior is examined for three sequential routing schemes and two flooding routing schemes under various network parameters and different forms of admission control. The results of our study indicate that processing capacity and the admission control function can affect the call setup time and accepted call throughput significantly while propagation delay does not affect these performance measures significantly     

基于NS-3的声电协同网络实现及路由性能分析

水下无线通信主要依靠水声通信的方式进行信息传输。但水声链路本身具有高时延和高误码率等不足,为水下应用提供低时延的通信服务是一项具有挑战性的工作。声电协同网(CRAN)旨在充分利用水面无线电链路弥补水声网络(UAN)的性能局限,提升网络的整体性能。其中,CRAN中的路由协议需要构建声、电混合路径,是声电协同网络研究中的关键问题。该文首先在网络模拟器3(NS-3)中设计并实现了声电浮标节点与CRAN协议栈,搭建了CRAN的仿真平台。随后探讨了以无线自组网按需平面距离向量路由协议(AODV)为代表的被动式路由在CRAN中的应用。该文发现,AODV协议使用的距离向量准则在CRAN中能够更多地选择高速的无线电链路进行数据转发,有效地降低了网络传输时延。最后,通过仿真对AODV与其他协议的性能进行了对比、分析。结果表明,CRAN在投递率、传输时延、网络吞吐量、能效和路由响应速度方面对比水声通信网有较大提升。同时,以AODV为代表的被动路由协议,相比于以优化链路状态路由协议(OLSR)为代表的主动路由协议更适用于CRAN。     

Link stability‐aware reliable packet transmitting mechanism in mobile ad hoc network

To guarantee the QoS of multimedia applications in a mobile ad hoc network (MANET), a reliable packet transmitting mechanism in MANET is proposed. In this paper, we introduce an effective link lifetime estimation scheme. According to the current network topology and corresponding estimated link lifetime, the end‐to‐end connection is established adaptively in the best effort manner. Consequently, utilizing the network coding method the relay node combines and forwards the packets on the working path. Furthermore, to keep the balance between the gain in reliability and the amount of redundant packets, the time for sending the redundant packets on the backup path is determined for the link stability intelligently. Simulations show that our mechanisms can provide reliable transmissions for data packets and enhance the performance of the entire network, such as the packet delivery ratio, the end‐to‐end delay and the number of control messages. Copyright © 2011 John Wiley & Sons, Ltd.     

水声传感网MAC协议的研究进展

水声传感网因其广阔的应用领域和巨大的应用潜力,近年来已成为通信领域的研究新热点,MAC协议是水声传感网的重要组成部分.概述水声传感网MAC协议的研究现状,指出水声传感网的MAC协议大体可分为基于非竞争的MAC协议和基于竞争的MAC协议,并对不同类别协议的优缺点进行对比分析.针对现有各种协议在吞吐量、开销、信道利用率以及网络的扩展性等方面均存在优势和不足等,从如何更好地克服水声通信中的传播时延长、可用带宽有限、能量消耗大和移动性大等方面,提出更合理更实用的水声通信MAC协议将是该领域未来的重点研究方向.