Showing papers on "Destination-Sequenced Distance Vector routing published in 2008"

Ad Hoc Networking

Abstract: Ad hoc networks are to computing devices what Yahoo Personals are to single people: both help individuals communicate productively with strangers while maintaining security. Under the rules of ad hoc networking--which continue to evolve--your mobile phone can, when placed in proximity to your handheld address book, establish a little network on its own and enable data sharing between the two devices. In Ad Hoc Networking, Charles Perkins has compiled a series of technical papers about networking on the fly from a variety of laboratories and experts. The collection explains the latest thinking on how mobile devices can best discover, identify, and communicate with other devices in the vicinity. In this treatment, ad hoc networking covers a broad swath of situations. An ad hoc network might consist of several home-computing devices, plus a notebook computer that must exist on home and office networks without extra administrative work. Such a network might also need to exist when the people and equipment in normally unrelated military units need to work together in combat. Though the papers in this book are much more descriptive of protocols and algorithms than of their implementations, they aim individually and collectively at commercialization and popularization of mobile devices that make use of ad hoc networking. You'll enjoy this book if you're involved in researching or implementing ad hoc networking capabilities for mobile devices. --David Wall Topics covered: The state-of-the-art in protocols and algorithms to be used in ad hoc networks of mobile devices that move in and out of proximity to one another, to fixed resources like printers, and to Internet connectivity. Routing with Destination-Sequenced Distance Vector (DSDV), Dynamic Source Routing (DSR), Ad hoc On-Demand Distance Vector (AODV), and other resource-discovery and routing protocols; the effects of ad hoc networking on bandwidth consumption; and battery life.

Efficient routing in intermittently connected mobile networks: the multiple-copy case

Abstract: Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from the source to the destination. There are many real networks that follow this model, for example, wildlife tracking sensor networks, military networks, vehicular ad hoc networks, etc. In this context, conventional routing schemes fail, because they try to establish complete end-to-end paths, before any data is sent. To deal with such networks researchers have suggested to use flooding-based routing schemes. While flooding-based schemes have a high probability of delivery, they waste a lot of energy and suffer from severe contention which can significantly degrade their performance. Furthermore, proposed efforts to reduce the overhead of flooding-based schemes have often been plagued by large delays. With this in mind, we introduce a new family of routing schemes that "spray" a few message copies into the network, and then route each copy independently towards the destination. We show that, if carefully designed, spray routing not only performs significantly fewer transmissions per message, but also has lower average delivery delays than existing schemes; furthermore, it is highly scalable and retains good performance under a large range of scenarios. Finally, we use our theoretical framework proposed in our 2004 paper to analyze the performance of spray routing. We also use this theory to show how to choose the number of copies to be sprayed and how to optimally distribute these copies to relays.

The vehicle routing problem : latest advances and new challenges

Abstract: Overviews and Surveys- Routing a Heterogeneous Fleet of Vehicles- A Decade of Capacitated Arc Routing- Inventory Routing- The Period Vehicle Routing Problem and its Extensions- The Split Delivery Vehicle Routing Problem: A Survey- Challenges and Advances in A Priori Routing- Metaheuristics for the Vehicle Routing Problem and Its Extensions: A Categorized Bibliography- Parallel Solution Methods for Vehicle Routing Problems- Recent Developments in Dynamic Vehicle Routing Systems- New Directions in Modeling and Algorithms- Online Vehicle Routing Problems: A Survey- Modeling and Solving the Capacitated Vehicle Routing Problem on Trees- Using a Genetic Algorithm to Solve the Generalized Orienteering Problem- An Integer Linear Programming Local Search for Capacitated Vehicle Routing Problems- Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems- Recent Models and Algorithms for One-to-One Pickup and Delivery Problems- One-to-Many-to-One Single Vehicle Pickup and Delivery Problems- Challenges and Opportunities in Attended Home Delivery- Chvatal-Gomory Rank-1 Cuts Used in a Dantzig-Wolfe Decomposition of the Vehicle Routing Problem with Time Windows- Vehicle Routing Problems with Inter-Tour Resource Constraints- From Single-Objective to Multi-Objective Vehicle Routing Problems: Motivations, Case Studies, and Methods- Practical Applications- Vehicle Routing for Small Package Delivery and Pickup Services- Advances in Meter Reading: Heuristic Solution of the Close Enough Traveling Salesman Problem over a Street Network- Multiperiod Planning and Routing on a Rolling Horizon for Field Force Optimization Logistics- Health Care Logistics, Emergency Preparedness, and Disaster Relief: New Challenges for Routing Problems with a Focus on the Austrian Situation- Vehicle Routing Problems and Container Terminal Operations - An Update of Research

Contraction hierarchies: faster and simpler hierarchical routing in road networks

Abstract: We present a route planning technique solely based on the concept of node contraction. The nodes are first ordered by 'importance'. A hierarchy is then generated by iteratively contracting the least important node. Contracting a node υ means replacing shortest paths going through v by shortcuts. We obtain a hierarchical query algorithm using bidirectional shortest-path search. The forward search uses only edges leading to more important nodes and the backward search uses only edges coming from more important nodes. For fastest routes in road networks, the graph remains very sparse throughout the contraction process using rather simple heuristics for ordering the nodes. We have five times lower query times than the best previous hierarchical Dijkstra-based speedup techniques and a negative space overhead, i.e., the data structure for distance computation needs less space than the input graph. CHs can be combined with many other route planning techniques, leading to improved performance for many-to-many routing, transit-node routing, goal-directed routing or mobile and dynamic scenarios.

A survey of secure mobile Ad Hoc routing protocols

Abstract: Several routing protocols have been proposed in recent years for possible deployment of mobile ad hoc networks (MANETs) in military, government and commercial applications. In this paper, we review these protocols with a particular focus on security aspects. The protocols differ in terms of routing methodologies and the information used to make routing decisions. Four representative routing protocols are chosen for analysis and evaluation including: Ad Hoc on demand Distance Vector routing (AODV), Dynamic Source Routing (DSR), Optimized Link State Routing (OLSR) and Temporally Ordered Routing Algorithm (TORA). Secure ad hoc networks have to meet five security requirements: confidentiality, integrity, authentication, non-repudiation and availability. The analyses of the secure versions of the proposed protocols are discussed with respect to the above security requirements.

Multiconstrained QoS multipath routing in wireless sensor networks

Abstract: Sensor nodes are densely deployed to accomplish various applications because of the inexpensive cost and small size. Depending on different applications, the traffic in the wireless sensor networks may be mixed with time-sensitive packets and reliability-demanding packets. Therefore, QoS routing is an important issue in wireless sensor networks. Our goal is to provide soft-QoS to different packets as path information is not readily available in wireless networks. In this paper, we utilize the multiple paths between the source and sink pairs for QoS provisioning. Unlike E2E QoS schemes, soft-QoS mapped into links on a path is provided based on local link state information. By the estimation and approximation of path quality, traditional NP-complete QoS problem can be transformed to a modest problem. The idea is to formulate the optimization problem as a probabilistic programming, then based on some approximation technique, we convert it into a deterministic linear programming, which is much easier and convenient to solve. More importantly, the resulting solution is also one to the original probabilistic programming. Simulation results demonstrate the effectiveness of our approach.

Implementation and Analysis of a New Selection Strategy for Adaptive Routing in Networks-on-Chip

Abstract: Efficient and deadlock-free routing is critical to the performance of networks-on-chip. The effectiveness of any adaptive routing algorithm strongly depends on the underlying selection strategy. A selection function is used to select the output channel where the packet will be forwarded on. In this paper we present a novel selection strategy that can be coupled with any adaptive routing algorithm. The proposed selection strategy is based on the concept of Neighbors-on-Path the aims of which is to exploit the situations of indecision occurring when the routing function returns several admissible output channels. The overall objective is to choose the channel that will allow the packet to be routed to its destination along a path that is as free as possible of congested nodes. Performance evaluation is carried out by using a flit-accurate simulator under traffic scenarios generated by both synthetic and real applications. Results obtained show how the proposed selection strategy applied to the Odd-Even routing algorithm yields an improvement in both average delay and saturation point up to 20% and 30% on average respectively, with a minimal overhead in terms of area occupation. In addition, a positive effect on total energy consumption is also observed under near-congestion packet injection rates.

Distributed energy-efficient cooperative routing in wireless networks

Abstract: Recently, the merits of cooperative communication in the physical layer have been explored. However, the impact of cooperative communication on the design of the higher layers has not been well-understood yet. Cooperative routing in wireless networks has gained much interest due to its ability to exploit the broadcast nature of the wireless medium in designing power efficient routing algorithms. Most of the existing cooperation based routing algorithms are implemented by finding a shortest path route first and then improving the route using cooperative communication. As such, these routing algorithms do not fully exploit the merits of cooperative communications, since the optimal cooperative route might not be similar to the shortest path route. In this paper, we propose a cooperation-based routing algorithm, namely, the minimum power cooperative routing (MPCR) algorithm, which makes full use of the cooperative communications while constructing the minimum-power route. The MPCR algorithm constructs the minimum-power route, which guarantees certain throughput, as a cascade of the minimum-power single-relay building blocks from the source to the destination. Thus, any distributed shortest path algorithm can be utilized to find the optimal cooperative route with polynomial complexity. Using analysis, we show that the MPCR algorithm can achieve power saving of 65.61% in regular linear networks and 29.8% in regular grid networks compared to the existing cooperation-based routing algorithms, where the cooperative routes are constructed based on the shortest-path routes. From simulation results, MPCR algorithm can have 37.64% power saving in random networks compared to those cooperation-based routing algorithms.

Optimal routing and data aggregation for maximizing lifetime of wireless sensor networks

Abstract: An optimal routing and data aggregation scheme for wireless sensor networks is proposed in this paper. The objective is to maximize the network lifetime by jointly optimizing data aggregation and routing. We adopt a model to integrate data aggregation with the underlying routing scheme and present a smoothing approximation function for the optimization problem. The necessary and sufficient conditions for achieving the optimality are derived and a distributed gradient algorithm is designed accordingly. We show that the proposed scheme can significantly reduce the data traffic and improve the network lifetime. The distributed algorithm can converge to the optimal value efficiently under all network configurations.

Delay-bounded routing in vehicular ad-hoc networks

Abstract: Ad hoc networks formed by traveling vehicles are envisaged to become a common platform that will support a wide variety of applications, ranging from road safety to advertising and entertainment. The multitude of vehicular applications calls for routing schemes that satisfy user-defined delay requirements while at the same time maintaining a low level of channel utilization to allow their coexistence. This paper focuses on the development of carry-and-forward schemes that attempt to deliver data from vehicles to fixed infrastructure nodes in an urban setting. The proposed algorithms leverage local or global knowledge of traffic statistics to carefully alternate between the Data Muling and Multihop Forwarding strategies, in order to minimize communication overhead while adhering to delay constraints imposed by the application. We provide an extensive evaluation of our schemes using realistic vehicular traces on a real city map.

Spectrum Aware Routing for Multi-Hop Cognitive Radio Networks with a Single Transceiver

Abstract: In multi-hop single transceiver Cognitive Radio networks (MSCRN), routing becomes of great challenge when IEEE 802.11 DCF is used as the MAC protocol. Routing should not base on common control channel because it is not ensured that common control channel can be obtained by each node. In this paper, we propose a spectrum aware on-demand routing which doesn't base on control channel. A channel assignment algorithm aimed at improving link utilization is derived from delay-analysis. The overhead and gain by switching are balanced in this algorithm. For deafness problem caused by switching can result in significant performance degradation, constraints to avoid the appearance of deafness in channel assignment process are given. We stress that our approach can be easily implemented for the using of standard IEEE 802.11DCF. Results of simulation show that, our approach can well fit MSCRN and improve the network throughput comparing to the same network scenario without cognitive ability.

STOD-RP: A Spectrum-Tree Based On-Demand Routing Protocol for Multi-Hop Cognitive Radio Networks

Abstract: A unique challenge for routing in cognitive radio networks is the collaboration between the route selection and spectrum decision. To solve this problem, in this paper a Spectrum-Tree base On-Demand routing protocol (STOD-RP) is proposed where a spectrum-tree is built in each spectrum band. The formation of the spectrum-tree addresses the cooperation between spectrum decision and route selection in an efficient way. In addition, a new route metric is proposed as well as a fast and efficient spectrum-adaptive route recovery method. Simulation results show that our proposed STOD-RP reduces the control overhead and shortens the average end-to-end delay significantly.

Ad hoc networks beyond unit disk graphs

Abstract: In this paper, we study an algorithmic model for wireless ad hoc and sensor networks that aims to be sufficiently close to reality as to represent practical real-world networks while at the same time being concise enough to promote strong theoretical results The quasi unit disk graph model contains all edges shorter than a parameter d between 0 and 1 and no edges longer than 1 We show that--in comparison to the cost known for unit disk graphs--the complexity results of geographic routing in this model contain the additional factor 1/d2 We prove that in quasi unit disk graphs flooding is an asymptotically message-optimal routing technique, we provide a geographic routing algorithm being most efficient in dense networks, and we show that classic geographic routing is possible with the same asymptotic performance guarantees as for unit disk graphs if d ≥ 1/√2

Design Guidelines for Routing Metrics in Multihop Wireless Networks

Abstract: The design of a routing protocol must be based on the characteristics of its target networks. The diversity of wireless networks motivates the design of different routing metrics, capturing different aspects of wireless communications. The design of routing metrics, however, is not arbitrary since it has a great impact on the proper operation of routing protocols. Combining a wrong type of routing metrics with a routing protocol may result in routing loops and suboptimal paths. In this paper, we thoroughly study the relationship between routing metrics and routing protocols. Our work provides important guidelines for designing routing metrics and identifies the specific properties that a routing metric must have in order to be combined with certain type of routing protocols.

Remote Message Routing Device and Methods Thereof

Abstract: A message routing method includes receiving a plurality of messages at a routing node. The routing node is configured to receive instructions indicating an offset, criteria associated with the offset, and a group of interested nodes. The routing node examines a portion of a data payload of a received message based on the offset. If the information at the offset matches the criteria, the routing node routes the message to each of the group of interested nodes. Thus, the routing node can route messages to different groups of destination nodes depending on information in the data payload of received messages, thereby providing a flexible way to route messages over a network.

A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions

Abstract: In this paper, we consider a periodic vehicle routing problem that includes, in addition to the classical constraints, the possibility of a vehicle doing more than one route per day, as long as the maximum daily operation time for the vehicle is not exceeded. In addition, some constraints relating to accessibility of the vehicles to the customers, in the sense that not every vehicle can visit every customer, must be observed. We refer to the problem we consider here as the site-dependent multi-trip periodic vehicle routing problem. An algorithm based on tabu search is presented for the problem and computational results presented on randomly generated test problems that are made publicly available. Our algorithm is also tested on a number of routing problems from the literature that constitute particular cases of the proposed problem. Specifically we consider the periodic vehicle routing problem; the site-dependent vehicle routing problem; the multi-trip vehicle routing problem; and the classical vehicle routing problem. Computational results for our tabu search algorithm on test problems taken from the literature for all of these problems are presented.

Randomized 3D Geographic Routing

Abstract: We reconsider the problem of geographic routing in wireless ad hoc networks. We are interested in local, memoryless routing algorithms, i.e. each network node bases its routing decision solely on its local view of the network, nodes do not store any message state, and the message itself can only carry information about O(1) nodes. In geographic routing schemes, each network node is assumed to know the coordinates of itself and all adjacent nodes, and each message carries the coordinates of its target. Whereas many of the aspects of geographic routing have already been solved for 2D networks, little is known about higher-dimensional networks. It has been shown only recently that there is in fact no local memoryless routing algorithm for 3D networks that delivers messages deterministically. In this paper, we show that a cubic routing stretch constitutes a lower bound for any local memoryless routing algorithm, and propose and analyze several randomized geographic routing algorithms which work well for 3D network topologies. For unit ball graphs, we present a technique to locally capture the surface of holes in the network, which leads to 3D routing algorithms similar to the greedy-face-greedy approach for 2D networks.

Performance Comparison of Wireless Mobile Ad-Hoc Network Routing Protocols

Abstract: Summary The Efficient routing protocols can provide significant benefits to mobile ad hoc networks, in terms of both performance and reliability. Many routing protocols for such networks have been proposed so far. Amongst the most popular ones are Ad hoc Ondemand Distance Vector (AODV), Destination-Sequenced Distance-Vector Routing protocol (DSDV), Dynamic Source Routing Protocol (DSR), and Optimum Link State Routing (OLSR). Despite the popularity of those protocols, research efforts have not focused much in evaluating their performance when applied to variable bit rate (VBR). In this paper we present our observations regarding the performance comparison of the above protocols for VBR in mobile ad hoc networks (MANETs). We perform extensive simulations, using NS-2 simulator. Our studies have shown that reactive protocols perform better than proactive protocols. Further DSR has performed well for the performance parameters namely delivery ratio and routing overload while AODV performed better in terms of average delay.

(p,q)-Epidemic routing for sparsely populated mobile ad hoc networks

Abstract: This paper considers (p, q )-Epidemic Routing, a class of store-carry-forward routing schemes, for sparsely populated mobile ad hoc networks. Our forwarding scheme includes Two-Hop Forwarding and the conventional Epidemic Routing as special cases. In such forwarding schemes, the original packet is copied many times and its packet copies spread over the network. Therefore those packet copies should be deleted after a packet reaches the destination. We analyze the performance of (p, q)-Epidemic Routing with VACCINE recovery scheme. Unlike most of the existing studies, we discuss the performance of (p, q)-Epidemic Routing in depth, taking account of the recovery process that deletes unnecessary packets from the network.

System and method for dynamically routing communications

Abstract: A system and method for routing an incoming call to a subscriber-selected destination number in accordance with dynamic data concerning the subscriber provided by an address book, a calendar and a presence server. A routing system routes the incoming call in accordance with a subscriber-defined routing rule associated with the originating number of the incoming call, as determined from the address book. The routing rule may specify that the incoming call be routed to a destination number associated with the current date and time, as indicated by the calendar. The routing rule may specify, alternatively or in addition thereto, that the incoming call be routed to a destination number associated with a presence-enabled service on which the subscriber is currently active. The subscriber or caller may also be alternatively notified of the routing of the incoming call.

Enhancing AODV routing protocol using mobility parameters in VANET

Abstract: VANET is new generation of ad hoc networks that implement between vehicles on a road. Because of high mobility, routing in VANET has more problems than MANET. Thereby, in this paper we propose a modification on AODV as MANET routing protocol to make it adaptive for VANET. When a node is mobile, it has three mobility parameters: position, direction and speed. In our method, we have used direction as most important parameter to select next hop during a route discovery phase. With respect to mobility model, if nodes has same direction with source and/or destination nodes, our solution might selects them as a next hop. Position is another parameter that we used for next hop selection.

An algorithmic approach to geographic routing in ad hoc and sensor networks

Abstract: The one type of routing in ad hoc and sensor networks that currently appears to be most amenable to algorithmic analysis is geographic routing. This paper contains an introduction to the problem field of geographic routing, presents a specific routing algorithm based on a synthesis of the greedy forwarding and face routing approaches, and provides an algorithmic analysis of the presented algorithm from both a worst-case and an average-case perspective.

Survey on routing protocols for wireless sensor networks

Abstract: This paper presented the problems and challenges of routing protocols by the analysis and comparison of typical flat and hierarchical routing protocols.Finally,summaried the important features that ideal routing protocols possess as well as its future research strategies and trends.

Fixed point opportunistic routing in delay tolerant networks

Abstract: We propose in this work a single copy and multi-hop opportunistic routing scheme for sparse delay tolerant networks (DTNs). The scheme uses as only input the estimates of the average inter-contact times between the nodes in the network. Defined as the fixed point of a recursive process, it aims at minimizing delivery time in case of independent exponential pairwise inter-contacts. The two properties of loop-free forwarding and polynomial convergence make the scheme workable for routing in DTNs. The routing performances of the scheme are evaluated on three publicly available reference data sets. Comparisons with well known single-copy schemes, including MED and the two hop relay strategy, consistently demonstrate improvements for both delivery ratio and delay.

A Decade of Capacitated Arc Routing

Abstract: Summary. Arc Routing is the arc counterpart to node routing in the sense that focus regarding service and resource constraints are on the arcs and not on the nodes. The key problem within this area is the Capacitated Arc Routing Problem (CARP), which is the arc routing counterpart to the vehicle routing problem. During the last decade, arc routing has been a relatively active research area with respect to lower bounding procedures, solution approaches and modeling. Furthermore, several interesting variations of the problem have been studied. We survey the latest research within the area of arc routing focusing mainly on the CARP and its variants.

MaizeRouter : Engineering an Effective Global Router

Abstract: In this paper, we present the complete design and architectural details of MaizeRouter. MaizeRouter reflects a significant leap in progress over existing publicly available routing tools yet relies upon relatively simple operations, including extreme edge shifting, a technique aimed primarily at the efficient reduction of routing congestion, and edge retraction, a counterpart to extreme edge shifting that serves to reduce unnecessary wirelength. We present enhanced variations of these operations to enable the rapid exploration of candidate paths, along with a form of dynamic cost deflation that provides our various path computation procedures with progressively more accurate (and less optimistic) cost information as search continues. These algorithmic contributions are built upon a framework of interdependent net decomposition, a representation that improves upon traditional two-pin net decomposition by preventing duplication of routing resources while enabling cheap and incremental topological reconstruction. Collectively, these operations permit a broad search space that previous algorithms have been unable to achieve, resulting in solutions of considerably higher quality than those of well-established routers.

Reference point group mobility and random waypoint models in performance evaluation of MANET routing protocols

Abstract: Ad hoc networks are characterized by multihop wireless connectivity, frequently changing network topology and the need for efficient dynamic routing protocols plays an important role. We compare the performance of two prominent on-demand routing protocols for mobile ad hoc networks: dynamic source routing (DSR), ad hoc on-demand distance vector routing (AODV). A detailed simulation model with medium access control (MAC) and physical layer models is used to study the interlayer interactions and their performance implications. We demonstrate that even though DSR and AODV share similar on-demand behavior, the differences in the protocol mechanisms can lead to significant performance differentials. In this paper, we examine both on-demand routing protocols AODV and DSR based on packet delivery ratio, normalized routing load, normalized MAC load, average end-to-end delay by varying the node density, network loading, and mobility variations for reference point group mobility and random waypoint models. This framework aims to evaluate the effect of mobility models on the performance of mobile ad hoc networks (MANETs) routing protocols. Our results show that the protocol performance may vary drastically across mobility models and performance rankings of protocols may vary with the mobility models used. This effect can be explained by the interaction of the mobility characteristics with the connectivity graph properties.

Efficient unicast and multicast support for CMPs

Abstract: Beyond a certain number of cores, multi-core processing chips will require a network-on-chip (NoC) to interconnect the cores and overcome the limitations of a bus. NoCs must be carefully designed to meet constraints like power consumption, area, and ultra low latencies. Although 2D meshes with DOR (dimension-order-routing) meet these constraints, the need for partitioning (e.g. virtual machines, coherency domains) and traffic isolation may prevent the use of DOR routing. Also, core heterogeneity and manufacturing and run-time faults may lead to partially irregular topologies. Routing in these topologies is complex, and previously proposed solutions required routing tables, which drastically increase power consumption, area, and latency. The exception is LBDR (logic-based distributed routing), a flexible routing method for irregular topologies that removes the need for using routing tables (both at end-nodes and switches), thus achieving large savings in chip area and power consumption. But LBDR lacks support for multicast and broadcast, which are required to efficiently support cache coherence protocols both for single and multiple coherence domains. In this paper we propose bLBDR, an efficient multicast and broadcast mechanism built on top of LBDR. bLBDR performs multicast operations using a logic-based broadcast within a domain (a region with bounds). This allows us to isolate the traffic into different domains, thus enabling the concept of visualization at the NoC level. Also, bLBDR extends the concept of routing regions in LBDR by providing a mechanism that allows the flexible definition of multiple domains, sets of network resources. bLBDR fulfills all the practical requirements, including not only low latency and power and area efficiency, but also support for visualization, partitionability, fault-tolerance, traffic isolation and broadcast across the entire network as well as constrained to coherency domains or regions. All this is achieved by a small and power efficient routing logic (7times area savings and 17times power reduction when compared to a routing table in an 8 times 8 mesh network).

Performance Comparison of Two On-demand Routing Protocols for Ad-hoc Networks based on Random Way Point Mobility Model

Abstract: Ad hoc networks are characterized by multihop wireless connectivity, frequently changing network topology and the need for efficient dynamic routing protocols plays an important role. We compare the performance of two prominent on-demand routing protocols for mobile ad hoc networks: Dynamic Source Routing (DSR), Ad Hoc On-demand distance Vector Routing (AODV). A detailed simulation model with MAC and physical layer models is used to study the interlayer interactions and their performance implications. We demonstrate that even though DSR and AODV share similar on-demand behavior, the differences in the protocol mechanisms can lead to significant performance differentials. In this paper we examine two on demand routing protocols AODV and DSR based on packet delivery ratio, normalized routing load, normalized MAC load, average end to end delay by varying the number of sources, speed and pause time.

Robust cooperative routing protocol in mobile wireless sensor networks

Abstract: In wireless sensor networks, path breakage occurs frequently due to node mobility, node failure, and channel impairments It is challenging to combat path breakage with minimal control overhead, while adapting to rapid topological changes Due to the Wireless Broadcast Advantage (WBA), all nodes inside the transmission range of a single transmitting node may receive the packet, hence naturally they can serve as cooperative caching and backup nodes if the intended receiver fails to receive the packet In this paper, we present a distributed robust routing protocol in which nodes work cooperatively to enhance the robustness of routing against path breakage We compare the energy efficiency of cooperative routing with noncooperative routing and show that our robust routing protocol can significantly improve robustness while achieving considerable energy efficiency