Showing papers on "Wireless Routing Protocol published in 2014"
TL;DR: An overview of the different routing strategies used in wireless sensor networks is given and the comparison of these different routing protocols based on metrics such as mobility support, stability, issues and latency is shown.
Abstract: This paper represents energy efficient routing protocols in WSN. It is a collection of sensor nodes with a set of limited Processor and limited memory unit embedded in it. Reliable routing of packets from the sensor node to its base station is the most important task for the networks. The routing protocols applied for the other networks cannot be used here due to its battery powered nodes This paper gives an overview of the different routing strategies used in wireless sensor networks and gives a brief working model of energy efficient routing protocols in WSN. It also shows the comparison of these different routing protocols based on metrics such as mobility support, stability, issues and latency.
579 citations
TL;DR: Experimental results show that FAF-EBRM outperforms LEACH and EEUC, which balances the energy consumption, prolongs the function lifetime and guarantees high QoS of WSN.
Abstract: As an important part of industrial application (IA), the wireless sensor network (WSN) has been an active research area over the past few years. Due to the limited energy and communication ability of sensor nodes, it seems especially important to design a routing protocol for WSNs so that sensing data can be transmitted to the receiver effectively. An energy-balanced routing method based on forward-aware factor (FAF-EBRM) is proposed in this paper. In FAF-EBRM, the next-hop node is selected according to the awareness of link weight and forward energy density. Furthermore, a spontaneous reconstruction mechanism for local topology is designed additionally. In the experiments, FAF-EBRM is compared with LEACH and EEUC, experimental results show that FAF-EBRM outperforms LEACH and EEUC, which balances the energy consumption, prolongs the function lifetime and guarantees high QoS of WSN.
436 citations
TL;DR: This paper surveys the state-of-the-art routing metrics for cognitive radio networks and provides a taxonomy of the different metrics and a survey of the way they have been used in different routing protocols.
Abstract: The majority of work in cognitive radio networks have focused on single-hop networks with mainly challenges at the physical and MAC layers. Recently, multi-hop secondary networks have gained attention as a promising design to leverage the full potential of cognitive radio networks. One of the main features of routing protocols in multi-hop networks is the routing metric used to select the best route for forwarding packets. In this paper, we survey the state-of-the-art routing metrics for cognitive radio networks. We start by listing the challenges that have to be addressed in designing a good routing metric for cognitive radio networks. We then provide a taxonomy of the different metrics and a survey of the way they have been used in different routing protocols. Then we present a case study to compare different classes of metrics. After that, we discuss how to combine individual routing metrics to obtain a global one. We end the paper with a discussion of the open issues in the design of future metrics for cognitive radio networks.
332 citations
TL;DR: A survey of the existing distributed mobile sink routing protocols is presented and a definitive and detailed categorization is made and the protocols' advantages and drawbacks are determined with respect to their target applications.
Abstract: The concentration of data traffic towards the sink in a wireless sensor network causes the nearby nodes to deplete their batteries quicker than other nodes, which leaves the sink stranded and disrupts the sensor data reporting. To mitigate this problem the usage of mobile sinks is proposed. Mobile sinks implicitly provide load-balancing and help achieving uniform energy-consumption across the network. However, the mechanisms to support the sink mobility (e.g., advertising the location of the mobile sink to the network) introduce an overhead in terms of energy consumption and packet delays. With these properties mobile sink routing constitutes an interesting research field with unique requirements. In this paper, we present a survey of the existing distributed mobile sink routing protocols. In order to provide an insight to the rationale and the concerns of a mobile sink routing protocol, design requirements and challenges associated with the problem of mobile sink routing are determined and explained. A definitive and detailed categorization is made and the protocols' advantages and drawbacks are determined with respect to their target applications.
266 citations
TL;DR: This paper provides a detailed description of various existing routing techniques in literature with an aim of selecting a particular strategy depending upon its applicability in a particular application.
260 citations
01 Apr 2014
TL;DR: In this paper, the Optimized Link State Routing Protocol (OLSRv2) for Mobile Ad Hoc Networks (MANETs) has been proposed for MANETs.
Abstract: This specification describes version 2 of the Optimized Link State
Routing Protocol (OLSRv2) for Mobile Ad Hoc Networks (MANETs).
259 citations
TL;DR: In this article, the authors discuss the main characteristics and the research challenge of routing in VANETs, which may be considered in designing various routing protocols, and create taxonomy of the current routing protocols for VANets, and surveyed and compared symbolized instances for all the classes of protocols.
231 citations
TL;DR: A VDTN routing protocol, called GeoSpray, which takes routing decisions based on geographical location data, and combines a hybrid approach between multiple-copy and single-copy schemes, and improves significantly the delivery probability and reduces the delivery delay.
227 citations
01 Dec 2014
TL;DR: Segment Routing is presented, a new network architecture aimed at filling this gap, driven by use-cases defined by network operators, and its related ongoing standardization efforts are described.
Abstract: Network operators anticipate the offering of an increasing variety of cloud-based services with stringent Service Level Agreements. Technologies currently supporting IP networks however lack the flexibility and scalability properties to realize such evolution. In this article, we present Segment Routing (SR), a new network architecture aimed at filling this gap, driven by use-cases defined by network operators. SR implements the source routing and tunneling paradigms, letting nodes steer packets over paths using a sequence of instructions (segments) placed in the packet header. As such, SR allows the implementation of routing policies without per-flow entries at intermediate routers. This paper introduces the SR architecture, describes its related ongoing standardization efforts, and reviews the main use-cases envisioned by network operators.
210 citations
TL;DR: This system can separate abnormal nodes from normal nodes by observing their abnormal behaviors, and it has achieved efficient, rapid intrusion detection by improving the wireless ad hoc on-demand distance vector routing protocol (Ad hoc On-Demand Distance the Vector Routing, AODV).
Abstract: The Internet of Things has broad application in military field, commerce, environmental monitoring, and many other fields. However, the open nature of the information media and the poor deployment environment have brought great risks to the security of wireless sensor networks, seriously restricting the application of wireless sensor network. Internet of Things composed of wireless sensor network faces security threats mainly from Dos attack, replay attack, integrity attack, false routing information attack, and flooding attack. In this paper, we proposed a new intrusion detection system based on -nearest neighbor (-nearest neighbor, referred to as KNN below) classification algorithm in wireless sensor network. This system can separate abnormal nodes from normal nodes by observing their abnormal behaviors, and we analyse parameter selection and error rate of the intrusion detection system. The paper elaborates on the design and implementation of the detection system. This system has achieved efficient, rapid intrusion detection by improving the wireless ad hoc on-demand distance vector routing protocol (Ad hoc On-Demand Distance the Vector Routing, AODV). Finally, the test results show that: the system has high detection accuracy and speed, in accordance with the requirement of wireless sensor network intrusion detection.
204 citations
TL;DR: A dynamic trust management protocol for secure routing optimization in DTN environments in the presence of well-behaved, selfish and malicious nodes is designed and validated and can effectively trade off message overhead and message delay for a significant gain in delivery ratio.
Abstract: Delay tolerant networks (DTNs) are characterized by high end-to-end latency, frequent disconnection, and opportunistic communication over unreliable wireless links. In this paper, we design and validate a dynamic trust management protocol for secure routing optimization in DTN environments in the presence of well-behaved, selfish and malicious nodes. We develop a novel model-based methodology for the analysis of our trust protocol and validate it via extensive simulation. Moreover, we address dynamic trust management, i.e., determining and applying the best operational settings at runtime in response to dynamically changing network conditions to minimize trust bias and to maximize the routing application performance. We perform a comparative analysis of our proposed routing protocol against Bayesian trust-based and non-trust based (PROPHET and epidemic) routing protocols. The results demonstrate that our protocol is able to deal with selfish behaviors and is resilient against trust-related attacks. Furthermore, our trust-based routing protocol can effectively trade off message overhead and message delay for a significant gain in delivery ratio. Our trust-based routing protocol operating under identified best settings outperforms Bayesian trust-based routing and PROPHET, and approaches the ideal performance of epidemic routing in delivery ratio and message delay without incurring high message or protocol maintenance overhead.
TL;DR: A general survey of multicast routing protocols in Mobile adhoc Networks (MANETs) is given, which plays an important role in MANETs to provide group communication.
Abstract: There are many benefits of multicasting using with network. The communication cost reduced by multicasting for applications that sends the same data to many recipients instead of sending via multiple unicast. This paper gives a general survey of multicast routing protocols in Mobile adhoc Networks (MANETs). The multicast routing protocols are divided into two categories- multicast routing based on application independence and multicast routing based on application dependence. Multicast routing protocols plays an important role in MANETs to provide group communication. Multicasting is one of the major communication technologies primarily designed for bandwidth conservation and an efficient way of transferring data to a group of receivers in wireless mesh networks.
TL;DR: This proposed forwarding-function based routing protocol for underwater sensor networks (UWSNs) provides on-demand routing by formulating hard threshold, soft threshold, and prime energy limit, and simulation results verify effectiveness and efficiency of the proposed iAMCTD.
Abstract: We propose forwarding-function (FF) based routing protocol for underwater sensor networks (UWSNs): improved adaptive mobility of courier nodes in threshold-optimized depth-based-routing (iAMCTD). Unlike existing depth-based acoustic protocols, the proposed protocol exploits network density for time-critical applications. In order to tackle flooding, path loss, and propagation latency, we calculate optimal holding time (HT) and use routing metrics: localization-free signal-to-noise ratio (LSNR), signal quality index (SQI), energy cost function (ECF), and depth-dependent function (DDF). Our proposal provides on-demand routing by formulating hard threshold (Hth), soft threshold (Sth), and prime energy limit (Rprime). Simulation results verify effectiveness and efficiency of the proposed iAMCTD.
TL;DR: The results show that DVRP has better performance than other existing delay efficient routing protocols, in term of end-to-end delays, energy consumption, and data delivery ratios.
TL;DR: This work exploits the geographic opportunistic routing (GOR) for QoS provisioning with both end-to-end reliability and delay constraints in WSNs and proposes an Efficient QoS-aware GOR (EQGOR), characterized by the low time complexity.
Abstract: QoS routing is an important research issue in wireless sensor networks (WSNs), especially for mission-critical monitoring and surveillance systems which requires timely and reliable data delivery. Existing work exploits multipath routing to guarantee both reliability and delay QoS constraints in WSNs. However, the multipath routing approach suffers from a significant energy cost. In this work, we exploit the geographic opportunistic routing (GOR) for QoS provisioning with both end-to-end reliability and delay constraints in WSNs. Existing GOR protocols are not efficient for QoS provisioning in WSNs, in terms of the energy efficiency and computation delay at each hop. To improve the efficiency of QoS routing in WSNs, we define the problem of efficient GOR for multiconstrained QoS provisioning in WSNs, which can be formulated as a multiobjective multiconstraint optimization problem. Based on the analysis and observations of different routing metrics in GOR, we then propose an Efficient QoS-aware GOR (EQGOR) protocol for QoS provisioning in WSNs. EQGOR selects and prioritizes the forwarding candidate set in an efficient manner, which is suitable for WSNs in respect of energy efficiency, latency, and time complexity. We comprehensively evaluate EQGOR by comparing it with the multipath routing approach and other baseline protocols through ns-2 simulation and evaluate its time complexity through measurement on the MicaZ node. Evaluation results demonstrate the effectiveness of the GOR approach for QoS provisioning in WSNs. EQGOR significantly improves both the end-to-end energy efficiency and latency, and it is characterized by the low time complexity.
TL;DR: This paper identifies various issues and challenges in pursuit of effective routing in WBSNs and provides a detailed literature review of the various existing routing protocols used in the WBSN domain by discussing their strengths and weaknesses.
Abstract: Wireless Body Sensor Networks (WBSNs) constitute a subset of Wireless Sensor Networks (WSNs) responsible for monitoring vital sign-related data of patients and accordingly route this data towards a sink. In routing sensed data towards sinks, WBSNs face some of the same routing challenges as general WSNs, but the unique requirements of WBSNs impose some more constraints that need to be addressed by the routing mechanisms. This paper identifies various issues and challenges in pursuit of effective routing in WBSNs. Furthermore, it provides a detailed literature review of the various existing routing protocols used in the WBSN domain by discussing their strengths and weaknesses.
10 Jun 2014
TL;DR: This work presents a feasible solution for improving the data packet delivery ratio in mobile UWSN by using the greedy opportunistic forwarding to route packets and to move void nodes to new depths to adjust the topology.
Abstract: Efficient protocols for data packet delivery in mobile underwater sensor networks (UWSNs) are crucial to the effective use of this new powerful technology for monitoring lakes, rivers, seas, and oceans. However, communication in UWSNs is a challenging task because of the characteristics of the acoustic channel. In this work, we present a feasible solution for improving the data packet delivery ratio in mobile UWSN. The GEographic and opportunistic routing with Depth Adjustment-based topology control for communication Recovery (GEDAR) over void regions uses the greedy opportunistic forwarding to route packets and to move void nodes to new depths to adjust the topology. Simulation results shown that GEDAR outperforms the baseline solutions in terms of packet delivery ratio, latency and energy per message.
TL;DR: This article first classify existing protocols based on different design criteria and then presents a survey of the state-of-the-art routing protocols in this area, illustrating how each of the protocols works, and discusses their advantages and disadvantages.
Abstract: Wireless sensor networks with mobile sinks, mWSNs, have attracted a lot of attention recently. This is because sink mobility can greatly alleviate the hotspot issue in WSNs and further prolong the network lifetime. However, sink mobility also causes unexpected changes in network topology and data routing paths, which can largely affect the routing performance in such networks. Design of efficient routing protocols for mWSNs has been a critical issue, and much work has been carried out in this aspect. In this article, we first classify existing protocols based on different design criteria and then present a survey of the state-of-the-art routing protocols in this area. We illustrate how each of the protocols works, and discuss their advantages and disadvantages. Finally, we point out some future directions for efficient routing in mWSNs.
18 Jun 2014
TL;DR: This work proposes Co-RPL as an extension to RPL based on the Corona mechanism to support mobility, and conducts an extensive simulation study using the Contiki/Cooja simulator to demonstrate the effectiveness.
Abstract: Mobility support for wireless sensor networks has always been a challenging research topic. This paper addresses the issue of mobility support in the Routing Protocol for Low power and lossy networks (RPL), the recently adopted IETF routing protocol standard for low power wireless sensor networks. RPL was originally designed for static networks, with no support for mobility. In this work, we address this gap and propose Co-RPL as an extension to RPL based on the Corona mechanism to support mobility. To demonstrate the effectiveness of Co-RPL, we conducted an extensive simulation study using the Contiki/Cooja simulator and compared the performance against standard RPL. We study the impact of node speed, packet transmission rate and number of Directed Acyclic Graphs (DAG) roots on network performance. The simulation results show that Co-RPL decreases packet loss ratio by 45%, average energy consumption by 50% and end-to-end delay by 2.5 seconds, in comparison with the standard RPL.
06 Mar 2014
TL;DR: This paper surveys a number of the recent analysis leads to routing space and presents various existing routing protocols with their merits and demerits.
Abstract: In recent years, rapid growth in the number of vehicles on the road has increased demands for communication on the move. A new kind of Ad hoc network with an immense improvement in technological innovations is emerging these days known as VANET (Vehicular ad hoc network). It is an assortment of vehicular nodes that act as mobile hosts establish a transient network without the assistance of any centralized administration or any established infrastructure. Therefore, it is called autonomous & self configured network. In VANET, two kinds of communication can be done to provide a list of applications like emergency vehicle warning, safety etc. These are between various vehicles known as vehicle to vehicle and between vehicles and roadside units known as vehicle to roadside communication. Performance of such kind of communication between vehicles depends on various routing protocols. We have a tendency to survey a number of the recent analysis leads to routing space. In the following sections we present various existing routing protocols with their merits and demerits.
TL;DR: The classification presented here summarizes the main features of many published proposals in the literature for efficient routing in MWSN and also gives an insight into the enhancements that can be done to improve the existing routing protocols.
Abstract: The Mobile Wireless Sensor Network (MWSN) is an emerging technology with significant applications. The MWSN allows the sensor nodes to move freely and they are able to communicate with each other without the need for a fixed infrastructure. These networks are capable of out-performing static wireless sensor networks as they tend to increase the network lifetime, reduce the power consumption, provide more channel capacity and perform better targeting. Usually routing process in a mobile network is very complex and it becomes even more complicated in MWSN as the sensor nodes are low power, cost effective mobile devices with minimum resources. Recent research works have led to the design of many efficient routing protocols for MWSN but still there are many unresolved problems like retaining the network connectivity, reducing the energy cost, maintaining adequate sensing coverage etc. This paper addresses the various issues in routing and presents the state of the art routing protocols in MWSN. The routing protocols are categorized based on their network structure, state of information, energy efficiency and mobility. The classification presented here summarizes the main features of many published proposals in the literature for efficient routing in MWSN and also gives an insight into the enhancements that can be done to improve the existing routing protocols.
12 May 2014
TL;DR: OF-FL is designed, a novel objective function that combines a set of metrics in order to provide a configurable routing decision based on the fuzzy parameters that can achieve remarkable performance of the RPL-based LLNs in comparison with the existing objective functions.
Abstract: Low power and lossy networks (LLNs) require efficient routing protocols that should meet the requirements of the critical applications, such as real-time, reliability and high availability. RPL has been recently proposed by the ROLL working group as a tree routing protocol specifically designed for LLNs. It relies on objective functions to construct routes that optimize or constrain a routing metric on the paths. However, the working group did not specify the set of metrics and/or constraints to be used to specify the preferred path, and left it open to implementations. In this paper, we design OF-FL, a novel objective function that combines a set of metrics in order to provide a configurable routing decision based on the fuzzy parameters. OF-FL has the advantage to consider the application requirements in order to select the best paths to the destination. Our evaluation with a large-scale testbed in ContikiOS reveals that OF-FL can achieve remarkable performance of the RPL-based LLNs in comparison with the existing objective functions, and appropriately satisfy the quality of service contract of the different applications.
TL;DR: A clustering routing protocol named intra-balanced LEACH (IBLEACH), which extends LEACH protocol by balancing the energy consumption in the network, and results show that IBLEACH outperforms LEACH and the existing improvements of LEACH in terms of network lifetime and energy consumption minimization.
Abstract: Wireless sensor networks (WSNs) are composed of many low cost, low power devices with sensing, local processing and wireless communication capabilities. Recent advances in wireless networks have led to many new protocols specifically designed for WSNs where energy awareness is an essential consideration. Most of the attention, however, has been given to the routing protocols since they might differ depending on the application and network architecture. Minimizing energy dissipation and maximizing network lifetime are important issues in the design of routing protocols for WSNs. In this paper, the low-energy adaptive clustering hierarchy (LEACH) routing protocol is considered and improved. We propose a clustering routing protocol named intra-balanced LEACH (IBLEACH), which extends LEACH protocol by balancing the energy consumption in the network. The simulation results show that IBLEACH outperforms LEACH and the existing improvements of LEACH in terms of network lifetime and energy consumption minimization.
TL;DR: This article introduces ORW, a practical opportunistic routing scheme for wireless sensor networks that uses a novel opportunist routing metric, EDC, that reflects the expected number of duty-cycled wakeups that are required to successfully deliver a packet from source to destination.
Abstract: Opportunistic routing is widely known to have substantially better performance than unicast routing in wireless networks with lossy links. However, wireless sensor networks are usually duty cycled, that is, they frequently enter sleep states to ensure long network lifetime. This renders existing opportunistic routing schemes impractical, as they assume that nodes are always awake and can overhear other transmissions. In this article we introduce ORW, a practical opportunistic routing scheme for wireless sensor networks. ORW uses a novel opportunistic routing metric, EDC, that reflects the expected number of duty-cycled wakeups that are required to successfully deliver a packet from source to destination. We devise distributed algorithms that find the EDC-optimal forwarding and demonstrate using analytical performance models and simulations that EDC-based opportunistic routing results in significantly reduced delay and improved energy efficiency compared to traditional unicast routing. In addition, we evaluate the performance of ORW in both simulations and testbed-based experiments. Our results show that ORW reduces radio duty cycles on average by 50p (up to 90p on individual nodes) and delays by 30p to 90p when compared to the state-of-the-art.
TL;DR: This paper proposes a trust-aware secure routing framework (TSRF) with the characteristics of lightweight and high ability to resist various attacks and shows with the help of simulations that TSRF can achieve both intended security and high efficiency suitable for WSN-based networks.
Abstract: In recent years, trust-aware routing protocol plays a vital role in security of wireless sensor networks (WSNs), which is one of the most popular network technologies for smart city. However, several key issues in conventional trust-aware routing protocols still remain to be solved, such as the compatibility of trust metric with QoS metrics and the control of overhead produced by trust evaluation procedure. This paper proposes a trust-aware secure routing framework (TSRF) with the characteristics of lightweight and high ability to resist various attacks. To meet the security requirements of routing protocols in WSNs, we first analyze features of common attacks on trust-aware routing schemes. Then, specific trust computation and trust derivation schemes are proposed based on analysis results. Finally, our design uses the combination of trust metric and QoS metrics as routing metrics to present an optimized routing algorithm. We show with the help of simulations that TSRF can achieve both intended security and high efficiency suitable for WSN-based networks.
TL;DR: A comprehensive survey of the main networking challenges present in the design of SG communication networks, and some of the important routing protocols proposed to address those challenges are provided.
Abstract: Smart grids (SG) represent the next step in modernizing the current electric grid. In this structure, a communications network is combined with the power grid in order to gather information that can be used to increase the efficiency of the grid, reduce power consumption, and improve the reliability of services, among other numerous advantages. SG communication networks are unique in their large scale and the limited capabilities of nodes which present several challenges in the design of efficient routing protocols. This paper provides a comprehensive survey of the main networking challenges present in the design of SG communication networks, and some of the important routing protocols proposed to address those challenges. Various technologies and architectures proposed for routing in SGs are discussed. A detailed comparison of the protocols considered in this paper is also given, and key areas that require further investigation are highlighted.
TL;DR: A cross-layer design of routing, i.e., of medium access control (MAC) and physical layers, provides efficient multimedia routing in CRSNs, which is revealed through simulation experiments.
Abstract: Multimedia applications are characterized as delay-sensitive and high-bandwidth stipulating traffic sources. Supporting such demanding applications on cognitive radio sensor networks (CRSNs) with energy and spectrum constraints is a highly daunting task. In this paper, we propose a spectrum-aware cluster-based energy-efficient multimedia (SCEEM) routing protocol for CRSNs that jointly overcomes the formidable limitations of energy and spectrum. Clustering is exploited to support the quality of service (QoS) and energy-efficient routing by limiting the participating nodes in route establishment. In SCEEM routing, the number of clusters is optimally determined to minimize the distortion in multimedia quality that occurs due to packet losses and latency. Moreover, the cluster-head selection is based on the energy and relative spectrum awareness such that noncontiguous available spectrum bands are clustered and scheduled to provide continuous transmission opportunity. Routing employs clustering with hybrid medium access by combining carrier-sense multiple access (CSMA) and time-division multiple access (TDMA). TDMA operates for intracluster transmission, whereas CSMA is used for intercluster routing. Thus, a cross-layer design of routing, i.e., of medium access control (MAC) and physical layers, provides efficient multimedia routing in CRSNs, which is revealed through simulation experiments.
TL;DR: This paper presents Reliability Enhanced-Adaptive Threshold based Thermal-unaware Energy-efficient Multi-hop ProTocol (RE-ATTEMPT) for WBASNs, and conducts a comprehensive analysis supported by MATLAB simulations to provide an estimation of path loss.
Abstract: Modern health care system is one of the most popular Wireless Body Area Sensor Network (WBASN) applications and a hot area of research subject to present work. In this paper, we present Reliability Enhanced-Adaptive Threshold based Thermal-unaware Energy-efficient Multi-hop ProTocol (RE-ATTEMPT) for WBASNs. The proposed routing protocol uses fixed deployment of wireless sensors (nodes) such that these are placed according to energy levels. Moreover, we use direct communication for the delivery of emergency data and multihop communication for the delivery of normal data. RE-ATTEMPT selects route with minimum hop count to deliver data which downplays the delay factor. Furthermore, we conduct a comprehensive analysis supported by MATLAB simulations to provide an estimation of path loss, and problem formulation with its solution via linear programming model for network lifetime maximization is also provided. In simulations, we analyze our protocol in terms of network lifetime, packet drops, and throughput. Results show better performance for the proposed protocol as compared to the existing one.
TL;DR: RMECR is able to find energy-efficient and reliable routes similar to RMER, while also extending the operational lifetime of the network, which makes RMECR an elegant solution to increase energy-efficiency, reliability, and lifetime of wireless ad hoc networks.
Abstract: We propose two novel energy-aware routing algorithms for wireless ad hoc networks, called reliable minimum energy cost routing (RMECR) and reliable minimum energy routing (RMER). RMECR addresses three important requirements of ad hoc networks: energy-efficiency, reliability, and prolonging network lifetime. It considers the energy consumption and the remaining battery energy of nodes as well as quality of links to find energy-efficient and reliable routes that increase the operational lifetime of the network. RMER, on the other hand, is an energy-efficient routing algorithm which finds routes minimizing the total energy required for end-to-end packet traversal. RMER and RMECR are proposed for networks in which either hop-by-hop or end-to-end retransmissions ensure reliability. Simulation studies show that RMECR is able to find energy-efficient and reliable routes similar to RMER, while also extending the operational lifetime of the network. This makes RMECR an elegant solution to increase energy-efficiency, reliability, and lifetime of wireless ad hoc networks. In the design of RMECR, we consider minute details such as energy consumed by processing elements of transceivers, limited number of retransmissions allowed per packet, packet sizes, and the impact of acknowledgment packets. This adds to the novelty of this work compared to the existing studies.
TL;DR: The results show that ALBA-R is an energy-efficient protocol that achieves remarkable performance in terms of packet delivery ratio and end-to-end latency in different scenarios, thus being suitable for real network deployments.
Abstract: This paper presents ALBA-R, a protocol for convergecasting in wireless sensor networks. ALBA-R features the cross-layer integration of geographic routing with contention-based MAC for relay selection and load balancing (ALBA), as well as a mechanism to detect and route around connectivity holes (Rainbow). ALBA and Rainbow (ALBA-R) together solve the problem of routing around a dead end without overhead-intensive techniques such as graph planarization and face routing. The protocol is localized and distributed, and adapts efficiently to varying traffic and node deployments. Through extensive ns2-based simulations, we show that ALBA-R significantly outperforms other convergecasting protocols and solutions for dealing with connectivity holes, especially in critical traffic conditions and low-density networks. The performance of ALBA-R is also evaluated through experiments in an outdoor testbed of TinyOS motes. Our results show that ALBA-R is an energy-efficient protocol that achieves remarkable performance in terms of packet delivery ratio and end-to-end latency in different scenarios, thus being suitable for real network deployments.