Showing papers on "Static routing 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.

Distributed logical l3 routing

Abstract: A novel method for logically routing a packet between a source machine that is in a first logical domain and a destination machine that is in a second logical domain is described. The method configures a managed switching element as a second-level managed switching element. The method configures a router in a host that includes the second-level managed switching element. The method communicatively couples the second-level managed switching element with the router. The method causes the router to route a packet when the router receives a packet from the first logical domain that is addressed to the second logical domain.

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 hierarchical clustering and routing procedure for large scale disaster relief logistics planning

Abstract: We describe a hierarchical cluster and route procedure (HOGCR) for coordinating vehicle routing in large-scale post-disaster distribution and evacuation activities. The HOGCR is a multi-level clustering algorithm that groups demand nodes into smaller clusters at each planning level, enabling the optimal solution of cluster routing problems. The routing problems are represented as capacitated network flow models that are solved optimally and independently by CPLEX on a parallel computing platform. The HOGCR preserves the consistency among parent and child cluster solutions obtained at consecutive levels. We assess the performance of the algorithm by using large scale scenarios and find satisfactory results.

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.

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.

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.

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.

The time dependent vehicle routing problem with time windows: Benchmark problems, an efficient solution algorithm, and solution characteristics

Abstract: An algorithm that can tackle time dependent vehicle routing problems with hard or soft time windows without any alteration in its structure is presented. Analytical and experimental results indicate that average computational time increases proportionally to the number of customers squared. New replicable test problems that capture the typical speed variations of congested urban settings are proposed. Solution quality, time window perturbations, and computational time results are discussed as well as a method to study the impact of perturbations by problem type. The algorithm efficiency and simplicity is well suited for urban areas where fast running times may be required.

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.

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.

Approximating Congestion + Dilation in Networks via "Quality of Routing” Games

Abstract: A classic optimization problem in network routing is to minimize C + D, where C is the maximum edge congestion and D is the maximum path length (also known as dilation). The problem of computing the optimal C* + D* is NP-complete even when either C* or D* is a small constant. We study routing games in general networks where each player i selfishly selects a path that minimizes Ci + Di the sum of congestion and dilation of the player's path. We first show that there are instances of this game without Nash equilibria. We then turn to the related quality of routing (QoR) games which always have Nash equilibria. QoR games represent networks with a small number of service classes where paths in different classes do not interfere with each other (with frequency or time division multiplexing). QoR games have O(log4 n) price of anarchy when either C* or D* is a constant. Thus, Nash equilibria of QoR games give poly-log approximations to hard optimization problems.

Collaborative hierarchical caching with dynamic request routing for massive content distribution

Abstract: Massive content delivery in metropolitan networks has recently gained much attention with the successful deployment of commercial systems and an increasing user popularity. With an enormous volume of content available in the network, as well as the growing size of content owing to the popularity of high-definition video, the exploration of capacity in the caching network becomes a critical issue in providing guaranteed service. Yet, collaboration strategies among cache servers in emerging scenarios, such as IPTV services, are still not well understood so far. In this paper, we propose an efficient collaborative caching mechanism based on the topology derived from a real-world IPTV system, with a particular focus on exploring the capacity of the existing system infrastructure. We observe that collaboration among servers is largely affected by the topology characteristics and heterogeneous capacities of the network. Meanwhile, dynamic request routing within the caching network is strongly coupled with content placement decisions when designing the mechanism. Our proposed mechanism is implemented in a distributed manner, and is amenable to practical deployment. Our simulation results demonstrate the effectiveness of our proposed mechanism, as compared to conventional cache cooperation with static routing schemes.

Routing using cached source routes from message headers

Abstract: In one embodiment, an intermediate node of a computer network can receive a message intended for a destination. The message can include a header indicating a source route. The intermediate node can determine a routing entry for a routing entry for the destination associated with a next hop based on the source route and cache the routing entry. The intermediate node can further receive a second message intended for the destination that does not indicate the next hop, and transmit the second message according to the cached routing entry.

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.

System and method for accepting information from routing messages into a list

Abstract: A system and method adds and manages entries on a list of entries of routing information to allow the top entry to be used for routing to a destination corresponding to the list. Costs of a wireless link may be a function of the success rate experienced on that wireless link.

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.

A comparative study between dynamic adapted PSO and VNS for the vehicle routing problem with dynamic requests

Abstract: Combinatorial optimization problems are usually modeled in a static fashion. In this kind of problems, all data are known in advance, i.e. before the optimization process has started. However, in practice, many problems are dynamic, and change while the optimization is in progress. For example, in the dynamic vehicle routing problem (DVRP), new orders arrive when the working day plan is in progress. In this case, routes must be reconfigured dynamically while executing the current simulation. The DVRP is an extension of a conventional routing problem, its main interest being the connection to many real word applications (repair services, courier mail services, dial-a-ride services, etc.). In this article, a DVRP is examined, and solving methods based on particle swarm optimization and variable neighborhood search paradigms are proposed. The performance of both approaches is evaluated using a new set of benchmarks that we introduce here as well as existing benchmarks in the literature. Finally, we measure the behavior of both methods in terms of dynamic adaptation.

Opportunistic routing based on daily routines

Abstract: Opportunistic routing is being investigated to enable the proliferation of low-cost wireless applications. A recent trend is looking at social structures, inferred from the social nature of human mobility, to bring messages close to a destination. To have a better picture of social structures, social-based opportunistic routing solutions should consider the dynamism of users' behavior resulting from their daily routines. We address this challenge by presenting dLife, a routing algorithm able to capture the dynamics of the network represented by time-evolving social ties between pair of nodes. Experimental results based on synthetic mobility models and real human traces show that dLife has better delivery probability, latency, and cost than proposals based on social structures.

An Efficient Prediction-Based Routing in Disruption-Tolerant Networks

Abstract: Routing is one of the most challenging, open problems in disruption-tolerant networks (DTNs) because of the short-lived wireless connectivity environment. To deal with this issue, researchers have investigated routing based on the prediction of future contacts, taking advantage of nodes' mobility history. However, most of the previous work focused on the prediction of whether two nodes would have a contact, without considering the time of the contact. This paper proposes predict and relay (PER), an efficient routing algorithm for DTNs, where nodes determine the probability distribution of future contact times and choose a proper next-hop in order to improve the end-to-end delivery probability. The algorithm is based on two observations: one is that nodes usually move around a set of well-visited landmark points instead of moving randomly; the other is that node mobility behavior is semi-deterministic and could be predicted once there is sufficient mobility history information. Specifically, our approach employs a time-homogeneous semi-Markov process model that describes node mobility as transitions between landmarks. Then, we extend it to handle the scenario where we consider the transition time between two landmarks. A simulation study shows that this approach improves the delivery ratio and also reduces the delivery latency compared to traditional DTN routing schemes.

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.

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.

ESM: efficient and scalable data center multicast routing

Abstract: Multicast benefits group communications in saving network traffic and improving application throughput, both of which are important for data center applications. However, the technical trend of data center design poses new challenges for efficient and scalable multicast routing. First, the densely connected networks make traditional receiver-driven multicast routing protocols inefficient in multicast tree formation. Second, it is quite difficult for the low-end switches widely used in data centers to hold the routing entries of massive multicast groups. In this paper, we propose ESM, an efficient and scalable multicast routing scheme for data center networks. ESM addresses the challenges above by exploiting the feature of modern data center networks. Based on the regular topology of data centers, ESM uses a source-to-receiver expansion approach to build efficient multicast trees, excluding many unnecessary intermediate switches used in receiver-driven multicast routing. For scalable multicast routing, ESM combines both in-packet Bloom Filters and in-switch entries to make the tradeoff between the number of multicast groups supported and the additional bandwidth overhead. Simulations show that ESM saves 40% - 50% network traffic and doubles the application throughputs compared to receiver-driven multicast routing, and the combination routing scheme significantly reduces the number of in-switch entries required. We implement ESM on a Linux platform. The experimental results further demonstrate that ESM can well support online tree building for large-scale groups with churns, and the overhead of the combination forwarding engine is light-weighted.

A Survey and Evaluation of Topology-Agnostic Deterministic Routing Algorithms

Abstract: Most standard cluster interconnect technologies are flexible with respect to network topology. This has spawned a substantial amount of research on topology-agnostic routing algorithms, which make no assumption about the network structure, thus providing the flexibility needed to route on irregular networks. Actually, such an irregularity should be often interpreted as minor modifications of some regular interconnection pattern, such as those induced by faults. In fact, topology-agnostic routing algorithms are also becoming increasingly useful for networks on chip (NoCs), where faults may make the preferred 2D mesh topology irregular. Existing topology-agnostic routing algorithms were developed for varying purposes, giving them different and not always comparable properties. Details are scattered among many papers, each with distinct conditions, making comparison difficult. This paper presents a comprehensive overview of the known topology-agnostic routing algorithms. We classify these algorithms by their most important properties, and evaluate them consistently. This provides significant insight into the algorithms and their appropriateness for different on- and off-chip environments.