Showing papers on "Ad hoc wireless distribution service published in 2010"

Mobile Ad Hoc Networking

Abstract: Contributors.Preface.1. Mobile Ad-Hoc networking with a View of 4G Wireless: Imperatives and Challenges (J. Liu & I. Chlamtac).2. Off-the-Shelf Enables of Ad Hoc Networks (G. Zaruba & S. Das).3. IEEE 802.11 in Ad Hoc Networks: Protocols, Performance and Open Issues (G. Anastasi, et al.).4. Scatternet Formation in Bluetooth Networks (S. Basagni, et al.).5. Antenna Beamforming and Power Control for Ad Hoc Networks (R. Ramanathan).6. Topology Control in Wireless Ad Hoc Networks (X. Li).7. Broadcasting and Activity Scheduling in Ad Hoc Networks (I. Stojmenovic & J. Wu).8. Location Discovery (A. Savvidesn & M. Srivastava).9. Mobile Ad Hoc Networks (MANETs): Routing Technology for Dynamic, Wireless Networking (J. Macker & M. Corson).10. Routing Approaches in Mobile Ad Hoc Networks (E. Belding-Royer).11. Energy-Efficient Communication in Ad Hoc Wireless Networks (L. Feeney).12. Ad Hoc Networks Security (P. Michiardi & R. Molva).13. Self-Organized and Cooperative Ad Hoc Networking (S. Giordano & A. Urpi).14. Simulation and Modeling of Wireless, Mobile, and Ad Hoc Networks (A. Boukerche & L. Bononi).15. Modeling Cross-Layering Interaction Using Inverse Optimization (V. Syrotiuk & A.Bikki).16. Algorithmic Challenges in Ad Hoc Networks (A. Farago).Index.About the Editors.

Survey of Routing Protocols in Vehicular Ad Hoc Networks

Abstract: The chapter provides a survey of routing protocols in vehicular ad hoc networks. The routing protocols fall into two major categories of topology-based and position-based routing. The chapter discusses the advantages and disadvantages of these routing protocols, explores the motivation behind their design and trace the evolution of these routing protocols. Finally, it concludes the chapter by pointing out some open issues and possible direction of future research related to VANET routing. INTRODUCTION With the sharp increase of vehicles on roads in the recent years, driving has not stopped from being more challenging and dangerous. Roads are saturated, safety distance and reasonable speeds are hardly respected, and drivers often lack enough attention. Without a clear signal of improvement in the near future, leading car manufacturers decided to jointly work with national government agencies to develop solutions aimed at helping drivers on the roads by anticipating hazardous events or avoiding bad traffic areas. One of the outcomes has been a novel type of wireless access called Wireless Access for Vehicular Environment (WAVE) dedicated to vehicle-to-vehicle and vehicle-to-roadside communications. While the major objective has clearly been to improve the overall safety of vehicular traffic, promising traffic management solutions and on-board entertainment applications are also expected by the different bodies (C2CCC, VII, CALM) and projects (VICS (Yamada, 1996), CarTALK 2000 (Reichardt D, 2002), NOW, CarNet (Morris R, 2000), FleetNet (Franz, 2001)) involved in this field. When equipped with WAVE communication devices, cars and roadside units form a highly dynamic network called a Vehicular Ad Hoc Network (VANET), a special kind of Mobile AdHoc Networks (MANETs). While safety applications mostly need local broadcast connectivity, it is expected that some emerging scenarios (Lee, 2009) developed for intelligent transportation systems (ITS) would benefit from unicast communication over a multi-hop connectivity. Moreover, it is conceivable that applications that deliver contents and disseminate useful information can flourish with the support of multi-hop connectivity in VANETs. Although countless numbers of routing protocols (Mauve, 2001; Mehran, 2004) have been developed in MANETs, many do not apply well to VANETs. VANETs represent a particularly challenging class of MANETs. They are distributed, self-organizing communication networks formed by moving vehicles, and are thus characterized by very high node mobility and limited degrees of freedom in mobility patterns. As shown in Figure 1, there are two categories of routing protocols: topology-based and geographic routing. Topology-based routing uses the information about links that exist in the network to perform packet forwarding. Geographic routing uses neighboring location information to perform packet forwarding. Since link information changes in a regular basis, topology-based routing suffers from routing route breaks. Car 2 Car Communication Consortium, http://www.car‐to‐car.org The Vehicle Infrastructure Integration (VII) Initiative, http://www.vehicle‐infrastructure.org Continuous Air Interface for Long and Medium Interface (CALM), http://www.calm.hu Vehicle Information and Communication System Network On Wheels, www.network‐on‐wheels.de Figure 1: Taxonomy of Various Routing Protocols in VANET Despite many surveys already published on routing protocols in MANETs (Mauve, 2001; Mehran, 2004Giordano, 2003; Stojemnovic, 2004), a survey of newly developed routing protocols specific to VANETs has long been overdue. Li et al. (2007) have made an effort to introduce VANET routing protocols, yet there is still deficiency in a thorough and comprehensive treatment on this subject. A discussion of VANET topics and applications is incomplete without detailed coverage of relevant routing protocols and their impact on overall VANET architecture. In this book chapter, we seek to provide the missing building blocks by detailing the advances in VANET routing protocols. Section III describes the VANET architecture and its characteristics. Section IV presents a survey of these protocols experimented on or tailored to VANET and their advantages and disadvantages. It will explore the motivation behind their design and trace the evolution of these routing protocols. Finally, Section V will point out some open issues and possible direction of future research, and then conclude the book chapter.

A Survey of Routing Protocols in Mobile Ad Hoc Networks

Abstract: Mobile Ad Hoc Network (MANET) is collection of multi-hop wireless mobile nodes that communicate with each other without centralized control or established infrastructure. The wireless links in this network are highly error prone and can go down frequently due to mobility of nodes, interference and less infrastructure. Therefore, routing in MANET is a critical task due to highly dynamic environment. In recent years, several routing protocols have been proposed for mobile ad hoc networks and prominent among them are DSR, AODV and TORA. This research paper provides an overview of these protocols by presenting their characteristics, functionality, benefits and limitations and then makes their comparative analysis so to analyze their performance. The objective is to make observations about how the performance of these protocols can be improved.

Handbook of Mobile Ad Hoc Networks for Mobility Models

Abstract: The Mobile Ad Hoc Network (MANET) has emerged as the next frontier for wireless communications networking in both the military and commercial arena. Handbook of Mobile Ad Hoc Networks for Mobility Models introduces 40 different major mobility models along with numerous associate mobility models to be used in a variety of MANET networking environments in the ground, air, space, and/or under water mobile vehicles and/or handheld devices. These vehicles include cars, armors, ships, under-sea vehicles, manned and unmanned airborne vehicles, spacecrafts and more. This handbook also describes how each mobility pattern affects the MANET performance from physical to application layer; such as throughput capacity, delay, jitter, packet loss and packet delivery ratio, longevity of route, route overhead, reliability, and survivability. Case studies, examples, and exercises are provided throughout the book. Handbook of Mobile Ad Hoc Networks for Mobility Models is for advanced-level students and researchers concentrating on electrical engineering and computer science within wireless technology. Industry professionals working in the areas of mobile ad hoc networks, communications engineering, military establishments engaged in communications engineering, equipment manufacturers who are designing radios, mobile wireless routers, wireless local area networks, and mobile ad hoc network equipment will find this book useful as well.

Genetic Algorithms With Immigrants and Memory Schemes for Dynamic Shortest Path Routing Problems in Mobile Ad Hoc Networks

Abstract: In recent years, the static shortest path (SP) problem has been well addressed using intelligent optimization techniques, e.g., artificial neural networks, genetic algorithms (GAs), particle swarm optimization, etc. However, with the advancement in wireless communications, more and more mobile wireless networks appear, e.g., mobile networks [mobile ad hoc networks (MANETs)], wireless sensor networks, etc. One of the most important characteristics in mobile wireless networks is the topology dynamics, i.e., the network topology changes over time due to energy conservation or node mobility. Therefore, the SP routing problem in MANETs turns out to be a dynamic optimization problem. In this paper, we propose to use GAs with immigrants and memory schemes to solve the dynamic SP routing problem in MANETs. We consider MANETs as target systems because they represent new-generation wireless networks. The experimental results show that these immigrants and memory-based GAs can quickly adapt to environmental changes (i.e., the network topology changes) and produce high-quality solutions after each change.

AD HOC NETWORKS: Technologies and Protocols

Abstract: AD HOC NETWORKS: Technologies and Protocols is a concise in-depth treatment of various constituent components of ad hoc network protocols. It reviews issues related to medium access control, scalable routing, group communications, use of directional/smart antennas, network security, and power management among other topics. The authors examine various technologies that may aid ad hoc networking including the presence of an ability to tune transmission power levels or the deployment of sophisticated smart antennae. Contributors to this volume include experts that have been active in ad hoc network research and have published in the premier conferences and journals in this subject area. AD HOC NETWORKS: Protocols and Technologies will be immensely useful as a reference work to engineers and researchers as well as to advanced level students in the areas of wireless networks, and computer networks.

Trust-based on-demand multipath routing in mobile ad hoc networks

Abstract: A mobile ad hoc network (MANET) is a self-organised system comprised of mobile wireless nodes. All nodes act as both communicators and routers. Owing to multi-hop routing and absence of centralised administration in open environment, MANETs are vulnerable to attacks by malicious nodes. In order to decrease the hazards from malicious nodes, the authors incorporate the concept of trust to MANETs and build a simple trust model to evaluate neighbours’ behaviours – forwarding packets. Extended from the ad hoc on-demand distance vector (AODV) routing protocol and the ad hoc on-demand multipath distance vector (AOMDV) routing protocol, a trust-based reactive multipath routing protocol, ad hoc on-demand trusted-path distance vector (AOTDV), is proposed for MANETs. This protocol is able to discover multiple loop-free paths as candidates in one route discovery. These paths are evaluated by two aspects: hop counts and trust values. This two-dimensional evaluation provides a flexible and feasible approach to choose the shortest path from the candidates that meet the requirements of data packets for dependability or trust. Furthermore, the authors give a routing example in details to describe the procedures of route discovery and the differences among AODV, AOMDV and AOTDV. Several experiments have been conducted to compare these protocols and the results show that AOTDV improves packet delivery ratio and mitigates the impairment from black hole, grey hole and modification attacks.

Current Research Work on Routing Protocols for MANET: A Literature Survey

Abstract: Mobile ad hoc networks (MANETs) are autonomously self-organized networks without infrastructure support. In a mobile ad hoc network, nodes move arbitrarily; therefore the network may experience rapid and unpredictable topology changes. Because nodes in a MANET normally have limited transmission ranges, some nodes cannot communicate directly with each other. Hence, routing paths in mobile ad hoc networks potentially contain multiple hops, and every node in mobile ad hoc networks has the responsibility to act as a router. This paper is a survey of active research work on routing protocols for MANET.

A New Cluster Based Routing Protocol for VANET

Abstract: With the development of vehicles and mobile Ad Hoc network technology, the Vehicle Ad hoc Network (VANET) has become an emerging field of study It is a challenging problem for searching and maintaining an effective route for transporting some data information In this paper the authors designed a new routing protocol for VANET based on the former results, called CBR (Cluster Based Routing) Compared with other routing protocols, the new one has obvious improvement in the average routing overhead and small average end to end delay jitter with the increase of vehicles number The real-time traffic applications require data transmission delay time to be relatively stable, small average end to end delay jitter with the increase of vehicles number just meets the real-time application needs

Social network analysis concepts in the design of wireless Ad Hoc network protocols

Abstract: This article presents a survey of ad hoc networking protocols that have used concepts such as centrality metrics and community formation from the area of social network analysis, which is seen as a network measurement task that deals with structural properties of the network graph. We recognize the synergy among social network analysis and ad hoc networking as a fertile research area that can provide significant advances for the design of network protocols, especially in environments where the communication is opportunistic in nature and therefore cannot be easily or efficiently described as an optimization problem, and other systematic approaches like cross-layer optimization are more difficult to apply.

Cooperative Caching in Wireless P2P Networks: Design, Implementation, and Evaluation

Abstract: Some recent studies have shown that cooperative cache can improve the system performance in wireless P2P networks such as ad hoc networks and mesh networks. However, all these studies are at a very high level, leaving many design and implementation issues unanswered. In this paper, we present our design and implementation of cooperative cache in wireless P2P networks, and propose solutions to find the best place to cache the data. We propose a novel asymmetric cooperative cache approach, where the data requests are transmitted to the cache layer on every node, but the data replies are only transmitted to the cache layer at the intermediate nodes that need to cache the data. This solution not only reduces the overhead of copying data between the user space and the kernel space, it also allows data pipelines to reduce the end-to-end delay. We also study the effects of different MAC layers, such as 802.11-based ad hoc networks and multi-interface-multichannel-based mesh networks, on the performance of cooperative cache. Our results show that the asymmetric approach outperforms the symmetric approach in traditional 802.11-based ad hoc networks by removing most of the processing overhead. In mesh networks, the asymmetric approach can significantly reduce the data access delay compared to the symmetric approach due to data pipelines.

A cluster-based trust-aware routing protocol for mobile ad hoc networks

Abstract: Routing protocols are the binding force in mobile ad hoc network (MANETs) since they facilitate communication beyond the wireless transmission range of the nodes. However, the infrastructure-less, pervasive, and distributed nature of MANETs renders them vulnerable to security threats. In this paper, we propose a novel cluster-based trust-aware routing protocol (CBTRP) for MANETs to protect forwarded packets from intermediary malicious nodes. The proposed protocol organizes the network into one-hop disjoint clusters then elects the most qualified and trustworthy nodes to play the role of cluster-heads that are responsible for handling all the routing activities. The proposed CBTRP continuously ensures the trustworthiness of cluster-heads by replacing them as soon as they become malicious and can dynamically update the packet path to avoid malicious routes. We have implemented and simulated the proposed protocol then evaluated its performance compared to the clustered based routing protocol (CBRP) as well as the 2ACK approach. Comparisons and analysis have shown the effectiveness of our proposed scheme.

A game theory based reputation mechanism to incentivize cooperation in wireless ad hoc networks

Abstract: In wireless ad hoc networks one way to incentivize nodes to forward other nodes' packets is through the use of reputation mechanisms, where cooperation is induced by the threat of partial or total network disconnection if a node acts selfishly. The problem is that packet collisions and interference may make cooperative nodes appear selfish sometimes, generating unnecessary and unwanted punishments. With the use of a simple network model we first study the performance of some proposed reputation strategies and then present a new mechanism called DARWIN (Distributed and Adaptive Reputation mechanism for Wireless ad hoc Networks), where we try to avoid retaliation situations after a node is falsely perceived as selfish to help restore cooperation quickly. Using game theory, we prove that our mechanism is robust to imperfect measurements, is collusion-resistant and can achieve full cooperation among nodes. Simulations are presented to complement our theoretical analysis and evaluate the performance of our algorithm compared to other proposed reputation strategies.

CAODV: Routing in mobile ad-hoc cognitive radio networks

Abstract: This paper deals with the routing in cognitive mobile ad hoc networks. We propose to modify the widely adopted Ad-hoc On-demand Distance Vector (AODV) protocol [1] in order to assure its functionality in the considered scenario. The resulting protocol, referred to as the Cognitive Ad-hoc On-demand Distance Vector (CAODV) protocol, has been designed according to three guidelines: i) to avoid regions of primary users activity during both route formation and packet discovery without requiring a dedicated common control channel; ii) to perform a joint path and channel selection at each forwarder to minimize the route cost; iii) to take advantage of the availability of multiple channels to improve the overall performances. The performances of CAODV have been evaluated by means of numerical simulations, and the experimental results confirm its effectiveness for cognitive mobile ad hoc networks.

Route Stability Based QoS Routing in Mobile Ad Hoc Networks

Abstract: To provide high quality communications service among mobile wireless devices is basically a challenging task in wireless ad hoc networks. In this paper, we propose a Route Stability based QoS Routing (RSQR) protocol in Mobile Ad Hoc Networks (MANETs) which is an extension of QoS routing with throughput and delay constraints. Ensuring a data path to be valid for sufficiently longer period of time is a very difficult problem in MANET due to its highly dynamic nature. We propose a simple model for computing link stability and route stability based on received signal strengths. By including some extra fields in route request/reply packets, the route stability information can be utilized to select a route with higher stability among all the feasible routes between a given source destination pair. Further, inclusion of a signal strength based admission control enhances the performance of the routing. Results of our experiments show performance improvements in terms of packet delivery ratio, control overhead and average end-to-end delay in comparison with a QoS routing protocol proposed by Q. Xue and A. Ganz.

Performance Analysis of Proactive and Reactive Routing Protocols for Ad hoc Networks

Abstract: Mobile Ad hoc networks are the collection of wireless nodes that can exchange information dynamically among them without pre existing fixed infrastructure. Because of highly dynamic in nature, performance of routing protocols is an important issue. In addition to this routing protocols face many challenges like limited battery backup, limited processing capability and limited memory resources. Other than efficient routing, efficient utilization of battery capacity and Security are also the major concern for routing protocols. This paper presents simulation based comparison and performance analysis on different parameters like PDF, Average e-e delay, Routing Overheads and Packet Loss. The study is about three main protocols DSR, AODV (Reactive) and DSDV (Proactive).

Secure On-demand Routing Protocol for Ad Hoc Network

Abstract: The security issue of the ad hoc network has attracted the attention of people.Therefore,the security of the routing protocol for the ad hoc network is the key problem.A secure ad hoc on-demand routing(SAOR)protocol suitable for ad hoc network is proposed,which uses the session key between pairs of mobile nodes and message anthentication code based on hash function to verify the validity of the route discovery and route replies.By binding the MAC address with ID of every node,the various complex attacks such as wormhole attacks are defended by the proposed neighbor-node maintenance mechanism.NS-2 simulation results show that SAOR can effectively detect and thwart most of attacks upon MANETs(mobile ad hoc network).

A unified analysis of routing protocols in MANETs

Abstract: This paper presents a mathematical framework for the evaluation of the performance of proactive and reactive routing protocols in mobile ad hoc networks (MANETs). This unified framework provides a parametric view of protocol performance, which in turn provides a deeper insight into protocol operations and reveals the compounding and interacting effects of protocol logic and network parameters. The parametric model comes from a combinatorial model, where the routing logic is synthesized along with the characterization of MAC performance. Each wireless node is seen independently as a two-customer queue without priority, where the two types of customers are unicast and broadcast packets. The model captures the essential behavior and scalability limits in network size of both classes of routing protocols, and provides valuable guidance on the performance of reactive or proactive routing protocols under various network configurations and mobility conditions. The analytical results obtained with the proposed model are in close agreement with simulation results obtained from discrete-event Qualnet simulations.

Routing Approaches in Delay Tolerant Networks: A Survey

Abstract: Delay Tolerant Networks (DTNs) have evolved from Mobile Ad Hoc Networks (MANET). It is a network, where contemporaneous connectivity among all nodes doesn’t exist. This leads to the problem of how to route a packet from one node to another, in such a network. This problem becomes more complex, when the node mobility also is considered. The researchers have attempted to address this issue for over a decade. They have found that communication is possible in such a challenged network. The design of routing protocol for such networks is an important issue. This work surveys the literature and classifies the various routing approaches.

An experimental comparison of routing protocols in multi hop ad hoc networks

Abstract: This study experimentally compares the performance of three different multi hop ad hoc network routing protocols. Traditional routing protocols have proven inadequate in wireless ad hoc networks, motivating the need for ad hoc specific routing protocols. This study tests link state, distance vector and biologically inspired approaches to routing using OLSR, Babel and BATMAN routing protocols. The importance of OSI layers is also discussed. This study concludes that the routing protocol's overhead is the largest determinant of performance in small multi hop ad hoc networks. The results show that Babel outperforms OLSR and BATMAN routing protocols and that the OSI layer of the routing protocol has little impact on performance.

Routing Security in Ad Hoc Wireless Networks

Abstract: Wireless networks provide rapid, untethered access to information and computing, eliminating the barriers of distance, time, and location for many applications ranging from collaborative, distributed mobile computing to disaster recovery (such as fire, flood, earthquake), law enforcement (crowd control, search, and rescue), and military communications (command, control, surveillance, and reconnaissance). An ad hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any established infrastructure or centralized administration [11]

Castor: Scalable Secure Routing for Ad Hoc Networks

Abstract: Wireless ad hoc networks are inherently vulnerable, as any node can disrupt the communication of potentially any other node in the network. Many solutions to this problem have been proposed. In this paper, we take a fresh and comprehensive approach that addresses simultaneously three aspects: security, scalability and adaptability to changing network conditions. Our communication protocol, Castor, occupies a unique point in the design space: it does not use any control messages except simple packet acknowledgments, and each node makes routing decisions locally and independently without exchanging any routing state with other nodes. Its novel design makes Castor resilient to a wide range of attacks and allows the protocol to scale to large network sizes and to remain efficient under high mobility. We compare Castor against four representative protocols from the literature. Our protocol achieves up to two times higher packet delivery rates, particularly in large and highly volatile networks, while incurring no or only limited additional overhead. At the same time, Castor is able to survive more severe attacks and recovers from them faster.

On routing with guaranteed delivery in three-dimensional ad hoc wireless networks

Abstract: We study the problem of routing in three-dimensional ad hoc networks. We are interested in routing algorithms that guarantee delivery and are k-local, i.e., each intermediate node v's routing decision only depends on knowledge of the labels of the source and destination nodes, of the subgraph induced by nodes within distance k of v, and of the neighbour of v from which the message was received. We model a three-dimensional ad hoc network by a unit ball graph, where nodes are points in three-dimensional space, and for each node v, there is an edge between v and every node u contained in the unit-radius ball centred at v. The question of whether there is a simple local routing algorithm that guarantees delivery in unit ball graphs has been open for some time. In this paper, we answer this question in the negative: we show that for any fixed k, there can be no k-local routing algorithm that guarantees delivery on all unit ball graphs. This result is in contrast with the two-dimensional case, where 1-local routing algorithms that guarantee delivery are known. Specifically, we show that guaranteed delivery is possible if the nodes of the unit ball graph are contained in a slab of thickness $$1/\sqrt{2}.$$ However, there is no k-local routing algorithm that guarantees delivery for the class of unit ball graphs contained in thicker slabs, i.e., slabs of thickness $$1/\sqrt{2} + \epsilon$$ for some $$ \epsilon > 0.$$ The algorithm for routing in thin slabs derives from a transformation of unit ball graphs contained in thin slabs into quasi unit disc graphs, which yields a 2-local routing algorithm. We also show several results that further elaborate on the relationship between these two classes of graphs.

A survey on swarm intelligence based routing protocols in wireless sensor networks

Abstract: In the last decade, wireless sensor networks have attracted many researchers. One of the main topics adopted by researchers studying on wireless sensor networks is developing routing protocols for wireless systems. Routing protocol development deals with problems such as complexity, scalability, adaptability, survivability and battery life in wireless systems. Routing protocols grounded for wireless systems are developed in order to solve these problems. In this paper, we briefly discussed especially, swarm intelligence based routing protocols for wireless sensor networks. Key words:

A simulation based performance comparison of routing protocol on Mobile Ad-hoc Network (proactive, reactive and hybrid)

Abstract: Mobile Ad-hoc Network (MANET) is a collection of wireless mobile nodes which dynamically forms a temporary network without the use of any existing network infrastructure or centralized administration. Recently, there has been a tremendous growth in the sales of laptops, handheld computers, PDA and portable computers. These smaller computers nevertheless can be equipped with megabytes/gigabytes of disk storage, high-resolution color displays, pointing devices and wireless communications adapters. Moreover, since many of these small computers operate for hours with battery power, users are free to move without being constrained by wires. To support such type of scenario MANET has been designed. MANET has several characteristics such as, dynamic topologies, bandwidth-constrained, variable capacity links, energy-constrained operation and limited physical security. There are three types of routing protocols in MANET such as Proactive, Reactive, and Hybrid. In this paper, a detailed simulation based performance study and analysis is performed on these types of routing protocols over MANET. Ad Hoc On-Demand Distance Vector (AODV), and Dynamic MANET On-demand (DYMO) routing protocol (reactive), Optimized Link State Routing protocol (OLSR) (proactive) and Zone Routing Protocol (ZRP) is (hybrid) have been considered in this paper for the investigation and their relative performance is reported.

Quality of Service in mobile ad hoc networks: a survey

Abstract: To support multimedia applications, it is desirable that an ad hoc network has a provision of Quality of Service (QoS). However, the provision of QoS in a mobile ad hoc network is a challenging task. In this paper, we present a review of the current research related to the provision of QoS in an ad hoc environment. We examine issues and challenges involved in providing QoS in an ad hoc network. We discuss methods of QoS provisioning at different levels including those at the levels of routing, Medium Access Control (MAC), and cross layer. Also, we discuss schemes for admission control and scheduling that are proposed in the literature for the provision of QoS. We compare salient features of various solutions and approaches and point out directions for future work.

Extensions to OSPF to Support Mobile Ad Hoc Networking

Abstract: This document describes extensions to OSPF to support mobile ad hoc networks (MANETs). The extensions, called OSPF-OR (OSPF-Overlapping Relay), include mechanisms for link-local signaling (LLS), an OSPF- MANET interface, a simple technique to reduce the size of Hello packets by only transmitting incremental state changes, and a method for optimized flooding of routing updates. OSPF-OR also provides a means to reduce unnecessary adjacencies to support larger MANETs. [STANDARDS-TRACK]