51
|
Li N, Martínez JF, Meneses Chaus JM, Eckert M. A Survey on Underwater Acoustic Sensor Network Routing Protocols. SENSORS 2016; 16:s16030414. [PMID: 27011193 PMCID: PMC4813989 DOI: 10.3390/s16030414] [Citation(s) in RCA: 122] [Impact Index Per Article: 15.3] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 02/04/2016] [Revised: 03/16/2016] [Accepted: 03/16/2016] [Indexed: 11/25/2022]
Abstract
Underwater acoustic sensor networks (UASNs) have become more and more important in ocean exploration applications, such as ocean monitoring, pollution detection, ocean resource management, underwater device maintenance, etc. In underwater acoustic sensor networks, since the routing protocol guarantees reliable and effective data transmission from the source node to the destination node, routing protocol design is an attractive topic for researchers. There are many routing algorithms have been proposed in recent years. To present the current state of development of UASN routing protocols, we review herein the UASN routing protocol designs reported in recent years. In this paper, all the routing protocols have been classified into different groups according to their characteristics and routing algorithms, such as the non-cross-layer design routing protocol, the traditional cross-layer design routing protocol, and the intelligent algorithm based routing protocol. This is also the first paper that introduces intelligent algorithm-based UASN routing protocols. In addition, in this paper, we investigate the development trends of UASN routing protocols, which can provide researchers with clear and direct insights for further research.
Collapse
|
52
|
Ghoreyshi SM, Shahrabi A, Boutaleb T. A Novel Cooperative Opportunistic Routing Scheme for Underwater Sensor Networks. SENSORS 2016; 16:297. [PMID: 26927118 PMCID: PMC4813872 DOI: 10.3390/s16030297] [Citation(s) in RCA: 67] [Impact Index Per Article: 8.4] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 12/15/2015] [Revised: 02/01/2016] [Accepted: 02/22/2016] [Indexed: 11/16/2022]
Abstract
Increasing attention has recently been devoted to underwater sensor networks (UWSNs) because of their capabilities in the ocean monitoring and resource discovery. UWSNs are faced with different challenges, the most notable of which is perhaps how to efficiently deliver packets taking into account all of the constraints of the available acoustic communication channel. The opportunistic routing provides a reliable solution with the aid of intermediate nodes’ collaboration to relay a packet toward the destination. In this paper, we propose a new routing protocol, called opportunistic void avoidance routing (OVAR), to address the void problem and also the energy-reliability trade-off in the forwarding set selection. OVAR takes advantage of distributed beaconing, constructs the adjacency graph at each hop and selects a forwarding set that holds the best trade-off between reliability and energy efficiency. The unique features of OVAR in selecting the candidate nodes in the vicinity of each other leads to the resolution of the hidden node problem. OVAR is also able to select the forwarding set in any direction from the sender, which increases its flexibility to bypass any kind of void area with the minimum deviation from the optimal path. The results of our extensive simulation study show that OVAR outperforms other protocols in terms of the packet delivery ratio, energy consumption, end-to-end delay, hop count and traversed distance.
Collapse
|
53
|
Mobility-Enhanced Reliable Geographical Forwarding in Cognitive Radio Sensor Networks. SENSORS 2016; 16:172. [PMID: 26840312 PMCID: PMC4801550 DOI: 10.3390/s16020172] [Citation(s) in RCA: 6] [Impact Index Per Article: 0.8] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 11/11/2015] [Revised: 12/12/2015] [Accepted: 01/21/2016] [Indexed: 11/16/2022]
Abstract
The emergence of the Internet of Things and the proliferation of mobile wireless devices has brought the area of mobile cognitive radio sensor networks (MCRSN) to the research spot light. Notwithstanding the potentials of CRSNs in terms of opportunistic channel usage for bursty traffic, the effect of the mobility of resource-constrained nodes to route stability, mobility-induced spatio-temporal spectral opportunities and primary user (PU) protection still remain open issues that need to be jointly addressed. To this effect, this paper proposes a mobile reliable geographical forwarding routing (MROR) protocol. MROR provides a robust mobile framework for geographical forwarding that is based on a mobility-induced channel availability model. It presents a comprehensive routing strategy that considers PU activity (to take care of routes that have to be built through PU coverage), PU signal protection (by the introduction of a mobility-induced guard (mguard) distance) and the random mobility-induced spatio-temporal spectrum opportunities (for enhancement of throughput). It also addresses the issue of frequent route maintenance that arises when speeds of the mobile nodes are considered as a routing metric. As a result, simulation has shown the ability of MROR to reduce the route failure rate by about 65% as against other schemes. In addition, further results show that MROR can improve both the throughput and goodput at the sink in an energy-efficient manner that is required in CRSNs as against compared works.
Collapse
|
54
|
A Deadline-Aware Scheduling and Forwarding Scheme in Wireless Sensor Networks. SENSORS 2016; 16:s16010059. [PMID: 26742046 PMCID: PMC4732092 DOI: 10.3390/s16010059] [Citation(s) in RCA: 10] [Impact Index Per Article: 1.3] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 11/08/2015] [Revised: 12/14/2015] [Accepted: 12/17/2015] [Indexed: 11/23/2022]
Abstract
Many applications in wireless sensor networks (WSNs) require energy consumption to be minimized and the data delivered to the sink within a specific delay. A usual solution for reducing energy consumption is duty cycling, in which nodes periodically switch between sleep and active states. By increasing the duty cycle interval, consumed energy can be reduced more. However, a large duty cycle interval causes a long end-to-end (E2E) packet delay. As a result, the requirement of a specific delay bound for packet delivery may not be satisfied. In this paper, we aim at maximizing the duty cycle while still guaranteeing that the packets arrive at the sink with the required probability, i.e., the required delay-constrained success ratio (DCSR) is achieved. In order to meet this objective, we propose a novel scheduling and forwarding scheme, namely the deadline-aware scheduling and forwarding (DASF) algorithm. In DASF, the E2E delay distribution with the given network model and parameters is estimated in order to determine the maximum duty cycle interval, with which the required DCSR is satisfied. Each node independently selects a wake-up time using the selected interval, and packets are forwarded to a node in the potential forwarding set, which is determined based on the distance between nodes and the sink. DASF does not require time synchronization between nodes, and a node does not need to maintain neighboring node information in advance. Simulation results show that the proposed scheme can satisfy a required delay-constrained success ratio and outperforms existing algorithms in terms of E2E delay and DCSR.
Collapse
|
55
|
Javaid N, Ilyas N, Ahmad A, Alrajeh N, Qasim U, Khan ZA, Liaqat T, Khan MI. An Efficient Data-Gathering Routing Protocol for Underwater Wireless Sensor Networks. SENSORS 2015; 15:29149-81. [PMID: 26593924 PMCID: PMC4701325 DOI: 10.3390/s151129149] [Citation(s) in RCA: 46] [Impact Index Per Article: 5.1] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 07/15/2015] [Revised: 11/01/2015] [Accepted: 11/11/2015] [Indexed: 11/16/2022]
Abstract
Most applications of underwater wireless sensor networks (UWSNs) demand reliable data delivery over a longer period in an efficient and timely manner. However, the harsh and unpredictable underwater environment makes routing more challenging as compared to terrestrial WSNs. Most of the existing schemes deploy mobile sensors or a mobile sink (MS) to maximize data gathering. However, the relatively high deployment cost prevents their usage in most applications. Thus, this paper presents an autonomous underwater vehicle (AUV)-aided efficient data-gathering (AEDG) routing protocol for reliable data delivery in UWSNs. To prolong the network lifetime, AEDG employs an AUV for data collection from gateways and uses a shortest path tree (SPT) algorithm while associating sensor nodes with the gateways. The AEDG protocol also limits the number of associated nodes with the gateway nodes to minimize the network energy consumption and to prevent the gateways from overloading. Moreover, gateways are rotated with the passage of time to balance the energy consumption of the network. To prevent data loss, AEDG allows dynamic data collection at the AUV depending on the limited number of member nodes that are associated with each gateway. We also develop a sub-optimal elliptical trajectory of AUV by using a connected dominating set (CDS) to further facilitate network throughput maximization. The performance of the AEDG is validated via simulations, which demonstrate the effectiveness of AEDG in comparison to two existing UWSN routing protocols in terms of the selected performance metrics.
Collapse
|
56
|
Sundararajan TVP, Sumithra MG, Maheswar R. A novel Smart Routing Protocol for remote health monitoring in Medical Wireless Networks. JOURNAL OF HEALTHCARE ENGINEERING 2014; 5:95-121. [PMID: 24691389 DOI: 10.1260/2040-2295.5.1.95] [Citation(s) in RCA: 9] [Impact Index Per Article: 0.9] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 11/03/2022]
Abstract
In a Medical Wireless Network (MWN), sensors constantly monitor patient's physiological condition and movement. Inter-MWN communications are set up between the Patient Server and one or more Centralized Coordinators. However, MWNs require protocols with little energy consumption and the self-organizing attribute perceived in ad-hoc networks. The proposed Smart Routing Protocol (SRP) selects only the nodes with a higher residual energy and lower traffic density for routing. This approach enhances cooperation among the nodes of a Mobile Ad Hoc Network. Consequently, SRP produces better results than the existing protocols, namely Conditional Min-Max Battery Cost Routing, Min-Max Battery Cost Routing and AdHoc On-demand Distance Vector in terms of network parameters. The performance of the erstwhile schemes for routing protocols is evaluated using the network simulator Qualnet v 4.5.
Collapse
|
57
|
Oey CHW, Moh S. A survey on temperature-aware routing protocols in wireless body sensor networks. SENSORS 2013; 13:9860-77. [PMID: 23917259 PMCID: PMC3812583 DOI: 10.3390/s130809860] [Citation(s) in RCA: 34] [Impact Index Per Article: 3.1] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 05/28/2013] [Revised: 07/24/2013] [Accepted: 07/24/2013] [Indexed: 11/17/2022]
Abstract
The rapid growth of the elderly population in the world and the rising cost of healthcare impose big issues for healthcare and medical monitoring. A Wireless Body Sensor Network (WBSN) is comprised of small sensor nodes attached inside, on or around a human body, the main purpose of which is to monitor the functions and surroundings of the human body. However, the heat generated by the node's circuitry and antenna could cause damage to the human tissue. Therefore, in designing a routing protocol for WBSNs, it is important to reduce the heat by incorporating temperature into the routing metric. The main contribution of this paper is to survey existing temperature-aware routing protocols that have been proposed for WBSNs. In this paper, we present a brief overview of WBSNs, review the existing routing protocols comparatively and discuss challenging open issues in the design of routing protocols.
Collapse
|
58
|
Kojić N, Reljin I, Reljin B. A neural networks-based hybrid routing protocol for wireless mesh networks. SENSORS 2012; 12:7548-75. [PMID: 22969360 PMCID: PMC3435989 DOI: 10.3390/s120607548] [Citation(s) in RCA: 12] [Impact Index Per Article: 1.0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 03/13/2012] [Revised: 05/28/2012] [Accepted: 05/29/2012] [Indexed: 11/22/2022]
Abstract
The networking infrastructure of wireless mesh networks (WMNs) is decentralized and relatively simple, but they can display reliable functioning performance while having good redundancy. WMNs provide Internet access for fixed and mobile wireless devices. Both in urban and rural areas they provide users with high-bandwidth networks over a specific coverage area. The main problems affecting these networks are changes in network topology and link quality. In order to provide regular functioning, the routing protocol has the main influence in WMN implementations. In this paper we suggest a new routing protocol for WMN, based on good results of a proactive and reactive routing protocol, and for that reason it can be classified as a hybrid routing protocol. The proposed solution should avoid flooding and creating the new routing metric. We suggest the use of artificial logic—i.e., neural networks (NNs). This protocol is based on mobile agent technologies controlled by a Hopfield neural network. In addition to this, our new routing metric is based on multicriteria optimization in order to minimize delay and blocking probability (rejected packets or their retransmission). The routing protocol observes real network parameters and real network environments. As a result of artificial logic intelligence, the proposed routing protocol should maximize usage of network resources and optimize network performance.
Collapse
|
59
|
A secure cluster-based multipath routing protocol for WMSNs. SENSORS 2011; 11:4401-24. [PMID: 22163854 PMCID: PMC3231315 DOI: 10.3390/s110404401] [Citation(s) in RCA: 23] [Impact Index Per Article: 1.8] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 02/09/2011] [Revised: 04/08/2011] [Accepted: 04/11/2011] [Indexed: 11/17/2022]
Abstract
The new characteristics of Wireless Multimedia Sensor Network (WMSN) and its design issues brought by handling different traffic classes of multimedia content (video streams, audio, and still images) as well as scalar data over the network, make the proposed routing protocols for typical WSNs not directly applicable for WMSNs. Handling real-time multimedia data requires both energy efficiency and QoS assurance in order to ensure efficient utility of different capabilities of sensor resources and correct delivery of collected information. In this paper, we propose a Secure Cluster-based Multipath Routing protocol for WMSNs, SCMR, to satisfy the requirements of delivering different data types and support high data rate multimedia traffic. SCMR exploits the hierarchical structure of powerful cluster heads and the optimized multiple paths to support timeliness and reliable high data rate multimedia communication with minimum energy dissipation. Also, we present a light-weight distributed security mechanism of key management in order to secure the communication between sensor nodes and protect the network against different types of attacks. Performance evaluation from simulation results demonstrates a significant performance improvement comparing with existing protocols (which do not even provide any kind of security feature) in terms of average end-to-end delay, network throughput, packet delivery ratio, and energy consumption.
Collapse
|
60
|
Li C, Zhang H, Hao B, Li J. A survey on routing protocols for large-scale wireless sensor networks. SENSORS 2011; 11:3498-526. [PMID: 22163808 PMCID: PMC3231341 DOI: 10.3390/s110403498] [Citation(s) in RCA: 98] [Impact Index Per Article: 7.5] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 02/14/2011] [Revised: 03/05/2011] [Accepted: 03/18/2011] [Indexed: 11/16/2022]
Abstract
With the advances in micro-electronics, wireless sensor devices have been made much smaller and more integrated, and large-scale wireless sensor networks (WSNs) based the cooperation among the significant amount of nodes have become a hot topic. “Large-scale” means mainly large area or high density of a network. Accordingly the routing protocols must scale well to the network scope extension and node density increases. A sensor node is normally energy-limited and cannot be recharged, and thus its energy consumption has a quite significant effect on the scalability of the protocol. To the best of our knowledge, currently the mainstream methods to solve the energy problem in large-scale WSNs are the hierarchical routing protocols. In a hierarchical routing protocol, all the nodes are divided into several groups with different assignment levels. The nodes within the high level are responsible for data aggregation and management work, and the low level nodes for sensing their surroundings and collecting information. The hierarchical routing protocols are proved to be more energy-efficient than flat ones in which all the nodes play the same role, especially in terms of the data aggregation and the flooding of the control packets. With focus on the hierarchical structure, in this paper we provide an insight into routing protocols designed specifically for large-scale WSNs. According to the different objectives, the protocols are generally classified based on different criteria such as control overhead reduction, energy consumption mitigation and energy balance. In order to gain a comprehensive understanding of each protocol, we highlight their innovative ideas, describe the underlying principles in detail and analyze their advantages and disadvantages. Moreover a comparison of each routing protocol is conducted to demonstrate the differences between the protocols in terms of message complexity, memory requirements, localization, data aggregation, clustering manner and other metrics. Finally some open issues in routing protocol design in large-scale wireless sensor networks and conclusions are proposed.
Collapse
|
61
|
Feng Y, Liu M, Wang X, Gong H. Minimum expected delay-based routing protocol (MEDR) for Delay Tolerant Mobile Sensor Networks. SENSORS (BASEL, SWITZERLAND) 2010; 10:8348-8362. [PMID: 22163658 PMCID: PMC3231207 DOI: 10.3390/s100908348] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Track Full Text] [Figures] [Subscribe] [Scholar Register] [Received: 07/20/2010] [Revised: 08/10/2010] [Accepted: 08/20/2010] [Indexed: 05/31/2023]
Abstract
It is a challenging work to develop efficient routing protocols for Delay Tolerant Mobile Sensor Networks (DTMSNs), which have several unique characteristics such as sensor mobility, intermittent connectivity, energy limit, and delay tolerability. In this paper, we propose a new routing protocol called Minimum Expected Delay-based Routing (MEDR) tailored for DTMSNs. MEDR achieves a good routing performance by finding and using the connected paths formed dynamically by mobile sensors. In MEDR, each sensor maintains two important parameters: Minimum Expected Delay (MED) and its expiration time. According to MED, messages will be delivered to the sensor that has at least a connected path with their hosting nodes, and has the shortest expected delay to communication directly with the sink node. Because of the changing network topology, the path is fragile and volatile, so we use the expiration time of MED to indicate the valid time of the path, and avoid wrong transmissions. Simulation results show that the proposed MEDR achieves a higher message delivery ratio with lower transmission overhead and data delivery delay than other DTMSN routing approaches.
Collapse
|
62
|
Wu G, Lin C, Xia F, Yao L, Zhang H, Liu B. Dynamical jumping real-time fault-tolerant routing protocol for wireless sensor networks. SENSORS 2010; 10:2416-37. [PMID: 22294933 PMCID: PMC3264486 DOI: 10.3390/s100302416] [Citation(s) in RCA: 18] [Impact Index Per Article: 1.3] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 01/26/2010] [Revised: 03/03/2010] [Accepted: 03/10/2010] [Indexed: 11/18/2022]
Abstract
In time-critical wireless sensor network (WSN) applications, a high degree of reliability is commonly required. A dynamical jumping real-time fault-tolerant routing protocol (DMRF) is proposed in this paper. Each node utilizes the remaining transmission time of the data packets and the state of the forwarding candidate node set to dynamically choose the next hop. Once node failure, network congestion or void region occurs, the transmission mode will switch to jumping transmission mode, which can reduce the transmission time delay, guaranteeing the data packets to be sent to the destination node within the specified time limit. By using feedback mechanism, each node dynamically adjusts the jumping probabilities to increase the ratio of successful transmission. Simulation results show that DMRF can not only efficiently reduce the effects of failure nodes, congestion and void region, but also yield higher ratio of successful transmission, smaller transmission delay and reduced number of control packets.
Collapse
|
63
|
Routing protocols in wireless sensor networks. SENSORS 2009; 9:8399-421. [PMID: 22291515 PMCID: PMC3260592 DOI: 10.3390/s91108399] [Citation(s) in RCA: 114] [Impact Index Per Article: 7.6] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 09/14/2009] [Revised: 09/28/2009] [Accepted: 10/10/2009] [Indexed: 11/17/2022]
Abstract
The applications of wireless sensor networks comprise a wide variety of scenarios. In most of them, the network is composed of a significant number of nodes deployed in an extensive area in which not all nodes are directly connected. Then, the data exchange is supported by multihop communications. Routing protocols are in charge of discovering and maintaining the routes in the network. However, the appropriateness of a particular routing protocol mainly depends on the capabilities of the nodes and on the application requirements. This paper presents a review of the main routing protocols proposed for wireless sensor networks. Additionally, the paper includes the efforts carried out by Spanish universities on developing optimization techniques in the area of routing protocols for wireless sensor networks.
Collapse
|
64
|
Moya JM, Vallejo JC, Fraga D, Araujo Á, Villanueva D, de Goyeneche JM. Using reputation systems and non-deterministic routing to secure wireless sensor networks. SENSORS 2009; 9:3958-80. [PMID: 22412345 PMCID: PMC3297150 DOI: 10.3390/s90503958] [Citation(s) in RCA: 13] [Impact Index Per Article: 0.9] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 04/09/2009] [Revised: 05/04/2009] [Accepted: 05/19/2009] [Indexed: 11/16/2022]
Abstract
Security in wireless sensor networks is difficult to achieve because of the resource limitations of the sensor nodes. We propose a trust-based decision framework for wireless sensor networks coupled with a non-deterministic routing protocol. Both provide a mechanism to effectively detect and confine common attacks, and, unlike previous approaches, allow bad reputation feedback to the network. This approach has been extensively simulated, obtaining good results, even for unrealistically complex attack scenarios.
Collapse
|