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

A survey of mobility models for ad hoc network research

Abstract: In the performance evaluation of a protocol for an ad hoc network, the protocol should be tested under realistic conditions including, but not limited to, a sensible transmission range, limited buffer space for the storage of messages, representative data traffic models, and realistic movements of the mobile users (i.e., a mobility model). This paper is a survey of mobility models that are used in the simulations of ad hoc networks. We describe several mobility models that represent mobile nodes whose movements are independent of each other (i.e., entity mobility models) and several mobility models that represent mobile nodes whose movements are dependent on each other (i.e., group mobility models). The goal of this paper is to present a number of mobility models in order to offer researchers more informed choices when they are deciding upon a mobility model to use in their performance evaluations. Lastly, we present simulation results that illustrate the importance of choosing a mobility model in the simulation of an ad hoc network protocol. Specifically, we illustrate how the performance results of an ad hoc network protocol drastically change as a result of changing the mobility model simulated.

Mobility increases the capacity of ad hoc wireless networks

Abstract: The capacity of ad hoc wireless networks is constrained by the mutual interference of concurrent transmissions between nodes. We study a model of an ad hoc network where n nodes communicate in random source-destination pairs. These nodes are assumed to be mobile. We examine the per-session throughput for applications with loose delay constraints, such that the topology changes over the time-scale of packet delivery. Under this assumption, the per-user throughput can increase dramatically when nodes are mobile rather than fixed. This improvement can be achieved by exploiting a form of multiuser diversity via packet relaying.

Ariadne: a secure on-demand routing protocol for ad hoc networks

Abstract: An ad hoc network is a group of wireless mobile computers (or nodes), in which individual nodes cooperate by forwarding packets for each other to allow nodes to communicate beyond direct wireless transmission range. Prior research in ad hoc networking has generally studied the routing problem in a non-adversarial setting, assuming a trusted environment. In this paper, we present attacks against routing in ad hoc networks, and we present the design and performance evaluation of a new secure on-demand ad hoc network routing protocol, called Ariadne. Ariadne prevents attackers or compromised nodes from tampering with uncompromised routes consisting of uncompromised nodes, and also prevents a large number of types of Denial-of-Service attacks. In addition, Ariadne is efficient, using only highly efficient symmetric cryptographic primitives.

A secure routing protocol for ad hoc networks

Abstract: Most recent ad hoc network research has focused on providing routing services without considering security. We detail security threats against ad hoc routing protocols, specifically examining AODV and DSR. In light of these threats, we identify three different environments with distinct security requirements. We propose a solution to one, the managed-open scenario where no network infrastructure is pre-deployed, but a small amount of prior security coordination is expected. Our protocol, authenticated routing for ad hoc networks (ARAN), is based on certificates and successfully defeats all identified attacks.

The broadcast storm problem in a mobile ad hoc network

Abstract: Broadcasting is a common operation in a network to resolve many issues. In a mobile ad hoc network (MANET) in particular, due to host mobility, such operations are expected to be executed more frequently (such as finding a route to a particular host, paging a particular host, and sending an alarm signal). Because radio signals are likely to overlap with others in a geographical area, a straightforward broadcasting by flooding is usually very costly and will result in serious redundancy, contention, and collision, to which we call the broadcast storm problem. In this paper, we identify this problem by showing how serious it is through analyses and simulations. We propose several schemes to reduce redundant rebroadcasts and differentiate timing of rebroadcasts to alleviate this problem. Simulation results are presented, which show different levels of improvement over the basic flooding approach.

APTEEN: a hybrid protocol for efficient routing and comprehensive information retrieval in wireless

Abstract: Wireless sensor networks with thousands of tiny sensor nodes, are expected to find wide applicability and increasing deployment in coming years, as they enable reliable monitoring and analysis of the environment. In this paper, we propose a hybrid routing protocol (APTEEN) which allows for comprehensive information retrieval. The nodes in such a network not only react to time-critical situations, but also give an overall picture of the network at periodic intervals in a very energy efficient manner. Such a network enables the user to request past, present and future data from the network in the form of historical, one-time and persistent queries respectively. We evaluated the performance of these protocols and observe that these protocols are observed to outperform existing protocols in terms of energy consumption and longevity of the network.

Ad hoc mobile wireless networks : protocols and systems

Abstract: About The Author. Preface. Acknowledgments. Quotes & Words of Wisdom. 1. Introduction to Wireless Networks. Evolution of Mobile Cellular Networks. Global System for Mobile Communications (GSM). General Packet Radio Service (GPRS). Personal Communications Services (PCSs). Wireless LANs (WLANS). Universal Mobile Telecommunications System (UMTS). IMT2000. IS-95, cdmaOne and cdma2000 Evolution. Organization of this Book. 2. Origins Of Ad Hoc: Packet Radio Networks. Introduction. Technical Challenges. Architecture of PRNETs. Components of Packet Radios. Routing in PRNETs. Route Calculation. Pacing Techniques. Media Access in PRNETs. Flow Acknowledgments in PRNETs. Conclusions. 3. Ad Hoc Wireless Networks. What Is an Ad Hoc Network? Heterogeneity in Mobile Devices. Wireless Sensor Networks. Traffic Profiles. Types of Ad Hoc Mobile Communications. Types of Mobile Host Movements. Challenges Facing Ad Hoc Mobile Networks. Conclusions. 4. Ad Hoc Wireless Media Access Protocols. Introduction. Problems in Ad Hoc Channel Access. Receiver-Initiated MAC Protocols. Sender-Initiated MAC Protocols. Existing Ad Hoc MAC Protocols. MARCH: Media Access with Reduced Handshake. Conclusions. 5. Overview of Ad Hoc Routing Protocols. Table-Driven Approaches. Destination Sequenced Distance Vector (DSDV). Wireless Routing Protocol (WRP). Cluster Switch Gateway Routing (CSGR). Source-Initiated On-Demand Approaches. Ad Hoc On-Demand Distance Vector Routing (AODV). Dynamic Source Routing (DSR). Temporally Ordered Routing Algorithm (TORA). Signal Stability Routing (SSR). Location-Aided Routing (LAR). Power-Aware Routing (PAR). Zone Routing Protocol (ZRP). Source Tree Adaptive Routing (STAR). Relative Distance Microdiversity Routing (RDMAR). Conclusions. 6. Associativity-Based Long-Lived Routing. A New Routing Paradigm. Associativity-Based Long-Lived Routing. ABR Protocol Description. Conclusions. 7. Implementation Of Ad Hoc Mobile Networks. Introduction. ABR Protocol Implementation in Linux. Experimentation and Protocol Performance. Important Deductions. Conclusions. 8. Communication Performance of Ad Hoc Networks. Introduction. Performance Parameters of Interest. Route Discovery (RD) Time. End-to-End Delay (EED) Performance. Communication Throughput Performance. Packet Loss Performance. Route Reconfiguration/Repair Time. TCP/IP-Based Applications. Conclusions. 9. Energy Conservation: Power Life Issues. Introduction. Power Management. Advances in Device Power Management. Advances in Protocol Power Management. Power Conservation by Mobile Applications. Periodic Beaconing On Battery Life. Standalone Beaconing. HF Beaconing with Neighboring Nodes. Comparison of HF Beaconing with and without Neighbors. LF Beaconing with Neighboring Nodes. Comparison of LF Beaconing with and without Neighbors. Deductions. Conclusions. 10. Ad Hoc Wireless Multicast Routing. Multicasting in Wired Networks. Multicast Routing in Mobile Ad Hoc Networks. Existing Ad Hoc Multicast Routing Protocols. ABAM: Associativity-Based Ad Hoc Multicast. Comparisons of Multicast Routing Protocols. Conclusions. 11. TCP Over Ad Hoc. Introduction to TCP. Versions of TCP. Problems Facing TCP in Wireless Last-Hop. Problems Facing TCP in Wireless Ad Hoc. Approaches to TCP over Ad Hoc. Conclusion. 12. Internet & Ad Hoc Service Discovery. Resource Discovery in the Internet. Service Location Protocol (SLP) Architecture. SLPv2 Packet Format. Jini. Salutation Protocol. Simple Service Discovery Protocol (SSDP). Service Discovery for Ad Hoc. Ad Hoc Service Location Architectures. Conclusions. 13. BLUETOOTH TECHNOLOGY. Bluetooth Specifications. Bluetooth Architectures. Bluetooth Protocols. Bluetooth Service Discovery. Bluetooth MAC. Bluetooth Packet Structure. Bluetooth Audio. Bluetooth Addressing. Bluetooth Limitations. Bluetooth Implementation. Conclusions. 14. WIRELESS APPLICATION PROTOCOL (WAP). The WAP Forum. The WAP Service Model. The WAP Protocol Architecture. The WWW Programming Model. The WAP Programming Model. Conclusions. 15. Ad Hoc Nomadic Mobile Applications. In the Office. While Traveling. Arriving Home. In the Car. Shopping Malls. The Modern Battlefield. Car-to-Car Mobile Communications. Mobile Collaborative Applications. Location/Context Based Mobile Services. Conclusions. 16. Conclusions and The Future. Pervasive Computing. Motorola PIANO Project. UC Berkeley Sensor Networks: Smart Dust. EPFL Terminodes/Large-Scale Networks. 802.15 PANs and 802.16 Wireless MANs. Ad Hoc Everywhere? Glossary of Terms. References. Index.

SEAD: secure efficient distance vector routing for mobile wireless ad hoc networks

Abstract: An ad hoc network is a collection of wireless computers (nodes), communicating among themselves over possibly multihop paths, without the help of any infrastructure such as base stations or access points. Although many previous ad hoc network routing protocols have been based in part on distance vector approaches, they have generally assumed a trusted environment. We design and evaluate the Secure Efficient Ad hoc Distance vector routing protocol (SEAD), a secure ad hoc network routing protocol based on the design of the Destination-Sequenced Distance-Vector routing protocol (DSDV). In order to support use with nodes of limited CPU processing capability, and to guard against denial-of-service (DoS) attacks in which an attacker attempts to cause other nodes to consume excess network bandwidth or processing time, we use efficient one-way hash functions and do not use asymmetric cryptographic operations in the protocol. SEAD performs well over the range of scenarios we tested, and is robust against multiple uncoordinated attackers creating incorrect routing state in any other node, even in spite of any active attackers or compromised nodes in the network.

Routing security in wireless ad hoc networks

Abstract: A mobile ad hoc network consists of a collection of wireless mobile nodes that are capable of communicating with each other without the use of a network infrastructure or any centralized administration. MANET is an emerging research area with practical applications. However, wireless MANET is particularly vulnerable due to its fundamental characteristics, such as open medium, dynamic topology, distributed cooperation, and constrained capability. Routing plays an important role in the security of the entire network. In general, routing security in wireless MANETs appears to be a problem that is not trivial to solve. In this article we study the routing security issues of MANETs, and analyze in detail one type of attack-the "black hole" problem-that can easily be employed against the MANETs. We also propose a solution for the black hole problem for ad hoc on-demand distance vector routing protocol.

Securing ad hoc routing protocols

Abstract: We consider the problem of incorporating security mechanisms into routing protocols for ad hoc networks. Canned security solutions like IPSec are not applicable. We look at AODV[21] in detail and develop a security mechanism to protect its routing information. We also briefly discuss whether our techniques would also be applicable to other similar routing protocols and about how a key management scheme could be used in conjunction with the solution that we provide.

Power Control in Ad-Hoc Networks : Theory, Architecture Algorithm and Implementation of the COMPOW protocol

Abstract: We present a new protocol for power control in ad hoc networks. We describe the issues in conceptualizing the power control problem, and provide an architecturally simple as well as theoretically well founded solution. The solution is shown to simultaneously satisfy the three objectives of maximizing the traffic carrying capacity of the entire network, extending battery life through providing low power routes, and reducing the contention at the MAC layer. Further, the protocol has the plug and play feature that it can be employed in conjunction with any routing protocol that pro-actively maintains a routing table. The protocol, called COMPOW, has been implemented in the Linux kernel and we describe the software architecture and implementation details.

On-demand multicast routing protocol in multihop wireless mobile networks

Abstract: An ad hoc network is a dynamically reconfigurable wireless network with no fixed infrastructure or central administration. Each host is mobile and must act as a router. Routing and multicasting protocols in ad hoc networks are faced with the challenge of delivering data to destinations through multihop routes in the presence of node movements and topology changes. This paper presents the On-Demand Multicast Routing Protocol (ODMRP) for wireless mobile and hoc networks. ODMRP is a mesh-based, rather than a conventional tree-based, multicast scheme and uses a forwarding group concept; only a subset of nodes forwards the multicast packets via scoped flooding. It applies on-demand procedures to dynamically build routes and maintain multicast group membership. ODMRP is well suited for ad hoc wireless networks with mobile hosts where bandwidth is limited, topology changes frequently, and power is constrained. We evaluate ODMRP performance with other multicast protocols proposed for ad hoc networks via extensive and detailed simulation.

Using directional antennas for medium access control in ad hoc networks

Abstract: Previous research in wireless ad hoc networks typically assumes the use of omnidirectional antennas at all nodes. With omnidirectional antennas, while two nodes are communicating using a given channel, MAC protocols such as IEEE 802.11 require all other nodes in the vicinity to stay silent. With directional antennas, two pairs of nodes located in each other's vicinity may potentially communicate simultaneously, depending on the directions of transmission. This can increase spatial reuse of the wireless channel. In addition, the higher gain of directional antennas allows a node to communicate with other nodes located far away, implying that messages could be delivered to the destination in fewer hops. In this paper, we propose a MAC protocol that exploits the characteristics of directional antennas. Our design focuses on using multi-hop RTSs to establish links between distant nodes, and then transmit CTS, DATA and ACK over a single hop. Results show that our directional MAC protocol can perform better than IEEE 802.11, although we find that the performance is dependent on the topology configuration and the flow patterns in the system.

Scalable Information-Driven Sensor Querying and Routing for Ad Hoc Heterogeneous Sensor Networks

Abstract: This paper describes two novel techniques, information-driven sensor querying IDSQ and constrained anisotropic diffusion routing CADR, for energy-efficient data querying and routing in ad hoc sensor networks for a range of collaborative signal processing tasks. The key idea is to introduce an information utility measure to select which sensors to query and to dynamically guide data routing. This allows us to maximize information gain while minimizing detection latency and bandwidth consumption for tasks such as localization and tracking. Our simulation results have demonstrated that the information-driven querying and routing techniques are more energy efficient, have lower detection latency, and provide anytime algorithms to mitigate risks of link/node failures.

Position-based routing in ad hoc networks

Abstract: The availability of small, inexpensive low-power GPS receivers and techniques for finding relative coordinates based on signal strengths, and the need for the design of power-efficient and scalable networks provided justification for applying position-based routing methods in ad hoc networks. A number of such algorithms were developed previously. This tutorial will concentrate on schemes that are loop-free, localized, and follow a single-path strategy, which are desirable characteristics for scalable routing protocols. Routing protocols have two modes: greedy mode (when the forwarding node is able to advance the message toward the destination) and recovery mode (applied until return to greedy mode is possible). We discuss them separately. Methods also differ in metrics used (hop count, power, cost, congestion, etc.), and in past traffic memorization at nodes (memoryless or memorizing past traffic). Salient properties to be emphasized in this review are guaranteed delivery, scalability, and robustness.

A brief overview of ad hoc networks: challenges and directions

Abstract: One of the most vibrant and active \" new \" fields today is that of ad hoc networks. Within the past few years the field has seen o rapid expansion of visibility and work due to the proliferation of inexpensive, widely available wireless devices and the network community's interest in mobile computing. ne of the most vibrant and active \" new \" fields today is that of ad hoc networks. Significant research in this area has been ongoing for nearly 30 years, also under the names packet radio or multi-hop networks. Within the past few years, though, the field 0 has seen a rapid expansion of visibility and work due to the proliferation of inexpensive, widely available wireless devices and the network community's interest in mobile computing. An ad hoc network is a (possibly mobile) collection of communications devices (nodes) that wish to communicate, but have no fixed infrastructure available, and have no predetermined organization of available links. Individual nodes are responsible for dynamically discovering which other nodes they can directly communicate with. A key assumption is that not all nodes can directly communicate with each other, so nodes are required t o relay packets on behalf of other nodes in order to deliver data across the network. A significant feature of ad hoc networks is that rapid changes in connectivity and link characteristics are introduced due to node mobility and power control practices. Ad hoc networks can be built around any wireless technology, including infrared and radio frequency (RF). Ad hoc networking is a multi-layer problem. The physical layer must adapt to rapid changes in link characteristics. The multiple access control (MAC) layer needs to minimize collisions, allow fair access, and semi-reliably transport data over the shared wireless links in the presence of rapid changes and hidden or exposed terminals. The network layer needs to determine and distribute information used to calculate paths in a way that maintains efficiency when links change often and bandwidth is at a premium. It'also needs to integrate smoothly with traditional , non ad hoc-aware internetworks and perform functions such as auto-configuration in this changing environment. The transport layer must be able to handle delay and packet loss statistics that are very different than wired networks. Finally, applications need to be designed to handle frequent disconnection and reconnec-tion with peer applications as well as widely varying delay and packet loss characteristics. Ad hoc networks …

GPS-free Positioning in Mobile Ad Hoc Networks

Abstract: We consider the problem of node positioning in ad hoc networks. We propose a distributed, infrastructure-free positioning algorithm that does not rely on GPS (Global Positioning System). Instead, the algorithm uses the distances between the nodes to build a relative coordinate system in which the node positions are computed in two dimensions. Despite the distance measurement errors and the motion of the nodes, the algorithm provides sufficient location information and accuracy to support basic network functions. Examples of applications where this algorithm can be used include Location Aided Routing [10] and Geodesic Packet Forwarding [2]. Another example are sensor networks, where mobility is less of a problem. The main contribution of this work is to define and compute relative positions of the nodes in an ad hoc network without using GPS. We further explain how the proposed approach can be applied to wide area ad hoc networks.

Secure Routing for Mobile Ad Hoc Networks

Abstract: The emergence of the Mobile Ad Hoc Networking (MANET) technology advocates self-organized wireless interconnection of communication devices that would either extend or operate in concert with the w ...

Directional virtual carrier sensing for directional antennas in mobile ad hoc networks

Abstract: This paper presents a new carrier sensing mechanism called DVCS (Directional Virtual Carrier Sensing) for wireless communication using directional antennas. DVCS does not require specific antenna configurations or external devices. Instead it only needs information on AOA (Angle of Arrival) and antenna gain for each signal from the underlying physical device, both of which are commonly used for the adaptation of antenna pattern. DVCS also supports interoperability of directional and omni-directional antennas. In this study, the performance of DVCS for mobile ad hoc networks is evaluated using simulation with a realistic directional antenna model and the full IP protocol stack. The experimental results showed that compared with omni-directional communication, DVCS improved network capacity by a factor of 3 to 4 for a 100 node ad hoc network.

An on-demand secure routing protocol resilient to byzantine failures

Abstract: An ad hoc wireless network is an autonomous self-organizing system ofmobile nodes connected by wireless links where nodes not in directrange can communicate via intermediate nodes. A common technique usedin routing protocols for ad hoc wireless networks is to establish therouting paths on-demand, as opposed to continually maintaining acomplete routing table. A significant concern in routing is theability to function in the presence of byzantine failures whichinclude nodes that drop, modify, or mis-route packets in an attempt todisrupt the routing service.We propose an on-demand routing protocol for ad hoc wireless networks that provides resilience to byzantine failures caused by individual or colluding nodes. Our adaptive probing technique detects a malicious link after log n faults have occurred, where n is the length of the path. These links are then avoided by multiplicatively increasing their weights and by using an on-demand route discovery protocol that finds a least weight path to the destination.

Ad hoc network discovery menu

Abstract: When an ad hoc network is formed between short range wireless devices, at least one device assumes the role of an ad hoc network information provider for the new piconet. In this role, the device allocates a browsing hierarchy of service classes in its service registry. The service classes will provide a record to characterize the ad hoc network. When a new wireless device arrives within the communication range of any member of the ad hoc network, its inquiry signals are answered by the first member detecting the inquiry. If that first member is an ad hoc network information provider, it responds with information accessed from its service registry characterizing the ad hoc network. If, instead, an ordinary device in the ad hoc network is the first to respond to the inquiry signals of the arriving device, the device responds with the address of the ad hoc network information provider. The arriving device then pages the ad hoc network information provider to obtain information characterizing the ad hoc network.

Topology control and routing in ad hoc networks: a survey

Abstract: An ad hoc wireless network, or simply an ad hoc network, consists of a collection of geographically distributed nodes that communicate with one other over a wireless medium. An ad hoc network differs from cellular networks in that there is no wired infrastructure and the communication capabilities of the network are limited by the battery power of the network nodes. One of the original motivations for ad hoc networks is found in military applications. A classic example of ad hoc networking is network of war fighters and their mobile platforms in battlefields. Indeed, a wealth of early research in the area involved the development of packet-radio networks (PRNs) and survivable radio networks [16]. While military applications still dominate the research needs in ad hoc networking, the recent rapid advent of mobile telephony and plethora of personal digital assistants has brought to the fore a number of potential commercial applications of ad hoc networks. Examples are disaster relief, conferencing, home networking, sensor networks, personal area networks, and embedded computing applications [37].The lack of a fixed infrastructure in ad hoc networks implies that any computation on the network needs to be carried out in a decentralized manner. Thus, many of the important problems in ad hoc networking can be formulated as problems in distributed computing. However, there are certain characteristics of ad hoc networks that makes this study somewhat different than traditional work in distributed computing. In this article, we review some of the characteristic features of ad hoc networks, formulate problems and survey research work done in the area. We focus on two basic problem domains: topology control, the problem of computing and maintaining a connected topology among the network nodes, and routing. This article is not intended to be a comprehensive survey on ad hoc networking. The choice of the problems discussed in this article are somewhat biased by the research interests of the author.The remainder of this article is organized as follows. In Section 2, we describe various aspects relevant to modeling ad hoc networks. In Section 3, we discuss topology control. Since the nodes of an ad hoc network are often associated with points in 2-dimensional space, topology control is closely tied to computational geometry; we will briefly review this relationship and extant work in the area. In Section 4, we discuss routing protocols for ad hoc networks. After a brief overview of the many protocols that have been proposed, we discuss alternative approaches based on the adversarial network model.

Nodes bearing grudges: towards routing security, fairness, and robustness in mobile ad hoc networks

Abstract: Devices in mobile ad hoc networks work as network nodes and relay packets originated by other nodes. Mobile ad hoc networks can work properly only if the participating nodes cooperate in routing and forwarding. For individual nodes it might be advantageous not to cooperate. The new routing protocol extensions presented in this paper make it possible to detect and isolate misbehaving nodes, thus making denying cooperation undesirable. In the presented scheme, trust relationships and routing decisions are made based on experienced, observed, or reported routing and forwarding behavior of other nodes. A hybrid scheme of selective altruism and utilitarianism is presented to strengthen mobile ad hoc network protocols in their resistance to security attacks, while aiming at keeping network throughput high. This paper focuses particularly on the network layer using the dynamic source routing (DSR) protocol as an example.

An access and routing protocol for ad hoc networks using synchronous collision resolution and node state dissemination

Abstract: An ad hoc network organizes itself to provide communications without need for an a priori designated central control mechanism or base stations Such self-organization is challenging in a multihop ad hoc network having member nodes that are highly mobile and widely distributed A Synchronous Collision Resolution (SCR) protocol and a Node State Routing (NSR) protocol are well suited to provide efficient ad hoc network organization SCR is an access protocol that achieves high capacity collision free access using a signaling approach that creates a random cellular-like network after each signaling period NSR is a routing protocol that uses the dissemination of node states to predict link availability and to assign metrics to those links for the creation of optimized routes In use, the present invention provides quality of service and supports energy conservation for the mobile nodes

Self-securing ad hoc wireless networks

Abstract: Mobile ad hoc networking offers convenient infrastructureless communication over the shared wireless channel. However, the nature of ad hoc networks makes them vulnerable to security attacks. Examples of such attacks include passive eavesdropping over the wireless channel, denial of service attacks by malicious nodes and attacks from compromised nodes or stolen devices. Unlike their wired counterpart, infrastructureless ad hoc networks do not have a clear line of defense, and every node must be prepared for encounters with an adversary. Therefore, a centralized or hierarchical network security solution does not work well.This work provides scalable, distributed authentication services in ad hoc networks. Our design takes a self-securing approach, in which multiple nodes (say, k) collaboratively provide authentication services for other nodes in the network. We first formalize a localized trust model that lays the foundation for the design. We further propose refined localized certification services based on our previous work, and develop a new scalable share update to resist more powerful adversaries. Finally, we evaluate the solution through simulation and implementation.

QoS routing for mobile ad hoc networks

Abstract: A quality-of-service (QoS) routing protocol is developed for mobile ad hoc networks. It can establish QoS routes with reserved bandwidth on a per flow basis in a network employing TDMA. An efficient algorithm for calculating the end-to-end bandwidth on a path is developed and used together with the route discovery mechanism of AODV to setup QoS routes. In our simulations the QoS routing protocol produces higher throughput and lower delay than its best-effort counterpart.

Secure ad hoc on-demand distance vector routing

Abstract: This article gives an overview of different approaches to provide security features to routing protocols in mobile ad hoc networks (MANET). It also describes Secure AODV (an extension to AODV that provides security features) giving a summary of its operation and talking about future enhancements to the protocol.