Showing papers on "Zone Routing Protocol published in 2012"

A survey on routing protocols in Wireless Sensor Networks

Abstract: This paper presents a survey of state-of-the-art routing techniques in Wireless Sensor Networks (WSNs). Compared with traditional wireless networks, WSNs are characterized with denser levels of node deployment, higher unreliability of sensor nodes and severe power, computation and memory constraints. Various design challenges such as energy efficiency, data delivery models, quality of service, overheads etc., for routing protocols in WSNs are highlighted. We addressed most of the proposed routing methods along with scheme designs, benefits and result analysis wherever possible. The routing protocols discussed are classified into seven categories such as Data centric routing, Hierarchical routing, Location based routing, Negotiation based routing, Multipath based routing, Quality of Service (QoS) routing and Mobility based routing. This paper also compares the routing protocols against parameters such as power consumption, scalability, mobility, optimal routing and data aggregation. The paper concludes with possible open research issues in WSNs.

Probabilistic Routing Protocol for Intermittently Connected Networks

Abstract: This document is a product of the Delay Tolerant Networking Research Group and has been reviewed by that group. No objections to its publication as an RFC were raised. This document defines PRoPHET, a Probabilistic Routing Protocol using History of Encounters and Transitivity. PRoPHET is a variant of the epidemic routing protocol for intermittently connected networks that operates by pruning the epidemic distribution tree to minimize resource usage while still attempting to achieve the best-case routing capabilities of epidemic routing. It is intended for use in sparse mesh networks where there is no guarantee that a fully connected path between the source and destination exists at any time, rendering traditional routing protocols unable to deliver messages between hosts. These networks are examples of networks where there is a disparity between the latency requirements of applications and the capabilities of the underlying network (networks often referred to as delay and disruption tolerant). The document presents an architectural overview followed by the protocol specification.

Multipath Routing in Wireless Sensor Networks: Survey and Research Challenges

Abstract: A wireless sensor network is a large collection of sensor nodes with limited power supply and constrained computational capability. Due to the restricted communication range and high density of sensor nodes, packet forwarding in sensor networks is usually performed through multi-hop data transmission. Therefore, routing in wireless sensor networks has been considered an important field of research over the past decade. Nowadays, multipath routing approach is widely used in wireless sensor networks to improve network performance through efficient utilization of available network resources. Accordingly, the main aim of this survey is to present the concept of the multipath routing approach and its fundamental challenges, as well as the basic motivations for utilizing this technique in wireless sensor networks. In addition, we present a comprehensive taxonomy on the existing multipath routing protocols, which are especially designed for wireless sensor networks. We highlight the primary motivation behind the development of each protocol category and explain the operation of different protocols in detail, with emphasis on their advantages and disadvantages. Furthermore, this paper compares and summarizes the state-of-the-art multipath routing techniques from the network application point of view. Finally, we identify open issues for further research in the development of multipath routing protocols for wireless sensor networks.

A new evolutionary based routing protocol for clustered heterogeneous wireless sensor networks

Abstract: Wireless sensor network (WSN) is a rapidly evolving technological platform with tremendous and novel applications. Recent advances in WSN have led to many new protocols specifically designed for them where energy awareness (i.e. long lived wireless network) 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. As routing approach with hierarchical structure is realized to successfully provide energy efficient solution, various heuristic clustering algorithms have been proposed. As an attractive WSN routing protocol, LEACH has been widely accepted for its energy efficiency and simplicity. Also, the discipline of meta-heuristics Evolutionary Algorithms (EAs) has been utilized by several researchers to tackle cluster-based routing problem in WSN. These biologically inspired routing mechanisms, e.g., HCR, have proved beneficial in prolonging the WSN lifetime, but unfortunately at the expense of decreasing the stability period of WSN. This is most probably due to the abstract modeling of the EA's clustering fitness function. The aim of this paper is to alleviate the undesirable behavior of the EA when dealing with clustered routing problem in WSN by formulating a new fitness function that incorporates two clustering aspects, viz. cohesion and separation error. Simulation over 20 random heterogeneous WSNs shows that our evolutionary based clustered routing protocol (ERP) always prolongs the network lifetime, preserves more energy as compared to the results obtained using the current heuristics such as LEACH, SEP, and HCR protocols. Additionally, we found that ERP outperforms LEACH and HCR in prolonging the stability period, comparable to SEP performance for heterogeneous networks with 10% extra heterogeneity but requires further heterogeneous-aware modification in the presence of 20% of node heterogeneity.

A cluster-based routing protocol for wireless sensor networks with nonuniform node distribution

Abstract: Due to the nonuniform node distribution, the energy consumption among nodes are more imbalanced in cluster-based wireless sensor networks. Based on this problem, in this paper, a cluster-based routing protocol for wireless sensor networks with nonuniform node distribution is proposed, which includes an energy-aware clustering algorithm EADC and a cluster-based routing algorithm. EADC uses competition range to construct clusters of even sizes. At the same time, the routing algorithm increases forwarding tasks of the nodes in scarcely covered areas by forcing cluster heads to choose nodes with higher energy and fewer member nodes as their next hops, and finally, achieves load balance among cluster heads. Theoretical analysis and simulation results show that our protocol can balance the energy consumption among nodes and increase the network lifetime significantly.

Low power, low delay: opportunistic routing meets duty cycling

Abstract: Traditionally, routing in wireless sensor networks consists of two steps: First, the routing protocol selects a next hop, and, second, the MAC protocol waits for the intended destination to wake up and receive the data. This design makes it difficult to adapt to link dynamics and introduces delays while waiting for the next hop to wake up. In this paper we introduce ORW, a practical opportunistic routing scheme for wireless sensor networks. In a duty-cycled setting, packets are addressed to sets of potential receivers and forwarded by the neighbor that wakes up first and successfully receives the packet. This reduces delay and energy consumption by utilizing all neighbors as potential forwarders. Furthermore, this increases resilience to wireless link dynamics by exploiting spatial diversity. Our results show that ORW reduces radio duty-cycles on average by 50% (up to 90% on individual nodes) and delays by 30% to 90% when compared to the state of the art.

Exploiting Friendship Relations for Efficient Routing in Mobile Social Networks

Abstract: Routing in delay tolerant networks is a challenging problem due to the intermittent connectivity between nodes resulting in the frequent absence of end-to-end path for any source-destination pair at any given time. Recently, this problem has attracted a great deal of interest and several approaches have been proposed. Since Mobile Social Networks (MSNs) are increasingly popular type of Delay Tolerant Networks (DTNs), making accurate analysis of social network properties of these networks is essential for designing efficient routing protocols. In this paper, we introduce a new metric that detects the quality of friendships between nodes accurately. Utilizing this metric, we define the community of each node as the set of nodes having close friendship relations with this node either directly or indirectly. We also present Friendship-Based Routing in which periodically differentiated friendship relations are used in forwarding of messages. Extensive simulations on both real and synthetic traces show that the introduced algorithm is more efficient than the existing algorithms.

A General Self-Organization Tree-Based Energy-Balance routing protocol for wireless sensor network

Abstract: Wireless sensor network (WSN) is a system composed of a large number of low-cost micro-sensors. This network is used to collect and send various kinds of messages to a base station (BS). WSN consists of low-cost nodes with limited battery power, and the battery replacement is not easy for WSN with thousands of physically embedded nodes, which means energy efficient routing protocol should be employed to offer a long-life work time. To achieve the aim, we need not only to minimize total energy consumption but also to balance WSN load. Researchers have proposed many protocols such as LEACH, HEED, PEGASIS, TBC and PEDAP. In this paper, we propose a General Self-Organized Tree-Based Energy-Balance routing protocol (GSTEB) which builds a routing tree using a process where, for each round, BS assigns a root node and broadcasts this selection to all sensor nodes. Subsequently, each node selects its parent by considering only itself and its neighbors' information, thus making GSTEB a dynamic protocol. Simulation results show that GSTEB has a better performance than other protocols in balancing energy consumption, thus prolonging the lifetime of WSN.

Intelligent OLSR Routing Protocol Optimization for VANETs

Abstract: Recent advances in wireless technologies have given rise to the emergence of vehicular ad hoc networks (VANETs). In such networks, the limited coverage of WiFi and the high mobility of the nodes generate frequent topology changes and network fragmentations. For these reasons, and taking into account that there is no central manager entity, routing packets through the network is a challenging task. Therefore, offering an efficient routing strategy is crucial to the deployment of VANETs. This paper deals with the optimal parameter setting of the optimized link state routing (OLSR), which is a well-known mobile ad hoc network routing protocol, by defining an optimization problem. This way, a series of representative metaheuristic algorithms (particle swarm optimization, differential evolution, genetic algorithm, and simulated annealing) are studied in this paper to find automatically optimal configurations of this routing protocol. In addition, a set of realistic VANET scenarios (based in the city of Malaga) have been defined to accurately evaluate the performance of the network under our automatic OLSR. In the experiments, our tuned OLSR configurations result in better quality of service (QoS) than the standard request for comments (RFC 3626), as well as several human experts, making it amenable for utilization in VANET configurations.

CodePipe: An opportunistic feeding and routing protocol for reliable multicast with pipelined network coding

Abstract: Multicast is an important mechanism in modern wireless networks and has attracted significant efforts to improve its performance with different metrics including throughput, delay, energy efficiency, etc. Traditionally, an ideal loss-free channel model is widely used to facilitate routing protocol design. However, the quality of wireless links would be affected or even jeopardized by many factors like collisions, fading or the noise of environment. In this paper, we propose a reliable multicast protocol, called CodePipe, with advanced performance in terms of energy-efficiency, throughput and fairness in lossy wireless networks. Built upon opportunistic routing and random linear network coding, CodePipe not only simplifies transmission coordination between nodes, but also improves the multicast throughput significantly by exploiting both intra-batch and inter-batch coding opportunities. In particular, four key techniques, namely, LP-based opportunistic routing structure, opportunistic feeding, fast batch moving and inter-batch coding, are proposed to offer substantial improvement in throughput, energy-efficiency and fairness. We evaluate CodePipe on ns2 simulator by comparing with other two state-of-art multicast protocols, MORE and Pacifier. Simulation results show that CodePipe significantly outperforms both of them.

Revisiting routing control platforms with the eyes and muscles of software-defined networking

Abstract: Prior work on centralized Routing Control Platform (RCP) has shown many benefits in flexible routing, enhanced security, and ISP connectivity management tasks. In this paper, we discuss RCPs in the context of OpenFlow/SDN, describing potential use cases and identifying deployment challenges and advantages. We propose a controller-centric hybrid networking model and present the design of the RouteFlow Control Platform (RFCP) along the prototype implementation of an AS-wide abstract BGP routing service.

Improvement of LEACH protocol for WSN

Abstract: In wireless sensor networks, sensor nodes always have a limited power resource. The energy consumed by transferring data from the sensor node to its destination raises as a critical issue in designing reasonable wireless sensor network routing protocols. In this paper we propose a revised cluster routing algorithm named E-LEACH to enhance the hierarchical routing protocol LEACH. In the E-LEACH algorithm, the original way of the selection of the cluster heads is random and the round time for the selection is fixed. In the E-LEACH algorithm, we consider the remnant power of the sensor nodes in order to balance network loads and changes the round time depends on the optimal cluster size. The simulation results show that our proposed protocol increases network lifetime at least by 40% when compared with the LEACH algorithm.

Link-Stability and Energy Aware Routing Protocol in Distributed Wireless Networks

Abstract: Energy awareness for computation and protocol management is becoming a crucial factor in the design of protocols and algorithms. On the other hand, in order to support node mobility, scalable routing strategies have been designed and these protocols try to consider the path duration in order to respect some QoS constraints and to reduce the route discovery procedures. Often energy saving and path duration and stability can be two contrasting efforts and trying to satisfy both of them can be very difficult. In this paper, a novel routing strategy is proposed. This proposed approach tries to account for link stability and for minimum drain rate energy consumption. In order to verify the correctness of the proposed solution a biobjective optimization formulation has been designed and a novel routing protocol called Link-stAbility and Energy aware Routing protocols (LAER) is proposed. This novel routing scheme has been compared with other three protocols: PERRA, GPSR, and E-GPSR. The protocol performance has been evaluated in terms of Data Packet Delivery Ratio, Normalized Control Overhead, Link duration, Nodes lifetime, and Average energy consumption.

Enhancing Real-Time Delivery of Gradient Routing for Industrial Wireless Sensor Networks

Abstract: This paper proposes gradient routing with two-hop information for industrial wireless sensor networks to enhance real-time performance with energy efficiency. Two-hop information routing is adopted from the two-hop velocity-based routing, and the proposed routing algorithm is based on the number of hops to the sink instead of distance. Additionally, an acknowledgment control scheme reduces energy consumption and computational complexity. The simulation results show a reduction in end-to-end delay and enhanced energy efficiency.

Social feature-based multi-path routing in delay tolerant networks

Abstract: Most routing protocols for delay tolerant networks resort to the sufficient state information, including trajectory and contact information, to ensure routing efficiency. However, state information tends to be dynamic and hard to obtain without a global and/or long-term collection process. In this paper, we use the internal social features of each node in the network to perform the routing process. This approach is motivated from several social contact networks, such as the Infocom 2006 trace, where people contact each other more frequently if they have more social features in common. Our approach includes two unique processes: social feature extraction and multi-path routing. In social feature extraction, we use entropy to extract the m most informative social features to create a feature space (F-space): (F 1 , F 2 , …, F m ), where F i corresponds to a feature. The routing method then becomes a hypercube-based feature matching process where the routing process is a step-by-step feature difference resolving process. We offer two special multi-path routing schemes: node-disjoint-based routing and delegation-based routing. Extensive simulations on both real and synthetic traces are conducted in comparison with several existing approaches, including spray-and-wait routing and spray-and-focus routing.

TSEP: Threshold-Sensitive Stable Election Protocol for WSNs

Abstract: Wireless Sensor Networks (WSNs) are expected to find wide applicability and increasing deployment in near future. In this paper, we propose a new protocol, Threshold Sensitive Stable Election Protocol (TSEP), which is reactive protocol using three levels of heterogeneity. Reactive networks, as opposed to proactive networks, respond immediately to changes in relevant parameters of interest. We evaluate performance of our protocol for a simple temperature sensing application and compare results of protocol with some other protocols LEACH, DEEC, SEP, ESEP and TEEN. And from simulation results it is observed that protocol outperforms concerning life time of sensing nodes used.

A New Scalable Hybrid Routing Protocol for VANETs

Abstract: Vehicular ad hoc networks (VANETs) are highly mobile wireless networks that are designed to support vehicular safety, traffic monitoring, and other commercial applications. Within VANETs, vehicle mobility will cause the communication links between vehicles to frequently be broken. Such link failures require a direct response from the routing protocols, leading to a potentially excessive increase in the routing overhead and degradation in network scalability. In this paper, we propose a new hybrid location-based routing protocol that is particularly designed to address this issue. Our new protocol combines features of reactive routing with location-based geographic routing in a manner that efficiently uses all the location information available. The protocol is designed to gracefully exit to reactive routing as the location information degrades. We show through analysis and simulation that our protocol is scalable and has an optimal overhead, even in the presence of high location errors. Our protocol provides an enhanced yet pragmatic location-enabled solution that can be deployed in all VANET-type environments.

Spectrum-Aware Opportunistic Routing in Multi-Hop Cognitive Radio Networks

Abstract: In this paper, cognitive routing coupled with spectrum sensing and sharing in a multi-channel multi-hop cognitive radio network (CRN) is investigated. Recognizing the spectrum dynamics in CRN, we propose an opportunistic cognitive routing (OCR) protocol that allows users to exploit the geographic location information and discover the local spectrum access opportunities to improve the transmission performance over each hop. Specifically, based on location information and channel usage statistics, a secondary user (SU) distributedly selects the next hop relay and adapts its transmission to the dynamic spectrum access opportunities in its neighborhood. In addition, we introduce a novel metric, namely, cognitive transport throughput (CTT), to capture the unique properties of CRN and evaluate the potential relay gain of each relay candidate. A heuristic algorithm is proposed to reduce the searching complexity of the optimal selection of channel and relay. Simulation results are given to demonstrate that our proposed OCR well adapts to the spectrum dynamics and outperforms existing routing protocols in CRN.

Light-weight trust-based routing protocol for mobile ad hoc networks

Abstract: Mobile ad hoc networks (MANETs) were originally designed for a cooperative environment. To use them in hostile environments, trust-based routing can be used, where instead of establishing the shortest routes as done in traditional routing protocols, most trusted routes are established. In this study, the authors present a light-weight trust-based routing protocol. It is light-weight in the sense that the intrusion detection system (IDS) used for estimating the trust that one node has for another, consumes limited computational resource. Moreover, it uses only local information thereby ensuring scalability. Our light-weight IDS takes care of two kinds of attacks, namely, the blackhole attack and the grey hole attack. Whereas our proposed approach can be incorporated in any routing protocol, the authors have used AODV as the base routing protocol to evaluate our proposed approach and give a performance analysis.

Automatic routing using multiple prefix labels

Abstract: We present Multi-label Automatic Routing (MAR), the first compact routing protocol that attains a low path stretch (ratio of selected path length to the optimal path length) while maintaining a low routing state for mobile networks. MAR is resilient to node movements in the network. In MAR, nodes assign themselves labels based on their location in the network through a distributed algorithm. Distributed Hash Tables (DHTs) for the node to label mappings are established in some anchor nodes. Once the labels are established, the routing is automatic based on the positional labels of the nodes and DHT lookups. This eliminates flooding completely. Unlike traditional routing protocols MAR does not need destinations-based routing tables. Hence, MAR has a small routing state. With the use of multiple labels per node, the average path length is close to the shortest path and there are multiple paths between source and destination nodes. In Qualnet simulations MAR shows a path stretch close to or better than traditional table-driven and on-demand protocols like OLSR and AODV. Simulation results also show shorter end-to-end delays due to the automatic routing. The delivery ratio of MAR is comparable to these traditional protocols but with a significantly lower network overhead.

Exploiting prediction to enable Secure and Reliable routing in Wireless Body Area Networks

Abstract: In this paper, we propose a distributed Prediction-based Secure and Reliable routing framework (PSR) for emerging Wireless Body Area Networks (WBANs). It can be integrated with a specific routing protocol to improve the latter's reliability and prevent data injection attacks during data communication. In PSR, using past link quality measurements, each node predicts the quality of every incidental link, and thus any change in the neighbor set as well, for the immediate future. When there are multiple possible next hops for packet forwarding (according to the routing protocol used), PSR selects the one with the highest predicted link quality among them. Specially-tailored lightweight source and data authentication methods are employed by nodes to secure data communication. Further, each node adaptively enables or disables source authentication according to predicted neighbor set change and prediction accuracy so as to quickly filter false source authentication requests. We demonstrate that PSR significantly increases routing reliability and effectively resists data injection attacks through in-depth security analysis and extensive simulation study.

Outsourcing the routing control logic: better internet routing based on SDN principles

Abstract: Inter-domain routing is based on a fully decentralized model, where multiple Autonomous Systems (AS) interact via the BGP protocol. Although BGP is the "glue" of the Internet, it faces a lot of problems regarding its fully distributed nature, policy enforcement capabilities, scalability, security and complexity. Due to the widespread adoption of BGP, only incrementally deployable solutions are feasible. Taking this observation into account, we describe a new, backwards-compatible routing model which is based on outsourcing and logically centralizing the routing control plane. We claim that outsourcing enables enhanced inter-domain routing. As multiple ASes outsource their routing control plane to the same outsourcing service contractor, AS clusters are being gradually formed. A logically centralized multi-AS routing control platform based on Software Defined Networking (SDN) principles is the natural point for taking efficient routing decisions, detecting policy conflicts, troubleshooting routing problems, and evolving BGP. We present the technical and financial incentives which support the feasibility of the model and also propose an implementation scheme to facilitate it.

Mobility Enhanced RPL for Wireless Sensor Networks

Abstract: In this paper, we investigate the problem of supporting mobility over RPL (IPv6 Routing Protocol for Low power and Lossy Networks) when applied to route traffic in Wireless Sensor Networks (WSNs). RPL is a routing protocol adapted for information routing with low power, low storage and processing sensor devices, in static topologies commonly found in WSNs, but which is not directly designed for mobile scenarios. Specifically, RPL actively decreases control traffic, at the price of lower reactivity to topology changes. In this paper, we propose to introduce some new mechanisms to the native RPL that reconcile decrease in control traffic and reactivity. They are based on an identification of mobile nodes, and furthermore they enhance RPL behavior in case of node mobility. Our approach will be, henceforth, called ME-RPL (Mobility Enhanced RPL).

Reactive routing for mobile cognitive radio ad hoc networks

Abstract: Although more than a decade has passed from the proposal of the Cognitive Radio paradigm, in these years the research has mainly focused on physical and medium access issues, and few recent works focused on the problem of routing in cognitive networks. This paper addresses such a problem by evaluating the feasibility of reactive routing for mobile cognitive radio ad hoc networks. More specifically, we design a reactive routing protocol for the considered scenario able to achieve three goals: (i) to avoid interferences to primary users during both route formation and data forwarding; (ii) to perform a joint path and channel selection at each forwarder; (iii) to take advantage of the availability of multiple channels to improve the overall performance. Two different versions of the same protocol, referred to as Cognitive Ad-hoc On-demand Distance Vector (CAODV), are presented. The first version exploits inter-route spectrum diversity, while the second one exploits intra-route spectrum diversity. An exhaustive performance analysis of both the versions of the proposed protocol in different environments and network conditions has been carried out via numerical simulations. The results state the suitability of the proposed protocol for small mobile cognitive radio ad hoc networks.

Survey of Extended LEACH-Based Clustering Routing Protocols for Wireless Sensor Networks

Abstract: An energy efficient routing protocol is the major concern in Wireless Sensor Networks (WSNs). In this survey paper, we present energy efficient hierarchical routing protocols, developed from conventional LEACH routing protocol. Main focus of our study is how these extended protocols work in order to increase the life time and how quality routing protocol are improved for WSNs. Furthermore, this paper also highlights some of the issues faced by LEACH and also explains how these issues are tackled by extended versions of LEACH. We compare the features and performance issues of the selected hierarchical routing protocols.

CATT: potential based routing with content caching for ICN

Abstract: Information Centric Networking (ICN) has shown possibilities to solve several problems of the Internet. At the same time, some problems need to be tackled in order to advance this promising architecture. In this paper we address two of the problems, namely routing and content caching. For the routing, we introduce the Potential Based Routing (PBR) to achieve several design goals such as availability, adaptability, diversity, and robustness. In addition, we examine the performance of a random caching policy which can be a promising candidate for ICN. The integrated system of both PBR and a caching policy is named the Cache Aware Target idenTification (CATT). Simulation results demonstrate that PBR with replications located on less than 1% of total nodes can achieve a near optimal routing performance (close to the shortest path routing) even though a request message is randomly forwarded.